Palantir Coding Interview Questions: 19 Tagged Problems
19 coding problems tagged Palantir — 5 easy · 11 medium · 3 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 19
- By difficulty: 5 easy · 11 medium · 3 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
19 problems the CodeKairo catalogue tags as commonly asked in Palantir's coding rounds — 5 easy, 11 medium and 3 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (14), Strings (5) and Hash Table (5). Tagged for Palantir and no other company: Flood Fill. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Palantir, which CodeKairo is not affiliated with.
Palantir study plan by topic
All 19 problems tagged Palantir over 2 weeks, about 10 h 35 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Sliding Window and Prefix Sum and 12 more.
Week 1: Counting, Two Pointers, Sliding Window +7
12 problems on Counting, Two Pointers, Sliding Window, Prefix Sum, Sorting, Stack, Intervals, Recursion, Bit Manipulation and Breadth-First Search, easiest first within each topic.
- Find Players With Zero or One Losses Medium
- String Compression Medium
- Contains Duplicate II Easy
- Maximum Size Subarray Sum Equals k Medium
- Contains Duplicate Easy
- Minimum Time Difference Medium
- Trapping Rain Water Hard
- Merge Intervals Medium
- Integer to English Words Hard
- Single Number Easy
- UTF-8 Validation Medium
- Flood Fill Easy
Week 2: Topological Sort, Union Find, Dynamic Programming +3
7 problems on Topological Sort, Union Find, Dynamic Programming, Memoization, Geometry and Rolling Hash, easiest first within each topic.
- Course Schedule II Medium
- Number of Islands Medium
- Smallest String With Swaps Medium
- Longest Palindromic Substring Medium
- Selling Pieces of Wood Hard
- Check If It Is a Straight Line Easy
- Maximum Length of Repeated Subarray Medium
All problems tagged Palantir
Easy (5)
- Check If It Is a Straight Line Array, Math, Geometry
- Contains Duplicate II Array, Hash Table, Sliding Window
- Flood Fill Array, Matrix, Depth-First Search
- Single Number Array, Bit Manipulation
- Contains Duplicate Array, Hash Table, Sorting
Medium (11)
- Minimum Time Difference Array, Math, String
- UTF-8 Validation Bit Manipulation, Array
- Find Players With Zero or One Losses Hash Table, Array, Sorting
- Smallest String With Swaps Union Find, Hash Table, String
- Maximum Size Subarray Sum Equals k Array, Hash Table, Prefix Sum
- Maximum Length of Repeated Subarray Array, Binary Search, Dynamic Programming
- String Compression Two Pointers, String
- Course Schedule II Graph, Topological Sort, Heap
- Merge Intervals Array, Sorting, Intervals
- Number of Islands Array, Matrix, Depth-First Search
- Longest Palindromic Substring String, Dynamic Programming
Hard (3)
- Selling Pieces of Wood Array, Dynamic Programming, Memoization
- Integer to English Words String, Math, Recursion
- Trapping Rain Water Array, Two Pointers, Dynamic Programming
Topics Palantir asks most
- Arrays 14 problems
- Strings 5 problems
- Hash Table 5 problems
- Sorting 5 problems
- Dynamic Programming 4 problems
- Math 3 problems
- Two Pointers 2 problems
- Sliding Window 2 problems
- Matrix 2 problems
- Bit Manipulation 2 problems
- Breadth-First Search 2 problems
- Depth-First Search 2 problems