Skip to content

Commit 1eaf9d0

Browse files
godkingjaygodkingjay
committed
feat: add difficulty directory problem paths
1 parent 270df8c commit 1eaf9d0

File tree

3 files changed

+117
-43
lines changed

3 files changed

+117
-43
lines changed

‎Easy/README.md

+16-2
Original file line numberDiff line numberDiff line change
@@ -4,23 +4,34 @@
44
| :------: | :------------------------------------------------------------------------------------------------------------------------------ |
55
| **1** | [Two Sum](1.%20Two%20Sum/) |
66
| **9** | [Palindrome Number](9.%20Palindrome%20Number/) |
7+
| **13** | [Roman to Integer](13.%20Roman%20to%20Integer/) |
8+
| **14** | [Longest Common Prefix](14.%20Longest%20Common%20Prefix/) |
79
| **20** | [Valid Parentheses](20.%20Valid%20Parentheses/) |
810
| **26** | [Remove Duplicates from Sorted Array](26.%20Remove%20Duplicates%20from%20Sorted%20Array/) |
911
| **58** | [Length of Last Word](58.%20Length%20of%20Last%20Word/) |
12+
| **73** | [Set Matrix Zeroes](73.%20Set%20Matrix%20Zeroes/) |
13+
| **88** | [Merge Sorted Array](88.%20Merge%20Sorted%20Array/) |
1014
| **94** | [Binary Tree Inorder Traversal](94.%20Binary%20Tree%20Inorder%20Traversal/) |
1115
| **101** | [Symmetric Tree](101.%20Symmetric%20Tree/) |
1216
| **104** | [Maximum Depth of Binary Tree](104.%20Maximum%20Depth%20of%20Binary%20Tree/) |
1317
| **108** | [Convert Sorted Array to Binary Search Tree](108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/) |
14-
| **121** | [Best Time to Buy and Sell Stock](121.%20Best%20Time%20to%20buy%20and%20sell%20stock) |
18+
| **111** | [Minimum Depth of Binary Tree](111.%20Minimum%20Depth%20of%20Binary%20Tree/) |
19+
| **119** | [Pascal's Triangle II](119.%20Pascal's%20Triangle%20II/) |
20+
| **121** | [Best Time to buy and sell stock](121.%20Best%20Time%20to%20buy%20and%20sell%20stock/) |
21+
| **122** | [Best Time to Buy and Sell Stock II](122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/) |
1522
| **141** | [Linked List Cycle](141.%20Linked%20List%20Cycle/) |
1623
| **141** | [Linked List Cycle](141.Linked%20List%20Cycle/) |
1724
| **144** | [Binary Tree Preorder Traversal](144.%20Binary%20Tree%20Preorder%20Traversal/) |
1825
| **145** | [Binary Tree Postorder Traversal](145.%20Binary%20Tree%20Postorder%20Traversal/) |
26+
| **169** | [Majority Element](169.%20Majority%20Element/) |
1927
| **206** | [Reverse Linked List](206.%20Reverse%20Linked%20List/) |
2028
| **217** | [Contains Duplicate](217.%20Contains%20Duplicate/) |
29+
| **222** | [Count complete Tree Node](222.%20Count%20complete%20Tree%20Node/) |
2130
| **226** | [Invert Binary Tree](226.%20Invert%20Binary%20Tree/) |
2231
| **232** | [Implement Queue using Stacks](232.%20Implement%20Queue%20using%20Stacks/) |
2332
| **235** | [Lowest Common Ancestor of a Binary Search Tree](235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/) |
33+
| **242** | [Valid Anagram](242.%20Valid%20Anagram/) |
34+
| **326** | [Power of Three](326.%20Power%20of%20Three/) |
2435
| **342** | [Power of Four](342.%20Power%20of%20Four/) |
2536
| **344** | [Reverse String](344.%20Reverse%20String/) |
2637
| **389** | [Find the Difference](389.%20Find%20the%20Difference/) |
@@ -30,11 +41,14 @@
3041
| **637** | [Average of Levels in Binary Tree](637.%20Average%20of%20Levels%20in%20Binary%20Tree/) |
3142
| **653** | [Two Sum IV - Input is a BST](653.%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST/) |
3243
| **700** | [Search in a Binary Search Tree](700.%20Search%20in%20a%20Binary%20Search%20Tree/) |
44+
| **706** | [Design HashMap](706.%20Design%20HashMap/) |
45+
| **746** | [Min Cost Climbing Stairs](746.Min%20Cost%20Climbing%20Stairs/) |
3346
| **844** | [Backspace String Compare](844.%20Backspace%20String%20Compare/) |
3447
| **896** | [Monotonic Array](896.%20Monotonic%20Array/) |
3548
| **905** | [Sort Array by Parity](905.%20Sort%20Array%20by%20Parity/) |
3649
| **1337** | [K Weakest Rows in a Matrix](1337.%20K%20Weakest%20Rows%20in%20a%20Matrix/) |
3750
| **1342** | [Number of Steps to Reduce a Number to Zero](1342.%20Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/) |
51+
| **1356** | [Sort Integers by The Number of 1 Bits](1356.%20Sort%20Integers%20by%20The%20Number%20of%201%20Bits/) |
3852
| **1470** | [Shuffle the Array](1470.%20Shuffle%20the%20Array/) |
3953
| **1480** | [Running Sum of 1d Array](1480.%20Running%20Sum%20of%201d%20Array/) |
4054
| **1486** | [XOR Operation in an Array](1486.%20XOR%20Operation%20in%20an%20Array/) |
@@ -48,4 +62,4 @@
4862
| **2373** | [Largest Local Values in a Matrix](2373.%20Largest%20Local%20Values%20in%20a%20Matrix/) |
4963
| **2423** | [Remove Letter To Equalize Frequency](2423.%20Remove%20Letter%20To%20Equalize%20Frequency/) |
5064
| **2591** | [Distribute Money to Maximum Children](2591.%20Distribute%20Money%20to%20Maximum%20Children/) |
51-
| **242** | [Valid Anagram](242.%20Valid%20Anagram/) |
65+
| **2703** | [Return Length of Arguments Passed](2703.%20Return%20Length%20of%20Arguments%20Passed/) |

