Palantir Technologies Interview Questions — 29 DSA Problems

25 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Palantir Technologies LeetCode questions for software engineering interviews.

• Find Beautiful Indices in the Given Array I (MEDIUM) — Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function
• Find Beautiful Indices in the Given Array II (HARD) — Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function
• Minimum Time Difference (MEDIUM) — Array, Math, String, Sorting
• Integer to English Words (HARD) — Math, String, Recursion
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Range Sum Query - Immutable (EASY) — Array, Design, Prefix Sum
• Contains Duplicate II (EASY) — Array, Hash Table, Sliding Window
• Selling Pieces of Wood (HARD) — Array, Dynamic Programming, Memoization
• Maximum Size Subarray Sum Equals k (MEDIUM) — Array, Hash Table, Prefix Sum
• Single Number (EASY) — Array, Bit Manipulation
• Check If It Is a Straight Line (EASY) — Array, Math, Geometry
• Contains Duplicate (EASY) — Array, Hash Table, Sorting
• Contains Duplicate III (HARD) — Array, Sliding Window, Sorting, Bucket Sort, Ordered Set
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Shortest Word Distance III (MEDIUM) — Array, String
• Merge Intervals (MEDIUM) — Array, Sorting
• Construct Quad Tree (MEDIUM) — Array, Divide and Conquer, Tree, Matrix
• Minimum Equal Sum of Two Arrays After Replacing Zeros (MEDIUM) — Array, Greedy
• Find Players With Zero or One Losses (MEDIUM) — Array, Hash Table, Sorting, Counting
• Count the Number of Good Subsequences (MEDIUM) — Hash Table, Math, String, Combinatorics, Counting
• Flood Fill (EASY) — Array, Depth-First Search, Breadth-First Search, Matrix
• Accounts Merge (MEDIUM) — Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• All Ancestors of a Node in a Directed Acyclic Graph (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Number of Divisible Triplet Sums (MEDIUM) — Array, Hash Table
• Trapping Rain Water II (HARD) — Array, Breadth-First Search, Heap (Priority Queue), Matrix
• Sort List (MEDIUM) — Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming