Interview Prep/Companies/Palantir Technologies PT
Palantir Technologies
29 questions tracked25 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 29 of 29 questions
1Two PointersStringBinary SearchRolling Hash+2
2Two PointersStringBinary SearchRolling Hash+2
5Hash TableLinked ListDesignDoubly-Linked List
7ArrayHash TableSliding Window
8ArrayDynamic ProgrammingMemoization
9MediumMaximum Size Subarray Sum Equals k
ArrayHash TablePrefix Sum
13ArraySliding WindowSortingBucket Sort+1
14Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
15MediumShortest Word Distance III
ArrayString
17ArrayDivide and ConquerTreeMatrix
19ArrayHash TableSortingCounting
20MediumCount the Number of Good Subsequences
Hash TableMathStringCombinatorics+1
21ArrayDepth-First SearchBreadth-First SearchMatrix
22ArrayHash TableStringDepth-First Search+3
23ArrayDepth-First SearchBreadth-First SearchUnion Find+1
24Depth-First SearchBreadth-First SearchGraphTopological Sort
25MediumNumber of Divisible Triplet Sums
ArrayHash Table
26ArrayBreadth-First SearchHeap (Priority Queue)Matrix
27Linked ListTwo PointersDivide and ConquerSorting+1
28ArrayStackMonotonic Stack