Cracking Coding Interview : Data Structure & Algorithms FAANG

Udemy

Prepare for coding interviews conducted by top tech companies and learn data structures.

Online

₹ 3499

particular

details

                                    Medium of instructions
                                    English

                                    Mode of learning
                                    Self study

                                    Mode of Delivery
                                    Video and Text Based

Length of Last Word

Length of Last Word

Reverse String

Reverse String

Longest Common Prefix

Longest Common Prefix

String class

String class

Vectors

Vectors

Fizz Buzz

Fizz Buzz

Evaluate Reverse Polish Notation

Evaluate Reverse Polish Notation

Excel Sheet Column Number

Excel Sheet Column Number

Palindrome String

Palindrome String

Valid Palindrome

Valid Palindrome

Remove All Adjacent Duplicates

Remove All Adjacent Duplicates

Remove All Adjacent Duplicates - 2

Remove All Adjacent Duplicates - 2

Recursion Basics

Introduction to recursion
Recursion and PMI
Fibonacci Number
Power
Print Numbers
Numbers of Digits
Sum of Digits
Multiplication
Count Zeroes
Geometric Sum

Recursion Intermediate

Check if Array is sorted
Sum of Array
Check if element is present
First Index of element
Last Index of element
Print All position of element
Count Occurrence of element- First Approach
Count Occurrence of element- Second Approach
Store All Position of element
Check Palindrome

Recursion Advanced

Print and Reverse Print Recursively
Length Recursively
Replace Character Recursively
Remove Character Recursively
Remove Consecutive Duplicates
Print All Subsequences of String
Store All Subsequences of String
Convert String to Integer
Print All Permutation of String
Staircase Problem
Tower of Hanoi
Print Steps in Tower of Hanoi

Algorithm : Selection Sort

Selection Sort Algorithm ( Explain + Code )

Algorithms : Bubble Sort

Bubble Sort Algorithm ( Explain + Code )
Optimized Bubble Sort Algorithm (Explain + Code )
Inbuilt Sort : Standard Template Library (STL)

Algorithm : Merge Sort

Merge Sort Introduction
Merge Sort Solution

Algorithm : Quick Sort

Quick Sort Introduction
Quick Sort Solution
Quick Sort Testing

Algorithm : Moore Voting : Majority Element

Majority Element

Algorithms : Binary Search

Linear Search Algorithm ( Explain + Code )
Problem with Linear Search
Binary Search Algorithm (Explain)
Binary Search Algorithm (Code)

Advanced Binary Search : Find First & Last Occurence

Find First & Last Occurence

Advanced Binary Search : Search in Rotated Sorted Array

Search in Rotated Sorted Array

Advanced Binary Search : Implement Square root

Implement Square root

Advanced Binary Search : Find Minimum Element in Sorted Rotated Array

Find Minimum Element in Sorted Rotated Array

ZigZag Conversion

ZigZag Conversion

Single Number

Single Number

Jump Game

Jump Game

Jump Game - 2

Jump Game - 2

Reverse Words in a String

Reverse Words in a String

Find Permutation

Find Permutation

Rotate Image

Rotate Image

Spiral Order Matrix

Spiral Order Matrix

Set Matrix Zero

Set Matrix Zero

Search in Row-wise and Column-wise Matrix

Search in Matrix

Intersection of List

Intersection of List

Reverse a List

Reverse a List

Middle Node of List - Slow and Fast Pointer Approach

Middle Node of List - Slow and Fast Pointer Approach

Remove nth Node from end of list

Remove nth Node from end of list

Add 2 number as list

Add 2 number as list

Partition List

Partition List

Cycle Detection in Linked List

Cycle

Cycle - Find starting point of Cycle

Cycle -2

Valid Parenthesis

Valid Parenthesis

Inorder Traversal

Inorder Traversal

PreOrder Traversal

PreOrder Traversal

PostOrder Traversal

PostOrder Traversal

Same Tree

Same Tree

Symmetric Binary Tree

Symmetric Binary Tree

Count Nodes

Count Nodes

Maximum Depth of Binary Tree

Maximum Depth of Binary Tree

Level Order Traversal

Level Order Traversal

Reverse Level Order Traversal

ZigZag Level Order Traversal

ZigZag Level Order Traversal

Vertical Order Traversal

Vertical Order Traversal Explanation
Vertical Order Traversal Code

Minimum Depth of Binary Tree

Minimum Depth of Binary Tree

Lowest Common Ancestor - BST

Lowest Common Ancestor

Lowest Common Ancestor Binary Tree