‎Hard/README.md

+22-1
Original file line numberDiff line numberDiff line change
@@ -3,19 +3,40 @@
33
| **No.** | **Problem** |
44
| :------: | :---------------------------------------------------------------------------------------------------------------------------------------------------- |
55
| **4** | [Median of Two Sorted Arrays](4.%20Median%20of%20Two%20Sorted%20Arrays/) |
6+
| **10** | [Regular Expression Matching](10.%20Regular%20Expression%20Matching/) |
7+
| **25** | [Reverse Nodes in k-Group](25.%20Reverse%20Nodes%20in%20k-Group/) |
8+
| **34** | [Find First and Last Position of Element in Sorted Array](34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/) |
9+
| **37** | [Sudoku Solver](37.Sudoku%20Solver/) |
610
| **41** | [First Missing Positive](41.%20First%20Missing%20Positive/) |
11+
| **42** | [Trapping Rain Water](42.%20Trapping%20Rain%20Water/) |
712
| **68** | [Test Justification](68.%20Test%20Justification/) |
813
| **72** | [Edit Distance](72.%20Edit%20Distance/) |
9-
| **115** | [Distinct Subsequences](115.%20Distinct%20Subsequences/) |
14+
| **76** | [Minimum Window Substring](76.%20Minimum%20Window%20Substring/) |
15+
| **115** | [Distinct Subsequences](115.%20Distinct%20Subsequences/) |
16+
| **127** | [Word Ladder](127.%20Word%20Ladder/) |
1017
| **135** | [Candy](135.%20Candy/) |
18+
| **233** | [Number of Digit One](233.%20Number%20of%20Digit%20One/) |
1119
| **239** | [Sliding Window Max](239.%20Sliding%20Window%20Max/) |
20+
| **273** | [Integer to English Words](273.%20Integer%20to%20English%20Words/) |
1221
| **332** | [Reconstruct Itinerary](332.%20Reconstruct%20Itinerary/) |
1322
| **664** | [Strange Printer](664.%20Strange%20Printer/) |
1423
| **847** | [Shortest Path Visiting all Nodes](847.%20Shortest%20Path%20Visiting%20all%20Nodes/) |
1524
| **920** | [Number of Music Playlists](920.%20Number%20of%20Music%20Playlists/) |
25+
| **1095** | [Find in Mountain Array](1095.%20Find%20in%20Mountain%20Array/) |
1626
| **1203** | [Sort Items by Groups Respecting Dependencies](1203.%20Sort%20Items%20by%20Groups%20Respecting%20Dependencies/) |
27+
| **1220** | [Count Vowels Permutation](1220.%20Count%20Vowels%20Permutation/) |
28+
| **1269** | [Number of Ways to Stay in the Same Place After Some Steps](1269.%20Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/) |
1729
| **1326** | [Min no of Taps to Open to Water a Garden](1326.%20Min%20no%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/) |
1830
| **1359** | [Count All Valid Pickup and Delivery Options](1359.%20Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/) |
31+
| **1420** | [build array where you can find maximum exactly k comparison](1420.%20build%20array%20where%20you%20can%20find%20maximum%20exactly%20k%20comparison/) |
32+
| **1425** | [Constrained Subsequence Sum](1425.%20Constrained%20Subsequence%20Sum/) |
33+
| **1458** | [Max Dot Product of Two Subsequences](1458.%20Max%20Dot%20Product%20of%20Two%20Subsequences/) |
1934
| **1489** | [Find Critical and Pseudo-Critical Edges in Min Spanning Tree](1489.%20Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Min%20Spanning%20Tree/) |
35+
| **1793** | [Maximum Score of a Good Subarray](1793.%20Maximum%20Score%20of%20a%20Good%20Subarray/) |
36+
| **2009** | [Minimum Number of Operations to Make Array Continuous](2009.%20Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/) |
37+
| **2050** | [Parallel Courses III](2050.%20Parallel%20Courses%20III/) |
2038
| **2141** | [Maximum Running Time](2141.%20Maximum%20Running%20Time/) |
39+
| **2227** | [Encrypt and Decrypt String](2227.%20Encrypt%20and%20Decrypt%20String/) |
40+
| **2251** | [Number Of Flowers In Full Bloom](2251.%20Number%20Of%20Flowers%20In%20Full%20Bloom/) |
2141
| **2366** | [Min Replacements to Sort an Array](2366.%20Min%20Replacements%20to%20Sort%20an%20Array/) |
42+
| **2742** | [Painting the Walls](2742.%20Painting%20the%20Walls/) |

0 commit comments

Comments
 (0)