|
266 | 266 | - [ ] [Decode the given sequence to construct minimum number without repeated digits](http://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/) |
267 | 267 | - [ ] [All combinations of elements satisfiying given constraints](http://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/) |
268 | 268 |
|
269 | | - |
270 | 269 | - Graphs |
271 | 270 | - [ ] Implement Dijkstra’s algorithm |
272 | 271 | - [ ] Implement Topological sort |
|
308 | 307 | - [ ] [Print All Hamiltonian Path present in a graph](http://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/) |
309 | 308 | - [ ] [Greedy coloring of graph](http://www.techiedelight.com/greedy-coloring-graph/) |
310 | 309 |
|
311 | | -- LinkedLists |
312 | | - - [ ] [Detect Cycle](https://leetcode.com/problems/linked-list-cycle/) |
| 310 | +- Lists |
313 | 311 | - [ ] [Merge 2 Sorted](https://leetcode.com/problems/merge-two-sorted-lists/) |
314 | 312 | - [ ] [Merge k Sorted](https://leetcode.com/problems/merge-k-sorted-lists/) |
315 | 313 | - [ ] [Remove n-th node from end of list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) |
316 | 314 | - [ ] [Reorder list](https://leetcode.com/problems/reorder-list/) |
| 315 | + |
| 316 | + |
| 317 | +- LinkedLists |
| 318 | + - [ ] [Detect Cycle](https://leetcode.com/problems/linked-list-cycle/) |
317 | 319 | - [ ] [Introduction to Linked Lists](http://www.techiedelight.com/introduction-linked-lists/) |
318 | 320 | - [ ] [Linked List Implementation | Part 1](http://www.techiedelight.com/linked-list-implementation-part-1/) |
319 | 321 | - [ ] [Linked List Implementation | Part 2](http://www.techiedelight.com/linked-list-implementation-part-2/) |
|
378 | 380 | - [ ] [Find size of largest square sub-matrix of 1’s present in given binary matrix](http://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/) |
379 | 381 | - [ ] [Find path from source to destination in a matrix that satisfies given constraints](http://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/) |
380 | 382 | - Strings |
381 | | - - [ ] [KMP](https://www.wikiwand.com/en/articles/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) |
382 | 383 | - [ ] [Check if given string is a rotated palindrome or not](http://www.techiedelight.com/check-given-string-rotated-palindrome-not/) |
383 | 384 | - [ ] [Check if repeated subsequence is present in the string or not](http://www.techiedelight.com/check-repeated-subsequence-present-string-not/) |
384 | 385 | - [ ] [Check if strings can be derived from each other by circularly rotating them](http://www.techiedelight.com/check-strings-can-derived-circularly-rotating/) |
|
423 | 424 | - [ ] [Shortest Common Supersequence | Introduction & SCS Length](http://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/) |
424 | 425 | - [ ] [Shortest Common Supersequence | Finding all SCS](http://www.techiedelight.com/shortest-common-supersequence-finding-scs/) |
425 | 426 | - [ ] [Shortest Common Supersequence | Using LCS](http://www.techiedelight.com/shortest-common-supersequence-using-lcs/) |
| 427 | + - [ ] [KMP](https://www.wikiwand.com/en/articles/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) |
426 | 428 |
|
427 | 429 | - Binary Tree |
428 | 430 | - [ ] [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) |
|
489 | 491 | - [ ] [Floor and Ceil in a Binary Search Tree](http://www.techiedelight.com/floor-ceil-bst-iterative-recursive/) |
490 | 492 | - [ ] [Find optimal cost to construct binary search tree](http://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/) |
491 | 493 |
|
492 | | - |
493 | 494 | - Trie |
494 | 495 | - [ ] [Trie Implementation | Insert, Search and Delete](http://www.techiedelight.com/trie-implementation-insert-search-delete/) |
495 | 496 | - [ ] [Memory efficient Trie Implementation using Map | Insert, Search and Delete](http://www.techiedelight.com/memory-efficient-trie-implementation-using-map-insert-search-delete/) |
|
499 | 500 | - [ ] [Find first k maximum occurring words in given set of strings](http://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/) |
500 | 501 | - [ ] [Find Duplicate rows in a binary matrix](http://www.techiedelight.com/find-duplicate-rows-binary-matrix/) |
501 | 502 |
|
502 | | - |
503 | 503 | - Heaps |
504 | 504 | - [ ] [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) |
505 | 505 | - [ ] [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) |
|
0 commit comments