| 1. |
Set Matrix Zeros |
 |
January 02 |
| 2. |
Unique Binary Search Trees |
|
January 03 |
| 3. |
Sort List |
 |
January 04 |
| 4. |
Merge Overlapping Intervals |
|
January 05 |
| 5. |
Longest Increasing Subsequence |
|
January 06 |
| 6. |
Max Product Subarray |
|
January 07 |
| 7. |
Stairs |
|
January 08 |
| 8. |
Climbing Stairs |
|
January 09 |
| 9. |
Max Distance |
|
January 10 |
| 10. |
Remove Nth Node from List End |
|
January 11 |
| 11. |
Distribute Candy |
|
January 12 |
| 12. |
Swap List Nodes in pairs |
|
January 13 |
| 13. |
Find Duplicate in Array |
|
January 14 |
| 14. |
Rotate Matrix |
|
January 15 |
| 15. |
Merge Intervals |
|
January 16 |
| 16. |
Repeat and Missing Number Array |
|
January 17 |
| 17. |
Largest Number |
|
January 18 |
| 18. |
First Missing Integer |
|
January 19 |
| 19. |
Pascal Triangle |
|
January 20 |
| 20. |
Next Permutation |
|
January 21 |
| 21. |
Wave Array |
|
January 22 |
| 22. |
Median of Array |
|
January 23 |
| 23. |
Roman To Integer |
|
January 24 |
| 24. |
Square Root of Integer |
|
January 25 |
| 25. |
Matrix Search |
|
January 26 |
| 26. |
Maximum Absolute Difference |
|
January 27 |
| 27. |
Rotated Sorted Array Search |
|
January 28 |
| 28. |
Maximum Unsorted Subarray |
|
January 29 |
| 29. |
Make equal elements Array |
|
January 30 |
| 30. |
Longest Palindromic Substring |
|
January 31 |
| 31. |
Implement StrStr |
|
February 01 |
| 32. |
Reverse Bits |
|
February 02 |
| 33. |
Divide Integers |
|
February 03 |
| 34. |
Matrix Median |
|
February 04 |
| 35. |
Remove Duplicates from Sorted Array |
|
February 05 |
| 36. |
Single Number |
|
February 06 |
| 37. |
Count Total Set Bits |
 |
February 07 |
| 38. |
Remove Element from Array |
|
February 08 |
| 39. |
Atoi |
|
February 09 |
| 40. |
Reverse the String |
|
February 10 |
| 41. |
Anagrams |
|
February 11 |
| 42. |
Merge Two Sorted Lists |
|
February 12 |
| 43. |
Find Permutation |
|
February 13 |
| 44. |
Add Two Numbers as Lists |
|
February 14 |
| 45. |
Integer To Roman |
|
February 15 |
| 46. |
Reorder List |
|
February 16 |
| 47. |
List Cycle |
|
February 17 |
| 48. |
Max Continuous Series of 1s |
|
February 18 |
| 49. |
Count And Say |
|
February 19 |
| 50. |
Minimum Characters required to make a String Palindromic |
|
February 20 |
| 51. |
Remove Duplicates from Sorted List |
|
February 21 |
| 52. |
Maximum Ones After Modification |
|
February 22 |
| 53. |
Palindrome List |
|
February 23 |
| 54. |
K reverse linked list |
|
February 24 |
| 55. |
Reverse Alternate K Nodes |
|
February 25 |
| 56. |
Kth Node From Middle |
|
February 26 |
| 57. |
Sort Binary Linked List |
|
February 27 |
| 58. |
Min Stack |
|
February 28 |
| 59. |
Reverse Link List II |
|
February 29 |
| 60. |
Sliding Window Maximum |
|
March 01 |
| 61. |
Redundant Braces |
|
March 02 |
| 62. |
Inorder Traversal |
|
March 03 |
| 63. |
Nearest Smaller Element |
|
March 04 |
| 64. |
Balanced Parantheses! |
|
March 05 |
| 65. |
First non-repeating character in a stream of characters |
|
March 06 |
| 66. |
Largest Rectangle in Histogram |
|
March 07 |
| 67. |
Rain Water Trapped |
|
March 08 |
| 68. |
Container With Most Water |
|
March 09 |
| 69. |
Combination Sum |
|
March 10 |
| 70. |
Palindrome Partitioning |
|
March 11 |
| 71. |
Subset |
|
March 12 |
| 72. |
Combinations |
|
March 13 |
| 73. |
NQueens |
|
March 14 |
| 74. |
Single Number II |
|
March 15 |
| 75. |
Subsets II |
|
March 16 |
| 76. |
Fraction |
|
March 17 |
| 77. |
Painter’s Partition Problem |
|
March 18 |
| 78. |
Merge Two Sorted Lists II |
|
March 19 |
| 79. |
2 Sum |
|
March 20 |
| 80. |
Points on the Straight Line |
|
March 21 |
| 81. |
Copy List |
|
March 22 |
| 82. |
Longest Substring Without Repeat |
|
March 23 |
| 83. |
Valid Sudoku |
|
March 24 |
| 84. |
LRU Cache |
|
March 25 |
| 85. |
Merge K Sorted Lists |
|
March 26 |
| 86. |
Balanced Binary Tree |
|
March 27 |
| 87. |
Distinct Numbers in Window |
|
March 28 |
| 88. |
Maximum Sum Combinations |
|
March 29 |
| 89. |
K Largest Elements |
|
March 30 |
| 90. |
Inorder Traversal of Cartesian Tree |
|
March 31 |
| 91. |
Least Common Ancestor |
|
April 01 |
| 92. |
Construct Binary Tree From Inorder And Preorder |
|
April 02 |
| 93. |
Flatten Binary Tree to Linked List |
|
April 03 |
| 94. |
Binary Tree From Inorder And Postorder |
|
April 04 |
| 95. |
Sorted Array To Balanced BST |
|
April 05 |
| 96. |
Symmetric Binary Tree |
|
April 06 |
| 97. |
Postorder Traversal |
|
April 07 |
| 98. |
Populate Next Right Pointers Tree |
|
April 08 |
| 99. |
Identical Binary Trees |
|
April 09 |
| 100. |
BST Iterator |
|
April 10 |
| 101. |
ZigZag Level Order Traversal BT |
|
April 11 |
| 102. |
Path Sum |
|
April 12 |
| 103. |
Min Depth of Binary Tree |
|
April 13 |
| 104. |
Root to Leaf Paths With Sum |
|
April 14 |
| 105. |
Kth Smallest Element In Tree |
|
April 15 |
| 106. |
Ways to Decode |
|
April 16 |
| 107. |
2-Sum Binary Tree |
|
April 17 |
