# Cracking Coding Interview Data Structure & Algorithm FAANG

Ace the Google, Amazon, Facebook, Microsoft, Netflix coding interviews. Step by step guide for their toughest questions!

4.3/5

## Cracking Coding Interview Data Structure & Algorithm FAANG

### What you’ll learn

Solve Easy to Medium Difficulty problems that address different data strutures
Have an understanding of how to systematically approach coding problems in a step by step manner
Learn everything you need to ace difficult coding interviews
Practice dozens of different challenges
Ace the coding interview at the top tech companies (Google, Amazon, Facebook, Apple, Microsoft, Netflix + others)
The ultimate resource to prepare for coding interviews, tech interviews and programming interviews
Use the right Data Structures and Algorithms to pass coding interview questions that have the optimal solution
Step by step guide to common questions, how to solve them, optimize, and present them during tech interview
Learn exactly what you need to answer difficult questions and the framework you need for ANY kind of questions they throw at you

### Requirements

Basic Knowledge of DS & Algo
Basic Knowledge of any one programming language like C++/Java/Python/C#…
If you have the ambition to learn and get into one of these companies we will make it achievable for you! (see our student success stories)

### Overview

Section 1: Length of Last Word

Lecture 1 Length of Last Word

Section 2: Reverse String

Lecture 2 Reverse String

Section 3: Longest Common Prefix

Lecture 3 Longest Common Prefix

Section 4: String class

Lecture 4 String class

Section 5: Vectors

Lecture 5 Vectors

Section 6: Fizz Buzz

Lecture 6 Fizz Buzz

Section 7: Evaluate Reverse Polish Notation

Lecture 7 Evaluate Reverse Polish Notation

Section 8: Excel Sheet Column Number

Lecture 8 Excel Sheet Column Number

Section 9: Palindrome String

Lecture 9 Palindrome String

Section 10: Valid Palindrome

Lecture 10 Valid Palindrome

Section 11: Remove All Adjacent Duplicates

Lecture 11 Remove All Adjacent Duplicates

Section 12: Remove All Adjacent Duplicates – 2

Lecture 12 Remove all adjacent duplicates – 2

Section 13: Recursion Basics

Lecture 13 Introduction to recursion

Lecture 14 Recursion and PMI

Lecture 15 Fibonacci Number

Lecture 16 Power

Lecture 17 Print Numbers

Lecture 18 Numbers of Digits

Lecture 19 Sum of Digits

Lecture 20 Multiplication

Lecture 21 Count Zeroes

Lecture 22 Geometric Sum

Section 14: Recursion Intermediate

Lecture 23 Check if Array is sorted

Lecture 24 Sum of Array

Lecture 25 Check if element is present

Lecture 26 First Index of element

Lecture 27 Last Index of element

Lecture 28 Print All position of element

Lecture 29 Count Occurrence of element- First Approach

Lecture 30 Count Occurrence of element- Second Approach

Lecture 31 Store All Position of element

Lecture 32 Check Palindrome

Lecture 33 Print and Reverse Print Recursively

Lecture 34 Length Recursively

Lecture 35 Replace Character Recursively

Lecture 36 Remove Character Recursively

Lecture 37 Remove Consecutive Duplicates

Lecture 38 Print All Subsequences of String

Lecture 39 Store All Subsequences of String

Lecture 40 Convert String to Integer

Lecture 41 Print All Permutation of String

Lecture 42 Staircase Problem

Lecture 43 Tower of Hanoi

Lecture 44 Print Steps in Tower of Hanoi

Section 16: Algorithm : Selection Sort

Lecture 45 Selection Sort Algorithm ( Explain + Code )

Section 17: Algorithms : Bubble Sort

Lecture 46 Bubble Sort Algorithm ( Explain + Code )

Lecture 47 Optimized Bubble Sort Algorithm (Explain + Code )

Lecture 48 Inbuilt Sort : Standard Template Library (STL)

Section 18: Algorithm : Merge Sort

Lecture 49 Merge Sort Introduction

Lecture 50 Merge Sort Solution

Section 19: Algorithm : Quick Sort

Lecture 51 Quick Sort Introduction

Lecture 52 Quick Sort Solution

Lecture 53 Quick Sort Testing

Section 20: Algorithm : Moore Voting : Majority Element

Lecture 54 Majority Element

Section 21: Algorithms : Binary Search

Lecture 55 Linear Search Algorithm ( Explain + Code )

Lecture 56 Problem with Linear Search

Lecture 57 Binary Search Algorithm (Explain)

Lecture 58 Binary Search Algorithm (Code)

Section 22: Advanced Binary Search : Find First & Last Occurence

Lecture 59 Find First & Last Occurence

Section 23: Advanced Binary Search : Search in Rotated Sorted Array

Lecture 60 Search in Rotated Sorted Array

Section 24: Advanced Binary Search : Implement Square root

Lecture 61 Implement Square root

Section 25: Advanced Binary Search : Find Minimum Element in Sorted Rotated Array

Lecture 62 Find Minimum Element in Sorted Rotated Array

