Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 00dbda6

Browse files
authored
Merge pull request #11 from dipjul/dipjul-patch-2
Added links to few questions
2 parents 27101ee + 112b3d7 commit 00dbda6

File tree

1 file changed

+47
-47
lines changed

1 file changed

+47
-47
lines changed

‎README.md

Lines changed: 47 additions & 47 deletions
Original file line numberDiff line numberDiff line change
@@ -81,28 +81,28 @@
8181
2. Balanced Parentheses
8282
3. Reverse a String
8383
4. Decimal to Binary Conversion
84-
5. Next Greater Element
85-
6. Sorting a Stack
86-
7. Simplify Path
84+
5. Next Greater Element[Leetcode - I](https://leetcode.com/problems/next-greater-element-i/)[Leetcode -II](https://leetcode.com/problems/next-greater-element-ii/)[Leetcode - III (Hard)](https://leetcode.com/problems/next-greater-element-iv/)
85+
6. Sorting a Stack
86+
7. Simplify Path[Leetcode](https://leetcode.com/problems/simplify-path/)
8787

8888
### 8. Pattern: Monotonic Stack
8989

9090
1. Introduction to Monotonic Stack
91-
2. Next Greater Element (easy)
92-
3. Daily Temperatures (easy)
93-
4. Remove Nodes From Linked List (easy)
94-
5. Remove All Adjacent Duplicates In String (easy)
95-
6. Remove All Adjacent Duplicates in String II (medium)
96-
7. Remove K Digits (hard)
91+
2. Next Greater Element (easy)[Leetcode - I](https://leetcode.com/problems/next-greater-element-i/)[Leetcode -II](https://leetcode.com/problems/next-greater-element-ii/)[Leetcode - III (Hard)](https://leetcode.com/problems/next-greater-element-iv/)
92+
3. Daily Temperatures (easy)[Leetcode](https://leetcode.com/problems/daily-temperatures/)
93+
4. Remove Nodes From Linked List (easy)[Leetcode](https://leetcode.com/problems/remove-nodes-from-linked-list/)
94+
5. Remove All Adjacent Duplicates In String (easy)[Leetcode](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)
95+
6. Remove All Adjacent Duplicates in String II (medium)[Leetcode](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)
96+
7. Remove K Digits (hard)[Leetcode](https://leetcode.com/problems/remove-k-digits/)
9797

9898
### 9. Pattern: Hash Maps
9999

100100
1. Introduction (Hashing, Hash Tables, Issues)
101-
2. First Non-repeating Character (easy)
102-
3. Largest Unique Number (easy)
103-
4. Maximum Number of Balloons (easy)
104-
5. Longest Palindrome(easy)
105-
6. Ransom Note (easy)
101+
2. First Non-repeating Character (easy)[Leetcode](https://leetcode.com/problems/first-unique-character-in-a-string/)
102+
3. Largest Unique Number (easy)[Leetcode+](https://leetcode.com/problems/largest-unique-number/)
103+
4. Maximum Number of Balloons (easy)[Leetcode](https://leetcode.com/problems/maximum-number-of-balloons/)
104+
5. Longest Palindrome(easy)[Leetcode](https://leetcode.com/problems/longest-palindrome/)
105+
6. Ransom Note (easy)[Leetcode](https://leetcode.com/problems/ransom-note/)
106106

107107
### 10. Pattern: Tree Breadth First Search
108108

@@ -136,18 +136,18 @@
136136
1. Introduction to Graph (Representations, Abstract Data Type (ADT))
137137
2. Graph Traversal: Depth First Search(DFS)
138138
3. Graph Traversal: Breadth First Search (BFS)
139-
4. Find if Path Exists in Graph(easy
140-
5. Number of Provinces (medium)
141-
6. Minimum Number of Vertices to Reach All Nodes(medium)
139+
4. Find if Path Exists in Graph(easy) [Leetcode](https://leetcode.com/problems/find-if-path-exists-in-graph/)
140+
5. Number of Provinces (medium)[Leetcode](https://leetcode.com/problems/number-of-provinces/)
141+
6. Minimum Number of Vertices to Reach All Nodes(medium)[Leetcode](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)
142142

143143

144144
### 13. Pattern: Island (Matrix traversal)
145145

146146
1. Introduction to Island Pattern
147-
2. Number of Islands (easy)
147+
2. Number of Islands (easy)[Leetcode](https://leetcode.com/problems/number-of-islands/)
148148
3. Biggest Island (easy)
149-
4. Flood Fill (easy)
150-
5. Number of Closed Islands (easy)
149+
4. Flood Fill (easy)[Leetcode](https://leetcode.com/problems/flood-fill/)
150+
5. Number of Closed Islands (easy)[Leetcode](https://leetcode.com/problems/number-of-closed-islands/)
151151
6. Problem Challenge 1 (easy)
152152
7. Problem Challenge 2 (medium)
153153
8. Problem Challenge 3 (medium)
@@ -171,7 +171,7 @@
171171
4. Permutations (medium) [Educative.io](https://www.educative.io/courses/grokking-the-coding-interview/B8R83jyN3KY)
172172
5. String Permutations by changing case (medium)
173173
6. Balanced Parentheses (hard)
174-
7. Unique Generalized Abbreviations (hard)
174+
7. Unique Generalized Abbreviations (hard)[Leetcode](https://leetcode.com/problems/generalized-abbreviation/)
175175

176176

177177
### [16. Pattern: Modified Binary Search](binary-search/BinarySearch.md)
@@ -227,22 +227,22 @@
227227
### 19. Pattern: K-way merge
228228

229229
1. Introduction
230-
2. Merge K Sorted Lists (medium)
231-
3. Kth Smallest Number in M Sorted Lists (Medium)
230+
2. Merge K Sorted Lists (medium)[Leetcode](https://leetcode.com/problems/merge-k-sorted-lists/)
231+
3. Kth Smallest Number in M Sorted Lists (Medium)[Geeksforgeeks](https://www.geeksforgeeks.org/find-m-th-smallest-value-in-k-sorted-arrays/)
232232
4. Kth Smallest Number in a Sorted Matrix (Hard) [Educative.io](https://www.educative.io/courses/grokking-the-coding-interview/x1NJVYKNvqz)
233-
5. Smallest Number Range (Hard)
233+
5. Smallest Number Range (Hard)[Leetcode](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/)
234234
6. Problem Challenge 1: K Pairs with Largest Sums (hard)
235235

236236

237237
### 20. Pattern: Greedy Algorithms
238238

239239
1. Introduction to Greedy Algorithm
240-
2. Valid Palindrome II (easy)
241-
3. Maximum Length of Pair Chain (medium)
242-
4. Minimum Add to Make Parentheses Valid (medium)
243-
5. Remove Duplicate Letters (medium)
244-
6. Largest Palindromic Number (Medium)
245-
7. Removing Minimum and Maximum From Array (medium)
240+
2. Valid Palindrome II (easy)[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/)
241+
3. Maximum Length of Pair Chain (medium)[Leetcode](https://leetcode.com/problems/maximum-length-of-pair-chain/)
242+
4. Minimum Add to Make Parentheses Valid (medium)[Leetcode](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)
243+
5. Remove Duplicate Letters (medium)[Leetcode](https://leetcode.com/problems/remove-duplicate-letters/)
244+
6. Largest Palindromic Number (Medium)[Leetcode](https://leetcode.com/problems/largest-palindromic-number/)
245+
7. Removing Minimum and Maximum From Array (medium)[Leetcode](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)
246246

247247

248248
### 21. Pattern : 0/1 Knapsack (Dynamic Programming)
@@ -259,21 +259,21 @@
259259
### 22. Pattern: Backtracking
260260

261261
1. Introduction to Backtracking Pattern
262-
2. Combination Sum (medium)
263-
3. Word Search (medium)
264-
4. Sudoku Solver (hard)
265-
5. Factor Combinations (medium)
266-
6. Split a String Into the Max Number of Unique Substrings (medium)
262+
2. Combination Sum (medium)[Leetcode - I](https://leetcode.com/problems/combination-sum/)[Leetcode - II](https://leetcode.com/problems/combination-sum-ii/)[Leetcode - III](https://leetcode.com/problems/combination-sum-iii/)[Leetcode - IV](https://leetcode.com/problems/combination-sum-iv/)
263+
3. Word Search (medium)[Leetcode - I](https://leetcode.com/problems/word-search/)[Leetcode - II (Hard)](https://leetcode.com/problems/word-search-ii/)
264+
4. Sudoku Solver (hard)[Leetcode](https://leetcode.com/problems/sudoku-solver/)
265+
5. Factor Combinations (medium)[Leetcode+](https://leetcode.com/problems/factor-combinations/)
266+
6. Split a String Into the Max Number of Unique Substrings (medium)[Leetcode](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/)
267267

268268

269269
### 23. Pattern: Trie
270270

271271
1. Introduction to Trie
272-
2. Implement Trie (Prefix Tree) (medium)
273-
3. Index Pairs of a String (easy)
274-
4. Design Add and Search Words Data Structure (medium)
275-
5. Extra Characters in a String (medium)
276-
6. Search Suggestions System (medium)
272+
2. Implement Trie (Prefix Tree) (medium)[Leetcode](https://leetcode.com/problems/implement-trie-prefix-tree/)
273+
3. Index Pairs of a String (easy)[Leetcode+](https://leetcode.com/problems/index-pairs-of-a-string/)
274+
4. Design Add and Search Words Data Structure (medium)[Leetcode](https://leetcode.com/problems/design-add-and-search-words-data-structure/)
275+
5. Extra Characters in a String (medium)[Leetcode](https://leetcode.com/problems/extra-characters-in-a-string/)
276+
6. Search Suggestions System (medium)[Leetcode](https://leetcode.com/problems/search-suggestions-system/)
277277

278278

279279
### 24. Pattern: Topological Sort (Graph)
@@ -291,18 +291,18 @@
291291
### 25. Pattern: Union Find
292292

293293
1. Introduction to Union Find Pattern
294-
2. Redundant Connection (medium)
295-
3. Number of Provinces (medium)
296-
4. Is Graph Bipartite? (medium)
297-
5. Path With Minimum Effort (medium)
294+
2. Redundant Connection (medium)[Leetcode - I](https://leetcode.com/problems/redundant-connection/)[Leetcode - II (Hard)](https://leetcode.com/problems/redundant-connection-ii/)
295+
3. Number of Provinces (medium)[Leetcode](https://leetcode.com/problems/number-of-provinces/)
296+
4. Is Graph Bipartite? (medium)[Leetcode](https://leetcode.com/problems/is-graph-bipartite/)
297+
5. Path With Minimum Effort (medium)[Leetcode](https://leetcode.com/problems/path-with-minimum-effort/)
298298

299299

300300
### 26. Ordered Set
301301

302302
1. Introduction to Ordered Set Pattern
303-
2. Merge Similar Items (easy)
304-
3. 132 Pattern (medium)
305-
4. My Calendar I (medium)
303+
2. Merge Similar Items (easy)[Leetcode](https://leetcode.com/problems/merge-similar-items/)
304+
3. 132 Pattern (medium)[Leetcode](https://leetcode.com/problems/132-pattern/)
305+
4. My Calendar I (medium)[Leetcode](https://leetcode.com/problems/my-calendar-i/)[Leetcode - II](https://leetcode.com/problems/my-calendar-ii/)[Leetcode - III (Hard)](https://leetcode.com/problems/my-calendar-iii/)
306306
5. Longest Continuous Subarray (medium)
307307

308308

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /