Skip to the content.

Problems EASY

No. Problem
1 Two Sum
9 Palindrome Number
13 Roman to Integer
14 Longest Common Prefix
20 Valid Parentheses
26 Remove Duplicates from Sorted Array
58 Length of Last Word
73 Set Matrix Zeroes
88 Merge Sorted Array
94 Binary Tree Inorder Traversal
101 Symmetric Tree
104 Maximum Depth of Binary Tree
108 Convert Sorted Array to Binary Search Tree
111 Minimum Depth of Binary Tree
119 Pascal’s Triangle II
121 Best Time to buy and sell stock
122 Best Time to Buy and Sell Stock II
141 Linked List Cycle
141 Linked List Cycle
144 Binary Tree Preorder Traversal
145 Binary Tree Postorder Traversal
169 Majority Element
206 Reverse Linked List
217 Contains Duplicate
222 Count complete Tree Node
226 Invert Binary Tree
232 Implement Queue using Stacks
235 Lowest Common Ancestor of a Binary Search Tree
242 Valid Anagram
326 Power of Three
342 Power of Four
344 Reverse String
389 Find the Difference
392 Is Subsequence
557 Reverse Words in a String III
606 Construct String from Binary Tree
637 Average of Levels in Binary Tree
653 Two Sum IV - Input is a BST
700 Search in a Binary Search Tree
706 Design HashMap
746 Min Cost Climbing Stairs
844 Backspace String Compare
896 Monotonic Array
905 Sort Array by Parity
1337 K Weakest Rows in a Matrix
1342 Number of Steps to Reduce a Number to Zero
1356 Sort Integers by The Number of 1 Bits
1470 Shuffle the Array
1480 Running Sum of 1d Array
1486 XOR Operation in an Array
1512 Number of Good Pairs
1523 Count Odd Numbers in an Interval Range
1672 Richest Customer Wealth
1720 Decode XORed Array
1920 Build Array from Permutation
1929 Concatenation of Array
2011 Final Value of Variable After Performing Operations
2373 Largest Local Values in a Matrix
2423 Remove Letter To Equalize Frequency
2591 Distribute Money to Maximum Children
2703 Return Length of Arguments Passed