There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
Crack Interviews and Code like a Pro!
Language: Hinglish
Instructors: AcadBoost
Why this course?
DSA is very important in CS, and also in interviews. Without a good knowledge of DSA, you cannot expect to get a good job. This is where this course will help you.
This course will equip you with theoretical and practical knowledge of Data Structures and Algorithms - from basics like Linked Lists to advanced concepts like Graphs and Tries.
This will help you ace your interviews and build software that matters.
| Complexity Analysis | |||
| Time and Space Complexity (20:00) | |||
| Arrays | |||
| Arrays Theory (31:00) | Preview | ||
| Arrays Coding Problems (23:00) | Preview | ||
| Recursion | |||
| Recursion (25:00) | |||
| Linked Lists | |||
| Linked Lists 1 (14:00) | |||
| Linked Lists 2 (25:00) | |||
| Stacks and Queues | |||
| Stacks and Queues 1 (36:00) | |||
| Stacks and Queues 2 (Problems) (23:00) | |||
| Trees | |||
| Trees (46:00) | |||
| Binary Search Tree (15:00) | |||
| Sorting Algorithms | |||
| Sorting 1 (19:00) | |||
| Sorting 2 (23:00) | |||
| String | |||
| String Final (29:00) | |||
| Hashmap | |||
| Hashmap Theory (24:00) | |||
| Hashmap Problems (18:00) | |||
| Graphs | |||
| Graphs (33:00) | |||
| Dynamic Programming and Tries | |||
| DP & Tries (1,327:00) | |||
| DP Problems (31:00) | |||
| Project | |||
| project1final (8:00) | |||
| project2final (58:00) | |||
After successful purchase, this item would be added to your courses.You can access your courses in the following ways :
Launch your Graphy
