LeetCode 110. Balanced Binary Tree
Description https://leetcode.com/problems/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined…
Tag: Bloomberg Interview Question
LeetCode 101. Symmetric Tree
Description https://leetcode.com/problems/symmetric-tree/description/ Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For…
LeetCode 100. Same Tree
Description https://leetcode.com/problems/same-tree/ Given the roots of two binary trees p and q, write a function to check if they are the same or…
LeetCode 16. 3Sum Closest
Description https://leetcode.com/problems/3sum-closest/ Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the…
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 !=…
LeetCode 63. Unique Paths II
Description https://leetcode.com/problems/unique-paths-ii/ A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).…
LeetCode 62. Unique Paths
Description A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can…
LeetCode 5. Longest Palindromic Substring
Description https://leetcode.com/problems/longest-palindromic-substring/description/ Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.…
LeetCode 11. Container With Most Water
Description https://leetcode.com/problems/container-with-most-water/ Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two…
LeetCode 42. Trapping Rain Water
Description https://leetcode.com/problems/trapping-rain-water/description/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water…