LeetCode: 179 Largest Number
0179 Largest NumberProblem DescriptionGiven a list of non-negative integers nums, arrange them such that they form the largest number.Note: The result may be very large, so you need to return a string
LeetCode: 153 & 154 Find Minimum in Rotated Sorted Array
0153 & 0154 Find Minimum in Rotated Sorted ArrayProblem DescriptionSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7
LeetCode: 145 Binary Tree Postorder Traversal
0145 Binary Tree Postorder TraversalProblem DescriptionGiven the root of a binary tree, return the postorder traversal of its nodes' values.ExampleInput: root = [1,null,2,3] Output: [3,2,1]SolutionPle
LeetCode: 144 Binary Tree Preorder Traversal
0144 Binary Tree Preorder TraversalProblem DescriptionGiven the root of a binary tree, return the preorder traversal of its nodes' values.ExampleInput: root = [1,null,2,3] Output: [1,2,3]SolutionPleas
LeetCode: 132 Palindrome Partitioning II
Problem DescriptionGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.Example 1Input: s = "aab"O
LeetCode: 105 Construct Binary Tree from Preorder and Inorder Traversal
Problem DescriptionGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, givenpreorder = [3,9,20,15,7] ino
LeetCode: 99 Recover Binary Search Tree
Problem DescriptionTwo elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example 1Input: [1,3,null,null,2] 1 / 3 \ 2 Output: [3,1,null
LeetCode: 100 Same Tree
Problem DescriptionGiven two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same
LeetCode: 96 Unique Binary Search Trees
Problem DescriptionGiven n, how many structurally unique BST's (binary search trees) that store values 1 ... n?ExampleInput: 3 Output: 5 Explanation: Given n = 3, there are a total of 5 unique BST's:
LeetCode: 94 Binary Tree Inorder Traversal
0094 Binary Tree Inorder TraversalProblem DescriptionGiven a binary tree, return the inorder traversal of its nodes' values.ExampleInput: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2]SolutionPlease refer th