Master Data structres and Algorithms(DSA)
Key Highlights
- Hybrid learning program
- Training driven by developers from MAANG
- Based on Practice, Not Theory
- Workshops every week to ensure continuous learning
- Prepare yourself to grab internships and job with high paying companies
- Grow with our career service program
Program Outline
- Iteration
- Loops
- Problem solving with loops (Array, Matrix, Rotation, Min, Max)
- Search Algorithms
- Sort Algorithms
- Two Pointers, Sliding Window
- Recursion & Hashing
- String, Array, Set, Map
- Hash Tables, Linked List, Stack, Queue
- Tree, Heap, AVL Tree, Binary Indexed Tree, Segment Tree, LRU cache, LFU cache, N-ary Tree, Suffix Tree
- Graph – BFS and DFS traversal, problem-solving patterns, topological sorting, shortest path, minimum spanning tree
- Top Down vs Bottom Up
- Dynamic Programming vs Divide & Conquer
- Problems Using DP
- Climbing Stairs & Minimum coins
- Max subarray & Longest subsequence
- Number of Jumps & 0-1 Knapsack
- Greedy Algorithm
- Backtracking Algorithms
- Numbers theoretic algorithms
- Bit manipulation
- Randomized algorithms
- Geometry-based algorithms.
- Object-oriented programming basics
- Class
- Object
- Encapsulation
- Inheritance
- Abstraction
- Polymorphism
- Normalization
- SQL
- Joins
- Aggregation
- Indexes