Data Structure & Algorithm
Node JS,Mongo DB,System Design
Major projects & Mock Interviews.
Divyanshu is IIT Delhi, & IIM Bangalore Alumnus and has worked with organizations Like Intel, Ericsson Wipro in India & Abroad.He left Intel from the position of Group Lead for his passion to develop the budding engineers for the best of the opportunity in market.
Mayank is EX Samsung R&D and entrepreneur of IOT Organization. He is a Lead speaker at Google Business Group, Advisor to India Air force on Security measures that has to be taken so that spying can be avoided for premise and officers.and have built various projects for govt. Department.
Amit is a master in IT with 15+ years of Experience in It Industry and has trained many fresh graduates joining Wipro, HCL, FLipkart and many more of League.
Debashish is Master in Computer Science from IIT Hyderabad and enrolled as a PHD. programme with a reputed france based University. He works as a Member of the Tech Team with Mentor Graphics & Tata Consultancy.
1 . Basics and Control Flow in recursion
2 . Recursion with arrays and arraylist
3 . Recursion on the way up
4 . Recursion and combinatorics
5 . Recursion and memory maps
6 . Advanced recursion – sudoku, crossword, bit masking
1 . Advanced Generic Tree Questions
2 . Application of Generic Tree Interview Questions
1 . Advanced Binary Tree Questions
2 . Application of Binary Tree Interview Questions
1 . Advanced BST Questions
2 . AVL Tree Implementation
1 . Recursion to Dynamic Programming
2 . Memoization and Tabulation
3 . 1D DP
4 . 2D DP
5 . DP with Bit Masking
6 . Greedy vs DP
1 . Advanced HashMap Questions - 1
2 . Advanced HashMap Questions - 2
3 . Application of HashMap Interview Questions
1 . Advanced Heap questions
2 . Adapter Design Pattern and Comparators
1 . Basic Concepts Revision
2 . Dijkstra, Prims, Kruskals, Bipartite
3 . DAG implementation, Topological sort
4 . Bellman ford & Floyd Warshall
5 . Articulation Point and Bridges
6 . Network flow - Ford Fulkerson Algorithm
1 . Advanced Stacks Questions
2 . Advanced Queues Questions
3 . Application of Stack and Queues Interview Questions
1 . Advanced LinkedList Questions - 1
2 . Advanced LinkedList Questions - 2
3 . Application of LinkedList Interview Questions
1 . Number Theory
2 . Computational Geometry - Line and sweep algorithm
3 . Computational Geometry - Convex hull
4 . Computational Geometry - Jarvis algorithm
5 . Range Queries - Segment Tree
6 . Range Queries - Persistent Tree and Lazy Propogation
7 . Range Queries - Fenvick Tree
8 . Range Queries - Square Root Decomposition
9 . Range Queries - MOs Algorithm
10 . Advanced CP
11 . Advanced Graphs - Kosaraju Algorithm
12 . Advanced Graphs - Tarjan's Algorithm
13 . Union Find Algorithms
14 . Pattern Matching - KMP Algorithm
15 . Pattern Matching - Rolling Hash Algorithm
“I have really met a team of professionals who helped us recruiting fresh talent with stability, performance oriented and adaptive to work environment. Keep it up Careerthon!”
Years Teaching exp.
We all have questions & it's good to have them answered.
Here are a few quick ones we could think of
For anything specific, please feel free to email us on firstname.lastname@example.org
You will have access to all the recorded lectures, which can be accessed anytime over the portal.
This Programme by Careerthon assures you of a minimum Job offer when you join and start your program. If you are not able to get any Job offer equal to or above the assured package and remain unemployed, you will get your money back.