Palantir Interview Questions

Given a string and two substrings, find the indices where the first substring occurs. Then, find the indices where the second substring occurs. Return the indices of the first substring that are close to any index of the second substring, within a specified range.

You're given a string and a list of index pairs. You can swap characters at these indices any number of times. Find the lexicographically smallest string you can obtain after performing these swaps.

You're given a string and two patterns. Find all 'beautiful' indices where an occurrence of the first pattern is within 'k' distance of an occurrence of the second pattern.

You are given a list of 24-hour clock times. Find the smallest difference in minutes between any two times in the list.

Determine if there are any duplicate numbers in an array where the indices of these duplicates are within a certain distance of each other. Specifically, check if any two equal numbers exist in the array, where their indices differ by at most k.

You're given an array of numbers and need to efficiently calculate the sum of values within specified ranges of indices in the array. The array itself will not change.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Convert a non-negative integer into its English word representation. For example, 12345 should be converted to 'Twelve Thousand Three Hundred Forty Five'.

Find the unique number in an array where every other number appears exactly twice. Your task is to efficiently identify this single, non-repeating element.

Determine if a set of points forms a perfect straight line. You're given the coordinates of several points; check if they all lie on the same line.

You're given a rectangular piece of wood and prices for different sized pieces you can sell. Determine the maximum profit you can make by cutting the wood into smaller pieces and selling them.

Find the maximum length of a contiguous subarray that sums to a given target value k. You need to return the length of the longest such subarray.

Given an array, determine if there are any two distinct elements within a certain distance of each other that have an absolute difference less than or equal to a given threshold. Consider both index and value differences.

Determine if any value appears at least twice in an array of numbers. Return true if duplicates exist; otherwise, return false.

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

Find the shortest distance between two occurrences of a word within a list of words. The two words can be the same.

You're given a square grid of values. Build a quadtree to represent this grid, recursively dividing into quadrants based on whether the values within each quadrant are all the same.

You are given a list of accounts where each account has a name and a list of email addresses. Your task is to merge accounts belonging to the same person based on shared email addresses.

Determine how many subsequences of a given binary string satisfy a specific condition based on the number of set bits. You need to count only the subsequences whose decimal value equals a power of 2.