Question 1

Find Beautiful Indices in the Given Array I — Palantir Technologies Interview Question

Accepted Answer

"Find Beautiful Indices in the Given Array I" is a medium difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i

Question 2

Find Beautiful Indices in the Given Array II — Palantir Technologies Interview Question

Accepted Answer

"Find Beautiful Indices in the Given Array II" is a hard difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function. You can practice it on LeetCode: https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii

Question 3

Minimum Time Difference — Palantir Technologies Interview Question

Accepted Answer

"Minimum Time Difference" is a medium difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Array, Math, String, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/minimum-time-difference

Question 4

Integer to English Words — Palantir Technologies Interview Question

Accepted Answer

"Integer to English Words" is a hard difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Math, String, Recursion. You can practice it on LeetCode: https://leetcode.com/problems/integer-to-english-words

Question 5

LRU Cache — Palantir Technologies Interview Question

Accepted Answer

"LRU Cache" is a medium difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/lru-cache

Question 6

Range Sum Query - Immutable — Palantir Technologies Interview Question

Accepted Answer

"Range Sum Query - Immutable" is a easy difficulty problem asked at Palantir Technologies interviews. It covers the following topics: Array, Design, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/range-sum-query-immutable

#	Question Title	Difficulty	Frequency	Topics
1	Find Beautiful Indices in the Given Array I	MEDIUM	100.0	Two PointersStringBinary Search+3
2	Find Beautiful Indices in the Given Array II	HARD	92.0	Two PointersStringBinary Search+3
3	Minimum Time Difference	MEDIUM	82.4	ArrayMathString+1
4	Integer to English Words	HARD	82.4	MathStringRecursion
5	LRU Cache	MEDIUM	80.6	Hash TableLinked ListDesign+1
6	Range Sum Query - Immutable	EASY	80.6	ArrayDesignPrefix Sum
7	Contains Duplicate II	EASY	80.6	ArrayHash TableSliding Window
8	Selling Pieces of Wood	HARD	78.7	ArrayDynamic ProgrammingMemoization
9	Maximum Size Subarray Sum Equals k	MEDIUM	78.7	ArrayHash TablePrefix Sum
10	Single Number	EASY	78.7	ArrayBit Manipulation

Explore 450+ Companies

Companies

Palantir Technologies

Want to see more?

Palantir Technologies Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Palantir Technologies

Want to see more?

Palantir Technologies Interview Questions

Ai Assistant Kas