Palantir-Technologies Logo

Palantir-Technologies Questions

Here are the LeetCode questions for Palantir-Technologies.

Total: 40
Easy: 6
Medium: 27
Hard: 7
Progress: 0%

Topic Frequency Analysis

All Topics

Rank Topic Frequency Percentage
1 Array 25
62.5%
2 String 10
25.0%
3 Hash Table 8
20.0%
4 Sorting 7
17.5%
5 Depth-First Search 6
15.0%
6 Dynamic Programming 6
15.0%
7 Two Pointers 5
12.5%
8 Breadth-First Search 5
12.5%
9 Matrix 4
10.0%
10 Math 4
10.0%
11 Union-Find 3
7.5%
12 Design 3
7.5%
13 Sliding Window 3
7.5%
14 Prefix Sum 3
7.5%
15 Divide and Conquer 2
5.0%
16 Binary Search 2
5.0%
17 Bit Manipulation 2
5.0%
18 Recursion 2
5.0%
19 Linked List 2
5.0%
20 Stack 2
5.0%
21 Graph Theory 2
5.0%
22 Monotonic Stack 2
5.0%
23 Counting 2
5.0%
24 Bucket Sort 1
2.5%
25 Hash Function 1
2.5%
26 Greedy 1
2.5%
27 Rolling Hash 1
2.5%
28 Database 1
2.5%
29 Ordered Set 1
2.5%
30 Binary Tree 1
2.5%
31 Tree 1
2.5%
32 Topological Sort 1
2.5%
33 Binary Search Tree 1
2.5%
34 Doubly-Linked List 1
2.5%
35 Merge Sort 1
2.5%
36 Heap (Priority Queue) 1
2.5%
37 Interactive 1
2.5%
No. Question Title Link Difficulty Solved
1 Minimum Cost Path with Edge Reversals Visit Medium
2 Find Beautiful Indices in the Given Array II Visit Hard
3 Find Beautiful Indices in the Given Array I Visit Medium
4 Number of Divisible Triplet Sums Visit Medium
5 Count the Number of Good Subsequences Visit Medium
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 40 questions for free!

Log In

Frequently Asked Questions

Common questions about Palantir-Technologies interviews