Lowest Common Ancestor Binary Tree explain
Lowest Common Ancestor Binary Tree code

Invert Binary Tree

Invert Binary Tree

Validate Binary Search Tree

Validate Binary Search Tree

Construct Tree from PreOrder and Inorder Traversal

Construct Tree from PreOrder and Inorder Traversal Introduction
Construct Tree from PreOrder and Inorder Traversal Solution

Construct Tree from PostOrder and Inorder Traversal

Construct Tree from PostOrder and Inorder Traversal Introduction
Construct Tree from PostOrder and Inorder Traversal Solution

Construct Cartesian Tree

Construct Cartesian Tree Explain
Construct Cartesian Tree Code

Diameter of Binary Tree

Diameter of Binary Tree
Diameter of Binary Tree Better Approach

Convert Sorted Array to BST

Convert Sorted Array to BST

Kth Smallest Element in a BST

Kth Smallest Element in a BST Code
Kth Smallest Element in a BST Explanation

Two Sum

Two Sum

Two Sum II

Two Sum II

Data Structure : Priority Queues

Introduction to Priority Queues
Ways to implement Priority Queue
Heap Introduction
CBT and its Implementation
Insert & Delete in Heaps
Example Solution & Max Heap
Implementation of Priority Queue - Part 1
Implementation - Insert
Remove Min Explanation
Remove Min Solution & Complexity Analysis
Inplace Heap Sort
Inplace Heap Sort Solution
Inbuilt Priority Queue
K Sorted Array
K smallest Element
Inbuilt Min Priority Queue

Data Structure : HashMap

Introduction to Hash Map
Inbuilt HashMap
Remove Duplicates
Iterators
Bucket Array & Hash Function
Collision Handling
HashMap Implementation Insert
HashMap Implementation Delete & Search
Time Complexity & Load Factor
Rehashing

Fibonacci

Fibonacci
Hint : Minimum Steps to 1
Minimum Steps to 1 Brute Force Method
Minimum Steps to 1 Memorization Method
Minimization Steps to 1 Bottom Up Method

Minimum Steps in Infinite Grid

Minimum Steps in Infinite Grid
Minimum Steps in Infinite Grid - Coding

Grid Unique Path

Grid Unique Path Explanation
Grid Unique Path - Coding
Grid Unique Path Optimization

Longest Common Subsequence

Longest Common Subsequence Recursive
Longest Common Subsequence DP

Minimum Distance

Minimum Distance Recursive
Minimum Distance DP

Climbing Stairs

Climbing Stairs Recursive
Climbing Stairs DP
Climbing Stairs DP Generalised

0-1 Knapsack

0-1 Knapsack Recursive
0-1 Knapsack DP

Data Structure : Trie

Introduction
Insert in Trie
Search in Trie

Hotel Reviews

Hotel Reviews

Shortest Unique Prefix

Shortest Unique Prefix

Paragraph Words Replacement

Paragraph Words Replacement
Paragraph Words Replacement - Trie Solution

Number of islands

Number of islands Explain
Number of islands Code

MaxArea of islands

MaxArea of islands Explain
MaxArea of islands code

Algorithms : Topological Sort

Introduction
Topological Sort Code

Course Schedule

Course Schedule Explain
Course Schedule Code

Algorithms : Kruskal

Introduction
Disjoint Set for Cycle Detection
Kruskal Code

Algorithms : Prims

Introduction + Code

Commutable Islands

Commutable Islands explain
Commutable Islands code

Shortest Path in Binary Matrix

Shortest Path in Binary Matrix Explain
Shortest Path in Binary Matrix Code

Knight on chess Board

Knight on chess Board explain
Knight on chess Board code

Word Ladder

Word Ladder explain
Word Ladder code

Rotten Oranges

Rotten Oranges Explanation
Rotten Oranges Code

Algorithm : Dijikstra

Algo : Dijikstra explain
Algo : Dijikstra Code

Merge K sorted List

Merge K sorted List explanation
Merge K sorted List code

LRU Cache

LRU Cache explain
LRU Cache code

Repeat and Missing Number

Repeat and Missing Number Explanation
Repeat and Missing Number Code

Maximum Sum Subarray - Kadane's Algorithm

Maximum Sum Subarray explain
Maximum Sum Subarray code

Flip the array

Flip Explanation
Flip Code

Distinct Number in Windows

Distinct Number in Windows Explanation
Distinct Number in Windows Code

Mock Interview -> Very Important

Mock Interview

Bonus

Coupons for my other courses

Popular Courses

Popular Platforms

Popular Searches