LeetCode 15. 3Sum
Description https://leetcode.com/problems/3sum/ Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j !=…
Tag: Facebook Interview Question
LeetCode 90. Subsets II
Description Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The…
LeetCode 69. Sqrt(x)
Description Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the…
LeetCode 20. Valid Parentheses
Description https://leetcode.com/problems/valid-parentheses/ Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid…
LeetCode 1. Two Sum
Description https://leetcode.com/problems/two-sum/ Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.…