Data Structures and Algorithms Online Training Hyderabad

  • Traversing Array in Reverse (Using ESTCV Approach)
  • Traverse from Both Ends
  • Partitioning Arrays
  • Kadane’s Algorithm
  • Sliding Window using Two Pointers
  • Prefix Sums
  • Anatomy of a Scalable Web Application
  • Approach for System Design Interviews + Uber/Lyft Design
  • Load Balancers and App Servers
  • Why Sharding is the Swiss Army Knife of System Design Interviews
  • Optional Article: Distributed Caching Using Memcached
  • CAP Theorem for Beginners
  • Sharding – Using Partition Functions
  • Dynamic Sharding
  • Sharding – Consistent Hashing
  • Implementation
  • Binary Search with Duplicates
  • Search for Closest – Record and Move On
  • Special Tricks
  • Intro to Recursion and Memoization
  • Permutations/Combinations using Auxiliary Buffer
  • Backtracking Spaceship
  • Implementation
  • Append Function
  • Deleting Nodes
  • Slow Pointer, Fast Pointer
  • Linked Hash Table
  • Reversing a Linked List
  • Stack – Intro
  • Stack as Restriction
  • Stack with Max
  • Expression Evaluation
  • Databases – Intro to Indexing and NoSQL
  • Key-Value Stores incl. Object Stores, In Memory DBs
  • Wide Column Stores – e.g, HBase, Cassandra
  • Transaction Processing
  • Queue – Intro
  • Queue – Sliding Window
  • Queue with Max
  • DP Myths Tips
  • Intro
  • Approaching Dynamic Programming Problems
  • Max Diff
  • 2D Arrays
  • Special Tricks
  • Add/Multiply without Operators
  • Hash Table – Implementation
  • Hash Table – Hash Functions
  • Hash Table – String Search
  • Distributed File System Design
  • Distributed Processing using MapReduce
  • Spatial Indexing – Nearest Neighbors Search
  • Graphs I – Basics
  • Graphs I – DFS
  • Graphs I – BFS
  • Graphs I – Topological Sort
  • Heaps – Intro, Implementation (18:36) 2 problems Intro Implementation
  • Line Sweep – Intro
  • Line Sweep – Skyline
  • Sorting Algorithms
  • Merge Sort and Quick Sort
  • Stability and Sorting Large Data
  • Special Tricks
  • Graphs II – Detecting Cycles
  • Graphs II – Bipartite Graph
  • Graphs II – Connected Components
  • Bit Manipulation – Intro
  • Bit Manipulation – Flip Bits
  • Bit Manipulation – Get & Set Bits
  • Bit Manipulation – Swap Bits
  • Bit Manipulation – LSB
  • Bit Manipulation – Complement of Integer
  • Bit Manipulation – Duplicate XOR
  • Binary Tree – Intro, Traversing
  • Binary Tree – Top to Bottom
  • Binary Tree – Bottom to Top
  • Binary Tree – Lowest Common Ancestor
  • Binary Tree – Reconstruction
  • Binary Search Tree – Intro, Implementation
  • Binary Search Tree – Record and Move On
  • Binary Search Tree – Successor
  • Binary Search Tree – LCA
  • Binary Search Tree – Building Balanced BSTs
  • Trie – Intro
  • Trie – Implementation
  • The System Design Template System Design Approach
  • Design an E-commerce Application like Amazon System Design
  • Design a Social Networking Service like Instagram System Design
  • Design a URL Shortening Service like TinyURL System Design
  • Design a Messaging Service like WhatsApp System Design

Data Structures and Algorithms Demo By Balaji SIr

Register Now for Data Structures and Algorithms Live Demo