|
1
|
|
|
|
System Design Introduction For Interview.
|
|
|
13 listeners
|
|
2
|
|
|
|
Longest Palindromic Substring Manacher's Algorithm
|
|
|
9 listeners
|
|
3
|
|
|
|
Longest Common Subsequence
|
|
|
9 listeners
|
|
4
|
|
|
|
Topological Sort Graph Algorithm
|
|
|
6 listeners
|
|
5
|
|
|
|
Disjoint Sets using union by rank and path compression Graph Algorithm
|
|
|
6 listeners
|
|
Don't want to see ads? Upgrade Now
|
|
6
|
|
|
|
Longest Palindromic Subsequence
|
|
|
6 listeners
|
|
7
|
|
|
|
Solution
|
|
|
3 listeners
|
|
8
|
|
|
|
Introduction
|
|
|
3 listeners
|
|
9
|
|
|
|
0/1 Knapsack Problem Dynamic Programming
|
|
|
3 listeners
|
|
10
|
|
|
|
Wildcard Matching Dynamic Programming
|
|
|
3 listeners
|
|
11
|
|
|
|
Dijkstra's Algorithm Single Source Shortest Path Graph Algorithm
|
|
|
3 listeners
|
|
12
|
|
|
|
Fenwick Tree or Binary Indexed Tree
|
|
|
3 listeners
|
|
13
|
|
|
|
Cutting Rod dynamic programming
|
|
|
3 listeners
|
|
14
|
|
|
|
initialize result array
|
|
|
2 listeners
|
|
15
|
|
|
|
Strongly Connected Components Kosaraju's Algorithm Graph Algorithm
|
|
|
2 listeners
|
|
16
|
|
|
|
Formula
|
|
|
2 listeners
|
|
17
|
|
|
|
Optimal Binary Search Tree
|
|
|
2 listeners
|
|
18
|
|
|
|
Longest Increasing Subsequence
|
|
|
2 listeners
|
|
19
|
|
|
|
Subset Sum Problem Dynamic Programming
|
|
|
2 listeners
|
|
20
|
|
|
|
Count Number of Binary Search Tree Possible given n keys Dynamic Programming
|
|
|
2 listeners
|
|
21
|
|
|
|
Segment Tree Range Minimum Query
|
|
|
2 listeners
|
|
22
|
|
|
|
Staircase Problem Fibonacci Series
|
|
|
2 listeners
|
|
23
|
|
|
|
Text Justification Dynamic Programming
|
|
|
1 listener
|
|
24
|
|
|
|
Coin Changing Minimum Number of Coins Dynamic programming
|
|
|
1 listener
|
|
25
|
|
|
|
Matrix Chain Multiplication
|
|
|
1 listener
|
|
Don't want to see ads? Upgrade Now
|
|
26
|
|
|
|
Tools
|
|
|
1 listener
|
|
27
|
|
|
|
Problem Statement
|
|
|
1 listener
|
|
28
|
|
|
|
Question
|
|
|
1 listener
|
|
29
|
|
|
|
increasing subsequence
|
|
|
1 listener
|
|
30
|
|
|
|
Concepts
|
|
|
1 listener
|
|
31
|
|
|
|
Preprocessing
|
|
|
1 listener
|
|
32
|
|
|
|
Counting n keys
|
|
|
1 listener
|
|
33
|
|
|
|
ABCDS
|
|
|
1 listener
|
|
34
|
|
|
|
Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)
|
|
|
1 listener
|
|
35
|
|
|
|
System design : Design Autocomplete or Typeahead Suggestions for Google search
|
|
|
1 listener
|
|
36
|
|
|
|
Longest Increasing Subsequence in nlogn time
|
|
|
1 listener
|
|
37
|
|
|
|
Kruskal's algorithm Minimum Spanning Tree Graph Algorithm
|
|
|
1 listener
|
|
38
|
|
|
|
Numbers WIthout Consecutive 1s in binary representation
|
|
|
1 listener
|
|
39
|
|
|
|
Binary Search : Median of two sorted arrays of different sizes.
|
|
|
1 listener
|
|
40
|
|
|
|
System Design : Design a service like TinyUrl
|
|
|
1 listener
|
