DATA Structure and algorithm preparation for tire 1 companies (like Google, Facebook, amazon, microsoft etc.)

Data Structure and Algorithm Preparation – Tutorial 1- Introduction

This video is about Data Structure and Algorithm preparation for tire 1 companies like Google, Amazon, Facebook, Microsoft, Apple, in this tutorial I am describing all data structures which are required for tire1 companies interview, below is list of all such data structures:
¥ Array
¥ Linked-list
¥ Stack
¥ Queue
¥ Trees , BinaryTree(BT), BinarySearchTree(BST), AVL, RedBlack tree
¥ Heap
¥ Hashing
¥ Graph, Metrics,
¥ Dynamic Programming (believe me, it’s easy)
¥ Bit Manipulation (XOR, And, Or etc)
¥ Geometry (asked in Google)
¥ Probability (asked in Google)
¥ Sorting and searching
¥ String matching (KMP)
Advanced DS-Algo (Trie, Segment Tree, Splay Tree, B Tree )

Data Structure and algorithm preparation -Tutorial 2 – In Memory storage vs hard disk storage

This video is about Data Structure and Algorithm preparation for tire 1 companies like Google, Amazon, Facebook, Microsoft, Apple, in this tutorial I am describing what is in memory/ application memory and what is disk memory, when an interviewer ask a question, why total number of element is required, why we should ask – “How many numbers are there?”, how to resolve below billion record question via in memory approach and how to resolve above billion record question with the help of disk storage ?

Data Structure and algorithm preparation for tire1 companies -Tutorial 3 – Disk and Network Latency

This video is about Data Structure and Algorithm preparation for tire 1 companies like Google, Amazon, Facebook, Microsoft, Apple, in this tutorial I am describing about Disk and Network Latency, I have provided different latency and guided for “How to use latency data for ds-algo question and design question.

technology and invention make us alive.