Data Structures and Algorithms with python Online Training Hyderabad

Data Structures and Algorithms Online Training Hyderabad

Interview Prep :Facebook ,Google, Amazon , Netflix

 

Chapter 1 – Arrays and Strings

  1. Traversing Array in Reverse (Using ESTCV Approach)
  2. Traverse from Both Ends
  3. Partitioning Arrays

 

Chapter 2 – Subarray Problems

  1. Kadane’s Algorithm
  2. Sliding Window using Two Pointers
  3. Prefix Sums

 

Chapter 3 – System Design Intro

  1. Anatomy of a Scalable Web Application
  2. Approach for System Design Interviews + Uber/Lyft Design
  3. Load Balancers and App Servers


Chapter 4 – System Design – Horizontal Scaling by Sharding

  1. Why Sharding is the Swiss Army Knife of System Design Interviews
  2. Optional Article: Distributed Caching Using Memcached
  3. CAP Theorem for Beginners
  4. Sharding – Using Partition Functions
  5. Dynamic Sharding
  6. Sharding – Consistent Hashing

 

Chapter 5 – Binary Search

  1. Implementation
  2. Binary Search with Duplicates
  3. Search for Closest – Record and Move On
  4. Special Tricks

 

 

Chapter 6 – Recursion and Backtracking

  1. Intro to Recursion and Memoization
  2. Permutations/Combinations using Auxiliary Buffer
  3. Backtracking Spaceship

 

Chapter 7 – Linked List

 

  1. Implementation
  2. Append Function
  3. Deleting Nodes
  4. Slow Pointer, Fast Pointer
  5. Linked Hash Table
  6. Reversing a Linked List

 

Chapter 8 – Stack

 

  1. Stack – Intro
  2. Stack as Restriction
  3. Stack with Max
  4. Expression Evaluation

Chapter 9 – System Design – Databases and Storage

 

  1. Databases – Intro to Indexing and NoSQL
  2. Key-Value Stores incl. Object Stores, In Memory DBs
  3. Wide Column Stores – e.g, HBase, Cassandra
  4. Transaction Processing

 

 

Chapter 10 – Queue

 

  1. Queue – Intro
  2. Queue – Sliding Window
  3. Queue with Max

 

Chapter 11 – Dynamic Programming

 

  1. DP Myths Tips
  2. Intro
  3. Approaching Dynamic Programming Problems

 

Chapter 12 – Arrays and Strings II

  1. Max Diff
  2. 2D Arrays
  3. Special Tricks
  4. Add/Multiply without Operators

 

Chapter 13 – Hash Table & Hash Functions

 

  1. Hash Table – Implementation
  2. Hash Table – Hash Functions
  3. Hash Table – String Search

 

 

Chapter 14 – System Design – Important Backend Components

 

  1. Distributed File System Design
  2. Distributed Processing using MapReduce
  3. Spatial Indexing – Nearest Neighbors Search

 

 

Chapter 15 – Graphs I

 

  1. Graphs I – Basics
  2. Graphs I – DFS
  3. Graphs I – BFS
  4. Graphs I – Topological Sort

 

 

Chapter 16 – Heap

  1. Heaps – Intro, Implementation (18:36) 2 problems Intro Implementation

 

Chapter 17 – Line Sweep

  1. Line Sweep – Intro
  2. Line Sweep – Skyline

 

Chapter 18 – Selection Algorithm

 

  1. Selection Algorithm

 

Chapter 19 – Sorting Algorithms

  1. Sorting Algorithms
  2. Merge Sort and Quick Sort
  3. Stability and Sorting Large Data
  4. Special Tricks

 

 

Chapter 20 – Graphs II

  1. Graphs II – Detecting Cycles
  2. Graphs II – Bipartite Graph
  3. Graphs II – Connected Components

 

 

Chapter 21 – Bit Manipulation

  1. Bit Manipulation – Intro
  2. Bit Manipulation – Flip Bits
  3. Bit Manipulation – Get & Set Bits
  4. Bit Manipulation – Swap Bits
  5. Bit Manipulation – LSB
  6. Bit Manipulation – Complement of Integer
  7. Bit Manipulation – Duplicate XOR

 

Chapter 22 – Binary Tree

  1. Binary Tree – Intro, Traversing
  2. Binary Tree – Top to Bottom
  3. Binary Tree – Bottom to Top
  4. Binary Tree – Lowest Common Ancestor
  5. Binary Tree – Reconstruction

 

Chapter 23 – Binary Search Tree

 

  1. Binary Search Tree – Intro, Implementation
  2. Binary Search Tree – Record and Move On
  3. Binary Search Tree – Successor
  4. Binary Search Tree – LCA
  5. Binary Search Tree – Building Balanced BSTs

 

 

Chapter 24 – Trie

  1. Trie – Intro
  2. Trie – Implementation

 

Chapter 25 – System Design – Putting it all together

  1. The System Design Template System Design Approach
  2. Design an E-commerce Application like Amazon System Design
  3. Design a Social Networking Service like Instagram System Design
  4. Design a URL Shortening Service like TinyURL System Design
  5. Design a Messaging Service like WhatsApp System Design

Updated: July 23, 2020 — 11:19 pm

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.