Cracking the Coding Interviews

Cracking the Coding Interviews 112 lectures26:15:17

QuickSelect Algorithm to find the Kth smallest Element in array - 1

02:43

Array puzzle of solving celebrity problem

02:43

In-place techniques matrix rotation method by 90 degree

02:43

Linear time approach to solve Stock Buy Sell Problem

02:43

Rectangle Overlap problem

02:43

Count frequencies of array elements in O(n) time complexity

02:43

Techniques to print matrix in spiral order without any extra space

02:43

Digit rearrangement method to find next greater number with same set of digits

02:43

Linear time approach to solve jump game problem

02:43

Greedy Techniques to find minimum number of platforms

02:43

Segregation logic to Sort an array of 0's, 1's and 2's

02:43

Binary search method to find Median of two sorted Array

02:43

Merge sort method to Count inversion in an array

02:43

Rain Trapping Problem

02:43

Binary search method to find square root of an element

02:43

Smallest window in a string containing all characters of another string - 2

02:43

Xor method to find the element that occurs one

02:43

Smallest window in a string containing all characters of another string - 1

02:43

QuickSelect Algorithm to find the Kth smallest Element in array - 2

02:43

Preview01:14

Design parking Lot

02:43

Preview08:38

Design Customs HashMap Implementation Internals - 2

02:43

Design Twitter like social networking service

02:43

Preview17:24

Design custom implementation hashmap, how hashmap works internally in Java

Design WhatsApp Chat Service

02:43

Backend System techniques for distributed system : SQl/NoSQL

02:43

Design Hit Counter

02:43

System design component: Sharding techniques

02:43

Design Drop Box/Google Drive

02:43

Design BookMyShow

02:43

Design Instagram

02:43

Design Online Hotel Booking System

02:43

Design Uber

02:43

Design Facebook NewsFeed

02:43

Design youtube/Netflix

02:43

Design online Discussion forum (like stackoverflow,quora)

02:43

Design Tiny URL

02:43

Design Online food delivery system like Swiggy, Zomato

02:43

Design a two Player Online Chess Game

02:43

Design Cricinfo

02:43

Design Airline Reservation System

02:43

Design Online Shopping System Like Amazon, Flipkart

02:43

Trie data structure approach to solve type head suggestion problem

02:43

Trie data Structure implementation

02:43

Understanding Queue based approach to Jumping Number problem

02:43

Depth-first search method to find cycle in a graph

02:43

Breadth first search algorithm to solve snake ladder problem

02:43

Trie data structure approach to solve word boggle Problem

02:43

Package Dependency Problem Using Topological Sorting

02:43

Breadth first search algorithm to solve Rotten Orange Problem

02:43

Topological Algorithm to solve alien dictionary problem

02:43

Dijkstra Algorithm explanation with example

02:43

Breadth first search algorithm to find Number of IsLand in matrix

02:43

Topological sorting concepts and implementation

02:43

How to Solve DP problems

02:43

Coin Change Problem

02:43

Edit Distance Problem

02:43

Climbing Stairs Problem

02:43

Matrix Path Problem

02:43

Wild Card Problem

02:43

Partition Problem

02:43

KnapSack Problems

02:43

Egg Dropping Problem

02:43

String interleave Problem

02:43

Word Break Problem

02:43

Keystroke Problem

02:43

Longest Common Subsequences

02:43

Longest Palindrome Subsequences

02:43

Knight Walk Problem

02:43

Implement pow(x, n)

02:43

Print all Permutations of a given String

02:43

Sudoku solving Problem - 2

02:43

Rat Maze Problem

02:43

Sudoku Solving Problem - 1

02:43

N Queen Problem

02:43

Convert a Binary Tree to Doubly Linked List

02:43

Connect Nodes at Same level in a Binary Tree

02:43

Preview16:21

Given two n-ary trees, the task is to check if they are mirror of each other or not

Spiral Order of Binary Tree

02:43

Vertical sum of Binary Tree

02:43

Reverse level order Traversal of Binary Tree

02:43

Serialize and Deserialize a Binary Tree

02:43

Bottom View of Binary Tree

02:43

Left View of Binary Tree

02:43

Diameter of Binary tree

02:43

Maximum Path Sum in a Binary Tree

02:43

Boundary Traversal of Binary Tree

02:43

Print all Nodes at Distance k from a given Node

02:43

Construct Tree from PostOrder

02:43

Print nodes at k distance from root

02:43

Merge k Sorted arrays

02:43

Median of running data streams problem

02:43

Heapify operation implementation

02:43

Four Sum Problem

02:43

Design and implement LRU

02:43

Min/Max Heap Implementation

02:43

Convert Number to Words Problems

02:43

Find first non-repeating character from a stream of characters

02:43

Group Anagrams Together

02:43

Minimum Window Substring

02:43

Find Maximum size rectangle in Binary Sub-matrix

02:43

Stack that Supports getMin() in O(1)

02:43

Histogram Problem

02:43

Sliding Window Problem using deque Data Structure

02:43

Flattering of LinkedList

02:43

Clone a Linked List

02:43

Sort Linked List using Merge Sort

02:43

Merge two Sorted Linked List

02:43

Reverse K Linked List

02:43