Commit 2b3487e

authored

added new sections for testing your knowledge

1 parent f65bdd0 commit 2b3487eCopy full SHA for 2b3487e

File tree

+46

-1

lines changed

+46

-1

lines changed

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -320,7 +320,13 @@`
`320`	`320`
`321`	`321`	`### Revision`
`322`	`322`
`323`		`-1. Coding Patterns: A Cheat Sheet`
	`323`	`+1. [Coding Patterns: A Cheat Sheet](revision/Revision.md)`
	`324`	`+`
	`325`	`+`
	`326`	`+### Test Your Knowledge`
	`327`	`+1. [Easy Problems](test-your-knowledge/1.EasyProblems.md)`
	`328`	`+2. [Medium Problems](test-your-knowledge/2.MediumProblems.md)`
	`329`	`+3. [Hard Problems](test-your-knowledge/3.HardProblems.md)`
`324`	`330`
`325`	`331`
`326`	`332`	> *Note:* Problems marked with `*` are added as per my recommendations.

Lines changed: 7 additions & 0 deletions

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+# Medium Problems`
	`2`	`+`
	`3`	`+1. Daily Temperatures (Medium)`
	`4`	`+2. Group Anagrams (Medium)`
	`5`	`+3. Decode String (Medium)`
	`6`	`+4. Valid Sudoku (Medium)`
	`7`	`+5. Product of Array Except Self (Medium)`
	`8`	`+6. Maximum Product Subarray (Medium)`
	`9`	`+7. Container With Most Water (Medium)`
	`10`	`+8. Palindromic Substrings (Medium)`
	`11`	`+9. Remove Nth Node From End of List (Medium)`
	`12`	`+10. Find Minimum in Rotated Sorted Array (Medium)`
	`13`	`+11. Pacific Atlantic Water Flow (Medium)`
	`14`	`+12. Validate Binary Search Tree (medium)`
	`15`	`+13. Construct Binary Tree from Preorder and Inorder Traversal (medium)`
	`16`	`+14. Clone Graph (medium)`
	`17`	`+15. House Robber II (medium)`
	`18`	`+16. Decode Ways (medium)`
	`19`	`+17. Unique Paths (medium)`
	`20`	`+18. Word Break (medium)`
	`21`	`+19. Lowest Common Ancestor of a Binary Search Tree (medium)`
	`22`	`+20. Longest Consecutive Sequence (medium)`
	`23`	`+21. Meeting Rooms II (medium)`
	`24`	`+22. Encode and Decode Strings`
	`25`	`+23. Number of Connected Components in an Undirected Graph`
	`26`	`+24. Graph Valid Tree (medium)`
	`27`	`+25. Implement Trie (Prefix Tree) (medium)`
	`28`	`+26. Design Add and Search Words Data Structure (medium)`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,4 @@`
	`1`	`+# Hard Problems`
	`2`	`+`
	`3`	`+1. Longest Valid Parentheses (hard)`
	`4`	`+2. Serialize and Deserialize Binary Tree (hard)`

Comments

(0)