https://github.com/abhinandan-khurana/week2-dp4-cipherschools

Competitive Coding using C++ for Interview Prep - CipherSchools
https://github.com/abhinandan-khurana/week2-dp4-cipherschools

data-structures interview-practice interview-preparation interview-questions practice-cpp practice-programming

Last synced: 3 days ago
JSON representation

Competitive Coding using C++ for Interview Prep - CipherSchools

• Host: GitHub
• URL: https://github.com/abhinandan-khurana/week2-dp4-cipherschools
• Owner: Abhinandan-Khurana
• Created: 2023-02-03T08:33:44.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-02-04T17:29:28.000Z (almost 2 years ago)
• Last Synced: 2023-03-10T18:21:41.731Z (over 1 year ago)
• Topics: data-structures, interview-practice, interview-preparation, interview-questions, practice-cpp, practice-programming
• Language: C++
• Homepage:
• Size: 30.3 KB
• Stars: 0
• 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

### Videos -->

- 19 .	Merge intervals(continue),

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

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

- 22 .	Binary tree(intro), Traversals

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

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

- 25 .	Binary Tree Questions

- 26 .	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)

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

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

- 29 .	Binary heap(Q1, Q2)

- 30 .	Q2(continue), Q3(Kth smallest element

- 31 .	Segment tree problem, recommended tutorials

- 32 .	recommended questions discussion, coin change problem

- 33 .	Subset-sum problem, Longest Sum Increasing

- 34 .	Longest Sum Increasing subsequence

- 35 .	DP: 0-1 Knapsack problem

- 36 .	LPS (continue), LCS, LIPL