Sign In
Back to Sheets/Palantir-technologies Master DSA Sheet

Palantir-technologies Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Palantir-technologies interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specificpalantir-technologies-prep
0
30
Course Schedule II6 Months
Medium
Find Beautiful Indices in the Given Array II
Hard
Merge Intervals
Medium
Construct Quad Tree
Medium
Longest Palindromic Substring
Medium
Time Based Key-Value Store
Medium
Find Beautiful Indices in the Given Array I30 Days
Medium
Daily Temperatures
Medium
Count the Number of Good Subsequences
Medium
Check If It Is a Straight Line
Easy
Number of Divisible Triplet Sums
Medium
Contains Duplicate
Easy
Selling Pieces of Wood
Hard
Minimum Cost Path with Edge Reversals
Medium
Shortest Word Distance III
Medium
String Compression3 Months
Medium
LRU Cache
Medium
Merge k Sorted Lists
Hard
Shortest Word Distance II3 Months
Medium
Maximum Length of Repeated Subarray
Medium
Find Players With Zero or One Losses
Medium
Minimum Time Difference
Medium
Smallest String With Swaps6 Months
Medium
Contains Duplicate II
Easy
Integer to English Words
Hard
Maximum Size Subarray Sum Equals k
Medium
Single Number
Easy
Accounts Merge
Medium
Range Sum Query - Immutable
Easy
Contains Duplicate III
Hard