Palantir Archives - TO THE INNOVATION

Single Number LeetCode Solution

Leetcode Solution / Airbnb, Bit-Manipulation, C++ Solution, Easy, Hash Table, Java Solution, JavaScript Solution, LeetCode Solution, Palantir, Python Solution

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Contains Duplicate II LeetCode Solution

Leetcode Solution / Airbnb, Array, C++ Solution, Easy, Hash Table, Java Solution, JavaScript Solution, LeetCode Solution, Palantir, Python Solution

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i – j) <= k.

Contains Duplicate LeetCode Solution

Leetcode Solution / Airbnb, Array, C++ Solution, Easy, Hash Table, Java Solution, JavaScript Solution, LeetCode Solution, Palantir, Python Solution, Yahoo

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Contains Duplicate III LeetCode Solution

Leetcode Solution / Airbnb, C++ Solution, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Ordered-Map, Palantir, Python Solution, Sort

You are given an integer array nums and two integers indexDiff and valueDiff. Find a pair of indices (i, j) such that: i != j, abs(i – j) <= indexDiff. abs(nums[i] - nums[j]) <= valueDiff, and Return true if such pair exists or false otherwise.