Learn Core Data Structures, Algorithms, and Problem Solving Techniques With Hands-On Examples
Sub Category
- Programming Languages
{inAds}
Objectives
- What Are Data Structures and Algorithms?
- Time and Space Complexity
- Recursion Basics
- Static vs Dynamic Arrays
- Common Array Operations
- String Handling Techniques
- Singly and Doubly Linked Lists
- Insertion, Deletion, Traversal
- Detecting Cycles
- Deque and Priority Queue
- Recursion Deep Dive
- Use Cases: Permutations, Subsets, N-Queens
- Binary Trees and Binary Search Trees (BST)
- Tree Traversals: Lnorder, Preorder, Postorder
- Heaps: Min and Max Heaps
- Collision Resolution (Chaining, Open Addressing)
- Bubble, Selection, Insertion
- Merge Sort and Quick Sort
- Counting Sort, Radix Sort
- Binary Search and Variants
- Graph Representations: Adjacency List & Matrix
- Detecting Cycles, Connected Components
- Optimization Techniques
Pre Requisites
- No prior experience required—learn DSA from scratch with clear explanations
- Basic programming knowledge is a plus point. (any language)
FAQ
- Q. How long do I have access to the course materials?
- A. You can view and review the lecture materials indefinitely, like an on-demand channel.
- Q. Can I take my courses with me wherever I go?
- A. Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
{inAds}
Coupon Code(s)