Section 26: ZigZag Conversion

Lecture 63 ZigZag Conversion

Section 27: Single Number

Lecture 64 Single Number

Section 28: Jump Game

Lecture 65 Jump Game

Section 29: Jump Game – 2

Lecture 66 Jump Game – 2

Section 30: Reverse Words in a String

Lecture 67 Reverse Words in a String

Section 31: Find Permutation

Lecture 68 Find Permutation

Section 32: Rotate Image

Lecture 69 Rotate Image

Section 33: Spiral Order Matrix

Lecture 70 Spiral Order Matrix

Section 34: Set Matrix Zero

Lecture 71 Set Matrix Zero

Section 35: Search in Row-wise and Column-wise Matrix

Lecture 72 Search in Matrix

Section 36: Intersection of List

Lecture 73 Intersection of List

Section 37: Reverse a List

Lecture 74 Reverse a List

Section 38: Middle Node of List – Slow and Fast Pointer Approach

Lecture 75 Middle Node of List – Slow and Fast Pointer Approach

Section 39: Remove nth Node from end of list

Lecture 76 Remove nth Node from end of list

Section 40: Add 2 number as list

Lecture 77 Add 2 number as list

Section 41: Partition List

Lecture 78 Partition List

Section 42: Cycle Detection in Linked List

Lecture 79 Cycle

Section 43: Cycle – Find starting point of Cycle

Lecture 80 Cycle -2

Section 44: Valid Parenthesis

Lecture 81 Valid Parenthesis

Section 45: Inorder Traversal

Lecture 82 Inorder Traversal

Section 46: PreOrder Traversal

Lecture 83 PreOrder Traversal

Section 47: PostOrder Traversal

Lecture 84 PostOrder Traversal

Section 48: Same Tree

Lecture 85 Same Tree

Section 49: Symmetric Binary Tree

Lecture 86 Symmetric Binary Tree

Section 50: Count Nodes

Lecture 87 Count Nodes

Section 51: Maximum Depth of Binary Tree

Lecture 88 Maximum Depth of Binary Tree

Section 52: Level Order Traversal

Lecture 89 Level Order Traversal

Section 53: Reverse Level Order Traversal

Lecture 90 Reverse Level Order Traversal

Section 54: ZigZag Level Order Traversal

Lecture 91 ZigZag Level Order Traversal

Section 55: Vertical Order Traversal

Lecture 92 Vertical Order Traversal Explanation

Lecture 93 Vertical Order Traversal Code

Section 56: Minimum Depth of Binary Tree

Lecture 94 Minimum Depth of Binary Tree

Section 57: Lowest Common Ancestor – BST

Lecture 95 Lowest Common Ancestor

Section 58: Lowest Common Ancestor Binary Tree

Lecture 96 Lowest Common Ancestor Binary Tree explain

Lecture 97 Lowest Common Ancestor Binary Tree code

Section 59: Invert Binary Tree

Lecture 98 Invert Binary Tree

Section 60: Validate Binary Search Tree

Lecture 99 Validate Binary Search Tree

Section 61: Construct Tree from PreOrder and Inorder Traversal

Lecture 100 Construct Tree from PreOrder and Inorder Traversal Introduction

Lecture 101 Construct Tree from PreOrder and Inorder Traversal Solution

Section 62: Construct Tree from PostOrder and Inorder Traversal

Lecture 102 Construct Tree from PostOrder and Inorder Traversal Introduction

Lecture 103 Construct Tree from PostOrder and Inorder Traversal Solution

Section 63: Construct Cartesian Tree

Lecture 104 Construct Cartesian Tree Explain

Lecture 105 Construct Cartesian Tree Code

Section 64: Diameter of Binary Tree

Lecture 106 Diameter of Binary Tree

Lecture 107 Diameter of Binary Tree Better Approach

Section 65: Convert Sorted Array to BST

Lecture 108 Convert Sorted Array to BST

Section 66: Kth Smallest Element in a BST

Lecture 109 Kth Smallest Element in a BST Code

Lecture 110 Kth Smallest Element in a BST Explanation

Section 67: Two Sum

Lecture 111 Two Sum

Section 68: Two Sum II

Lecture 112 Two Sum II

Section 69: Data Structure : Priority Queues

Lecture 113 Introduction to Priority Queues

Lecture 114 Ways to implement Priority Queue

Lecture 115 Heap Introduction

Lecture 116 CBT and its Implementation

Lecture 117 Insert & Delete in Heaps

Lecture 118 Example Solution & Max Heap

Lecture 119 Implementation of Priority Queue – Part 1

Lecture 120 Implementation – Insert

Lecture 121 Remove Min Explanation

Lecture 122 Remove Min Solution & Complexity Analysis

Lecture 123 Inplace Heap Sort

Lecture 124 Inplace Heap Sort Solution

Lecture 125 Inbuilt Priority Queue

Lecture 126 K Sorted Array

Lecture 127 K smallest Element

Lecture 128 Inbuilt Min Priority Queue

Section 70: Data Structure : HashMap

