|
1
|
|
|
|
Introduction
|
|
|
5 listeners
|
|
2
|
|
|
|
How to setup Sublime Text for Competitive Programming?
|
|
|
4 listeners
|
|
3
|
|
|
|
Code
|
|
|
3 listeners
|
|
4
|
|
|
|
Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course
|
|
|
2 listeners
|
|
5
|
|
|
|
How I Got into Google Warsaw As Software Engineer | Interview EXPERIENCE | Preparation Strategies
|
|
|
2 listeners
|
|
6
|
|
|
|
Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal
|
|
|
2 listeners
|
|
7
|
|
|
|
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
|
|
|
2 listeners
|
|
8
|
|
|
|
Don't watch my A2Z DSA Course
|
|
|
2 listeners
|
|
9
|
|
|
|
Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video
|
|
|
2 listeners
|
|
10
|
|
|
|
Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing
|
|
|
2 listeners
|
|
11
|
|
|
|
L21. Reverse Nodes in K Group Size of LinkedList
|
|
|
2 listeners
|
|
12
|
|
|
|
DP 28. Longest Palindromic Subsequence
|
|
|
2 listeners
|
|
13
|
|
|
|
DP 43. Longest Increasing Subsequence | Binary Search | Intuition
|
|
|
1 listener
|
|
14
|
|
|
|
Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal
|
|
|
1 listener
|
|
15
|
|
|
|
G-48. Number of Provinces - Disjoint Set
|
|
|
1 listener
|
|
16
|
|
|
|
Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro
|
|
|
1 listener
|
|
17
|
|
|
|
L6. Odd Even Linked List | Multiple Approaches
|
|
|
1 listener
|
|
18
|
|
|
|
L3. Longest Word With All Prefixes | Complete String | Trie
|
|
|
1 listener
|
|
19
|
|
|
|
G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java
|
|
|
1 listener
|
|
20
|
|
|
|
G-17. Bipartite Graph | BFS | C++ | Java
|
|
|
1 listener
|
|
21
|
|
|
|
G-20. Find Eventual Safe States - DFS
|
|
|
1 listener
|
|
22
|
|
|
|
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
|
|
|
1 listener
|
|
23
|
|
|
|
Example
|
|
|
1 listener
|
|
24
|
|
|
|
Pascal Triangle | Finding nCr in minimal time
|
|
|
1 listener
|
|
25
|
|
|
|
Rotten Oranges (BFS) | C++ & Java Code
|
|
|
1 listener
|
|
26
|
|
|
|
G-18. Bipartite Graph | DFS | C++ | Java
|
|
|
1 listener
|
|
27
|
|
|
|
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
|
|
|
1 listener
|
|
28
|
|
|
|
G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time
|
|
|
1 listener
|
|
29
|
|
|
|
Two Sum Problem | Leetcode's First Ever Problem
|
|
|
1 listener
|
|
30
|
|
|
|
L7. All Kind of Patterns in Recursion | Print All | Print one | Count
|
|
|
1 listener
|
|
31
|
|
|
|
L1. Introduction to LinkedList | Traversal | Length | Search an Element
|
|
|
1 listener
|
|
32
|
|
|
|
Question
|
|
|
1 listener
|
|
33
|
|
|
|
Count Inversions in an Array | Brute and Optimal
|
|
|
1 listener
|
|
34
|
|
|
|
How I bought MACBOOK without doing a job | How I paid college fees while studying | Fulfill Dreams
|
|
|
1 listener
|
|
35
|
|
|
|
Roadmap to learn Data-Structures and Algorithms!! How to start competitive Programming??
|
|
|
1 listener
|
|
36
|
|
|
|
🔴 Striver's SDE sheet | Take every concept from every problem in the sheet and be Placement Ready
|
|
|
1 listener
|
|
37
|
|
|
|
You Should Be Ashamed Of Yourselves !!
|
|
|
1 listener
|
|
38
|
|
|
|
Maximum Subarray Sum | Leetcode | Kadane's Algorithm | Brute-Better-Optimal | CPP/Java
|
|
|
1 listener
|
|
39
|
|
|
|
DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences
|
|
|
1 listener
|
|
40
|
|
|
|
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
|
|
|
1 listener
|
|
41
|
|
|
|
G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
|
|
|
1 listener
|
|
42
|
|
|
|
G-21. Topological Sort Algorithm | DFS
|
|
|
1 listener
|
|
43
|
|
|
|
G-51. Number of Islands - II - Online Queries - DSU
|
|
|
1 listener
|
|
44
|
|
|
|
4SUM | GOOGLE | AMAZON
|
|
|
1 listener
|
|
45
|
|
|
|
G-41. Bellman Ford Algorithm
|
|
|
1 listener
|
|
46
|
|
|
|
G-42. Floyd Warshall Algorithm
|
|
|
1 listener
|
|
47
|
|
|
|
G-9. Flood Fill Algorithm | C++ | Java
|
|
|
1 listener
|
|
48
|
|
|
|
DP 50. Minimum Cost to Cut the Stick
|
|
|
1 listener
|
|
49
|
|
|
|
L47. LCA in Binary Search Tree
|
|
|
1 listener
|
|
50
|
|
|
|
Demo
|
|
|
1 listener
|
