https://github.com/pranavgoel29/week2-dp4-cipherschools

https://github.com/pranavgoel29/week2-dp4-cipherschools

Last synced: 11 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/pranavgoel29/week2-dp4-cipherschools
• Owner: pranavgoel29
• Created: 2023-02-03T09:51:17.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-02-04T13:09:56.000Z (almost 2 years ago)
• Last Synced: 2024-10-10T14:13:50.273Z (about 1 month ago)
• Language: C++
• Size: 52.7 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# week2-DP4-CipherSchools

Competitive Coding using C++ for Interview Prep - CipherSchools

"# week2-DP4-CipherSchools" 

# Videos

- Merge intervals(continue),

- Q1(Next smaller/greater element), Q2(histogram area, Q3(insert at the bottom)(intro)

- Q3(insert at the bottom)(continue), LRU cache

- Binary tree(intro), Traversals

- Traversals(continue), queue approach, Question(diameter of BT)

- Question(diameter of BT)(contunue), Question(level order traversal), Question(vertical order traversal)

- Binary Tree Questions

- Questions: 3(continue), 4(Serialize & Deserialize), 5(Serialize & Deserialize, 6(Root to leaf problem), 7 (print ancestors of BT), 8 (Find LCA of BT), 9 (BT - Doubly LL)

- CRUD Operations, Q1(convert sorted array to BST), Q2(LCA

- Questions: 3(print BST range problem)(cont), 4(Balanced BST problem), 5(Least common ancestor problem), 6(Unique BST count problem)

- Binary heap(Q1, Q2)

- Q2(continue), Q3(Kth smallest element

- Segment tree problem, recommended tutorials

- recommended questions discussion, coin change problem

- Subset-sum problem, Longest Sum Increasing

- Longest Sum Increasing subsequence

- DP: 0-1 Knapsack problem

- LPS (continue), LCS, LIPL