Lecture 129 Introduction to Hash Map

Lecture 130 Inbuilt HashMap

Lecture 131 Remove Duplicates

Lecture 132 Iterators

Lecture 133 Bucket Array & Hash Function

Lecture 134 Collision Handling

Lecture 135 HashMap Implementation Insert

Lecture 136 HashMap Implementation Delete & Search

Lecture 137 Time Complexity & Load Factor

Lecture 138 Rehashing

Section 71: Fibonacci

Lecture 139 Fibonacci

Lecture 140 Hint : Minimum Steps to 1

Lecture 141 Minimum Steps to 1 Brute Force Method

Lecture 142 Minimum Steps to 1 Memorization Method

Lecture 143 Minimization Steps to 1 Bottom Up Method

Section 72: Minimum Steps in Infinite Grid

Lecture 144 Minimum Steps in Infinite Grid

Lecture 145 Minimum Steps in Infinite Grid – Coding

Section 73: Grid Unique Path

Lecture 146 Grid Unique Path Explanation

Lecture 147 Grid Unique Path – Coding

Lecture 148 Grid Unique Path Optimization

Section 74: Longest Common Subsequence

Lecture 149 Longest Common Subsequence Recursive

Lecture 150 Longest Common Subsequence DP

Section 75: Minimum Distance

Lecture 151 Minimum Distance Recursive

Lecture 152 Minimum Distance DP

Section 76: Climbing Stairs

Lecture 153 Climbing Stairs Recursive

Lecture 154 Climbing Stairs DP

Lecture 155 Climbing Stairs DP Generalised

Section 77: 0-1 Knapsack

Lecture 156 0-1 Knapsack Recursive

Lecture 157 0-1 Knapsack DP

Section 78: Data Structure : Trie

Lecture 158 Introduction

Lecture 159 Insert in Trie

Lecture 160 Search in Trie

Section 79: Hotel Reviews

Lecture 161 Hotel Reviews

Section 80: Shortest Unique Prefix

Lecture 162 Shortest Unique Prefix

Section 81: Paragraph Words Replacement

Lecture 163 Paragraph Words Replacement

Lecture 164 Paragraph Words Replacement – Trie Solution

Section 82: Number of islands

Lecture 165 Number of islands Explain

Lecture 166 Number of islands Code

Section 83: MaxArea of islands

Lecture 167 MaxArea of islands Explain

Lecture 168 MaxArea of islands code

Section 84: Algorithms : Topological Sort

Lecture 169 Introduction

Lecture 170 Topological Sort Code

Section 85: Course Schedule

Lecture 171 Course Schedule Explain

Lecture 172 Course Schedule Code

Section 86: Algorithms : Kruskal

Lecture 173 Introduction

Lecture 174 Disjoint Set for Cycle Detection

Lecture 175 Kruskal Code

Section 87: Algorithms : Prims

Lecture 176 Introduction + Code

Section 88: Commutable Islands

Lecture 177 Commutable Islands explain

Lecture 178 Commutable Islands code

Section 89: Shortest Path in Binary Matrix

Lecture 179 Shortest Path in Binary Matrix Explain

Lecture 180 Shortest Path in Binary Matrix Code

Section 90: Knight on chess Board

Lecture 181 Knight on chess Board explain

Lecture 182 Knight on chess Board code

Section 92: Rotten Oranges

Lecture 185 Rotten Oranges Explanation

Lecture 186 Rotten Oranges Code

Section 93: Algorithm : Dijikstra

Lecture 187 Algo : Dijikstra explain

Lecture 188 Algo : Dijikstra Code

Section 94: Merge K sorted List

Lecture 189 Merge K sorted List explanation

Lecture 190 Merge K sorted List code

Section 95: LRU Cache

Lecture 191 LRU Cache explain

Lecture 192 LRU Cache code

Section 96: Repeat and Missing Number

Lecture 193 Repeat and Missing Number Explanation

Lecture 194 Repeat and Missing Number Code

Section 97: Maximum Sum Subarray – Kadane’s Algorithm

Lecture 195 Maximum Sum Subarray explain

Lecture 196 Maximum Sum Subarray code

Section 98: Flip the array

Lecture 197 Flip Explanation

Lecture 198 Flip Code

Section 99: Distinct Number in Windows

Lecture 199 Distinct Number in Windows Explanation

Lecture 200 Distinct Number in Windows Code

Section 100: Mock Interview -> Very Important

Lecture 201 Mock Interview

Section 101: Bonus

Lecture 202 Coupons for my other courses

Any one who is preparing for a coding interview,Anyone that wants to work a Google, Amazon, Facebook, Microsoft, Apple, Netflix or other top tech companies,Any engineer, developer, programmer, who wants to improve their interviewing skills,Anyone interested in improving their whiteboard coding skills,Anyone who wants to become a better developer,Any self taught programmer who missed out on a computer science degree

#### Course Information:

Udemy | English | 47h 49m | 28.32 GB
Created by: Ankit Thakran

You Can See More Courses in the IT & Software >> Greetings from CourseDown.com

Scroll to Top