LeetCode 111. Minimum Depth of Binary Tree
Description https://leetcode.com/problems/minimum-depth-of-binary-tree/ Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the…
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…
LeetCode 104. Maximum Depth of Binary Tree
Description Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest…
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 14. Longest Common Prefix
Description https://leetcode.com/problems/longest-common-prefix/description/ Write a function to find the longest common prefix string amongst an array of strings. If there is…
LeetCode 13. Roman to Integer
Description Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C…
LeetCode 19. Remove Nth Node From End of List
Description Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked…