Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. Palantir

Palantir LeetCode Interview Questions

Practice 48 real coding problems frequently asked in Palantir technical interviews. Master these questions to ace your next Palantir software engineering interview.

15 Easy
29 Medium
4 Hard

Top Topics at Palantir

ArrayStringHash TableTwo PointersDepth-First Search

Ace your Palantir interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Palantir Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Random Pick Index
100%
MediumM
100%
Hash TableMath+2
Solve→
Maximum Number of Occurrences of a Substring
96%
MediumM
96%
Hash TableString+1
Solve→
Length of Last Word
90%
EasyE
90%
String
Solve→
N-Queens
87%
HardH
87%
ArrayBacktracking
Solve→
Remove Duplicates from Sorted Array
84%
EasyE
84%
ArrayTwo Pointers
Solve→
Coin Change II
83%
MediumM
83%
ArrayDynamic Programming
Solve→
Ways to Make a Fair Array
82%
MediumM
82%
ArrayPrefix Sum
Solve→
Expression Add Operators
80%
HardH
80%
MathString+1
Solve→
Remove Letter To Equalize Frequency
79%
EasyE
79%
Hash TableString+1
Solve→
Sqrt(x)
78%
EasyE
78%
MathBinary Search
Solve→
Lowest Common Ancestor of a Binary Search Tree
78%
MediumM
78%
TreeDepth-First Search+2
Solve→
Convert Binary Search Tree to Sorted Doubly Linked List
77%
MediumM
77%
Linked ListStack+5
Solve→
Meeting Rooms II
76%
MediumM
76%
ArrayTwo Pointers+4
Solve→
Continuous Subarrays
74%
MediumM
74%
ArrayQueue+4
Solve→
Find Score of an Array After Marking All Elements
74%
MediumM
74%
ArrayHash Table+3
Solve→
Remove All Adjacent Duplicates in String II
73%
MediumM
73%
StringStack
Solve→
Kth Largest Element in an Array
72%
MediumM
72%
ArrayDivide and Conquer+3
Solve→
String Compression
72%
MediumM
72%
Two PointersString
Solve→
Design an Array Statistics Tracker
71%
HardH
71%
Hash TableBinary Search+5
Solve→
Find Leaves of Binary Tree
70%
MediumM
70%
TreeDepth-First Search+1
Solve→
Same Tree
70%
EasyE
70%
TreeDepth-First Search+2
Solve→
Find the Celebrity
68%
MediumM
68%
Two PointersGraph+1
Solve→
Capacity To Ship Packages Within D Days
68%
MediumM
68%
ArrayBinary Search
Solve→
Number of Islands
67%
MediumM
67%
ArrayDepth-First Search+3
Solve→
Container With Most Water
65%
MediumM
65%
ArrayTwo Pointers+1
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
The kth Factor of n
64%
MediumM
64%
MathNumber Theory
Solve→
Missing Number
63%
EasyE
63%
ArrayHash Table+4
Solve→
K Closest Points to Origin
61%
MediumM
61%
ArrayMath+5
Solve→
House Robber II
58%
MediumM
58%
ArrayDynamic Programming
Solve→
Gas Station
57%
MediumM
57%
ArrayGreedy
Solve→
Permutation in String
57%
MediumM
57%
Hash TableTwo Pointers+2
Solve→
Maximum Nesting Depth of the Parentheses
55%
EasyE
55%
StringStack
Solve→
Convert Sorted List to Binary Search Tree
51%
MediumM
51%
Linked ListDivide and Conquer+3
Solve→
Letter Combinations of a Phone Number
47%
MediumM
47%
Hash TableString+1
Solve→
Koko Eating Bananas
45%
MediumM
45%
ArrayBinary Search
Solve→
Ransom Note
37%
EasyE
37%
Hash TableString+1
Solve→
Minimum Absolute Difference
35%
EasyE
35%
ArraySorting
Solve→
Toeplitz Matrix
35%
EasyE
35%
ArrayMatrix
Solve→
Group Shifted Strings
34%
MediumM
34%
ArrayHash Table+1
Solve→
Moving Average from Data Stream
32%
EasyE
32%
ArrayDesign+2
Solve→
Design an Ordered Stream
32%
EasyE
32%
ArrayHash Table+2
Solve→
All Nodes Distance K in Binary Tree
26%
MediumM
26%
Hash TableTree+3
Solve→
Maximize Amount After Two Days of Conversions
25%
MediumM
25%
ArrayString+3
Solve→
Missing Ranges
24%
EasyE
24%
Array
Solve→
Implement Queue using Stacks
20%
EasyE
20%
StackDesign+1
Solve→
House Robber
20%
MediumM
20%
ArrayDynamic Programming
Solve→
Find the Index of the First Occurrence in a String
20%
EasyE
20%
Two PointersString+1
Solve→
Split Array Largest Sum
20%
HardH
20%
ArrayBinary Search+3
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Alcon
48 problems
Anaplan
48 problems
Ansys
48 problems
Axon
48 problems
Cadence Design Systems
48 problems
Chamberlain Group
48 problems

Frequently Asked Questions

What LeetCode problems does Palantir ask in interviews?

Palantir commonly asks 48 coding problems in technical interviews, including Random Pick Index, Maximum Number of Occurrences of a Substring, Length of Last Word. The difficulty breakdown is 15 Easy, 29 Medium, and 4 Hard problems.

How should I prepare for a Palantir coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Palantir interviews typically emphasize Array and String. Practice explaining your thought process while coding.

What is the difficulty level of Palantir coding interviews?

Based on our data, Palantir interviews include 15 Easy (31%), 29 Medium (60%), and 4 Hard (8%) problems.

Ready to ace your Palantir interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.