Udemy - Java Data Structures and Algorithms Masterclass (10.2024)

磁力链接/BT种子名称

Udemy - Java Data Structures and Algorithms Masterclass (10.2024)

磁力链接/BT种子简介

种子哈希：0b80cdcdda1a617b9fc7e8e9fb89c2bd3ceac850
文件大小： 5.73G
已经下载：10次
下载速度：极快
收录时间：2025-08-16
最近下载：2025-08-17

移花宫入口

移花宫.com邀月.com怜星.com花无缺.comyhgbt.icuyhgbt.top

磁力链接下载

magnet:?xt=urn:btih:0B80CDCDDA1A617B9FC7E8E9FB89C2BD3CEAC850
推荐使用PIKPAK网盘下载资源，10TB超大空间，不限制资源，无限次数离线下载，视频在线观看

下载BT种子文件

磁力链接 迅雷下载 PIKPAK在线播放 世界之窗 91视频 含羞草 欲漫涩 逼哩逼哩 成人快手 51品茶 抖阴破解版 极乐禁地 91短视频 TikTok成人版 PornHub 草榴社区 哆哔涩漫 呦乐园 萝莉岛

最近搜索

文件列表

  • 08. Linked List/8. Insertion Method in Singly Linked List.mp4 83.2 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/13. Solution - Animal Shelter.mp4 63.5 MB
  • 42. Greedy Algorithms/4. Activity Selection Problem in Java.mp4 55.1 MB
  • 25. AVL Tree/9. Insert a Node in AVL (Method in Practice).mp4 50.7 MB
  • 24. Binary Search Tree/9. Delete a Node in Binary Search Tree.mp4 48.9 MB
  • 22. Tree Binary Tree/15. Delete a Node in Binary Tree (Linked List).mp4 48.6 MB
  • 42. Greedy Algorithms/8. Fractional Knapsack Problem in Java.mp4 48.1 MB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/26. Rotate Matrix Image - LeetCode 48.mp4 45.8 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/3. Solution - Three in One.mp4 45.4 MB
  • 12. Doubly Linked List/4. Insertion Method Doubly Linked List.mp4 44.0 MB
  • 29. Sorting Algorithms/9. Quick Sort.mp4 43.9 MB
  • 29. Sorting Algorithms/7. Bucket Sort.mp4 42.8 MB
  • 17. Queue/8. Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array.mp4 42.3 MB
  • 17. Queue/3. Create, isFull, isEmpty and enQueue methods using Linear Queue Array.mp4 41.6 MB
  • 26. Binary Heap/4. Extract a Node from Binary Heap.mp4 40.8 MB
  • 15. Stack/8. Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List.mp4 40.5 MB
  • 06. ArrayList/4. Insertion in ArrayList.mp4 40.5 MB
  • 28. Hashing/10. Collision Resolution Technique - Open Addressing Double Hashing.mp4 38.3 MB
  • 01. Introduction/7. Slides in PDF.pdf 38.0 MB
  • 26. Binary Heap/2. Common Operations on Binary Heap.mp4 37.3 MB
  • 08. Linked List/12. Deletion Method in Singly Linked List.mp4 37.3 MB
  • 28. Hashing/7. Collision Resolution Technique - Linear Probing (Insert).mp4 37.3 MB
  • 22. Tree Binary Tree/14. Insert Method in Binary Tree (Linked List).mp4 36.3 MB
  • 17. Queue/9. Dequeue, Peek and Delete Methods in Circular Queue using Array.mp4 36.2 MB
  • 40. Kruskal and Prim's Algorithms/2. Kruskal Algorithm in Java.mp4 36.0 MB
  • 38. Floyd Warshall Algorithm/4. Floyd Warshall in Java.mp4 35.4 MB
  • 36. Bellman Ford Algorithm/4. Bellman Ford Algorithm Implementation in Java.mp4 34.5 MB
  • 19. Recursion/2. What is Recursion.mp4 34.1 MB
  • 29. Sorting Algorithms/10. Heap Sort.mp4 33.9 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/7. Solution Part 1 - Stack of Plates.mp4 33.7 MB
  • 22. Tree Binary Tree/9. PreOrder Traversal in Binary Tree using Linked List.mp4 33.6 MB
  • 13. Circular Doubly Linked List/10. Deletion Method in Circular Doubly Linked List.mp4 33.1 MB
  • 02. Big O Notation/1. What is Big O.mp4 33.0 MB
  • 28. Hashing/4. Types of Collision Resolution Techniques - Direct Chaining (Insert).mp4 32.5 MB
  • 27. Trie/5. Delete a String from Trie.mp4 32.5 MB
  • 25. AVL Tree/12. Delete a Node from AVL (Method in practice).mp4 32.1 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/2. Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.mp4 32.0 MB
  • 12. Doubly Linked List/10. Deletion Method in Doubly Linked List.mp4 32.0 MB
  • 13. Circular Doubly Linked List/4. Insertion Method Circular Doubly Linked List.mp4 32.0 MB
  • 17. Queue/4. Dequeue, Peek and Delete Methods using Linear Queue Array.mp4 31.9 MB
  • 24. Binary Search Tree/3. Insert a Node to Binary Search Tree.mp4 31.1 MB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/3. Solution to Route Between Nodes.mp4 31.1 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/11. Solution - Intersection.mp4 30.8 MB
  • 15. Stack/5. Stack Operations using Array (Push, Pop, Peek, Delete).mp4 30.2 MB
  • 17. Queue/12. Create, Enqueue and isEmpty Methods in Queue using Linked List.mp4 30.2 MB
  • 26. Binary Heap/3. Insert a Node in Binary Heap.mp4 30.1 MB
  • 47. A Recipe for Problem Solving/5. Step 4 - Solve or Simplify.mp4 29.9 MB
  • 03. Arrays/1. What is an Array.mp4 29.4 MB
  • 03. Arrays/12. Insertion - Two Dimensional Array.mp4 28.9 MB
  • 29. Sorting Algorithms/8. Merge Sort.mp4 28.8 MB
  • 31. Graphs/6. Graph in Java using Adjacency Matrix.mp4 28.5 MB
  • 30. Searching Algorithms/5. Binary Search in Java.mp4 28.0 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/3. Solution - Remove Dups.mp4 27.8 MB
  • 28. Hashing/5. Direct Chaining Implementation - (Search, Delete).mp4 27.5 MB
  • 08. Linked List/10. Searching in Singly Linked List.mp4 27.4 MB
  • 10. Circular Singly Linked List/4. Insertion Method Circular Singly Linked List.mp4 27.3 MB
  • 28. Hashing/8. Collision Resolution Technique - Linear Probing (Search, Delete).mp4 27.2 MB
  • 22. Tree Binary Tree/13. Search Method in Binary Tree (Linked List).mp4 27.1 MB
  • 47. A Recipe for Problem Solving/6. Step 5 - Look Back and Refactor.mp4 27.0 MB
  • 22. Tree Binary Tree/10. InOrder Traversal in Binary Tree using Linked List.mp4 26.9 MB
  • 35. Dijkstra's Algorithm/2. Dijkstra's Algorithm in Java - 1.mp4 26.9 MB
  • 29. Sorting Algorithms/4. Bubble Sort.mp4 26.8 MB
  • 27. Trie/3. Insert a String in Trie.mp4 26.6 MB
  • 17. Queue/13. Dequeue, Peek and Delete Methods in Queue using Linked List.mp4 26.4 MB
  • 39. Minimum Spanning Tree (Disjoint Set)/3. Disjoint Set in Java.mp4 26.4 MB
  • 28. Hashing/9. Collision Resolution Technique - Open Addressing Quadratic Probing.mp4 26.2 MB
  • 25. AVL Tree/8. Insert a Node in AVL (All Together).mp4 26.2 MB
  • 27. Trie/4. Search for a String in Trie.mp4 26.2 MB
  • 25. AVL Tree/3. Common Operations on AVL Tree.mp4 26.1 MB
  • 33. Topological Sort/3. Topological Sort using Adjacency List.mp4 26.0 MB
  • 12. Doubly Linked List/1. Create Doubly Linked List.mp4 26.0 MB
  • 10. Circular Singly Linked List/9. Deletion Method in Circular Singly Linked List.mp4 25.8 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/3. BFS for SSSPP in Java using Adjacency List.mp4 25.6 MB
  • 22. Tree Binary Tree/12. LevelOrder Traversal in Binary Tree using Linked List.mp4 25.5 MB
  • 45. Dynamic Programming/3. Top Down with Memoization.mp4 25.4 MB
  • 25. AVL Tree/4. Insert a Node in AVL (Left Left Condition).mp4 25.4 MB
  • 40. Kruskal and Prim's Algorithms/4. Prim's Algorithm in Java.mp4 25.2 MB
  • 29. Sorting Algorithms/6. Insertion Sort.mp4 24.7 MB
  • 20. Cracking Recursion Interview Questions/1. Question 1 - Sum of Digits.mp4 24.4 MB
  • 45. Dynamic Programming/7. Number Factor Problem using Dynamic Programming.mp4 24.3 MB
  • 17. Queue/7. Circular Queue Operations using Array.mp4 24.2 MB
  • 10. Circular Singly Linked List/1. Create Circular Singly Linked List.mp4 24.1 MB
  • 19. Recursion/7. How to Write Recursion in 3 Steps.mp4 24.0 MB
  • 20. Cracking Recursion Interview Questions/4. Question 4 - Decimal to Binary.mp4 24.0 MB
  • 20. Cracking Recursion Interview Questions/2. Question 2 - Power.mp4 23.9 MB
  • 36. Bellman Ford Algorithm/1. Bellman Ford Algorithm for SSSPP.mp4 23.5 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/9. Solution - Sum Lists.mp4 23.5 MB
  • 45. Dynamic Programming/4. Bottom Up with Tabulation.mp4 23.3 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/5. Solution - Stack Minimum.mp4 23.1 MB
  • 03. Arrays/5. Insertion in Array.mp4 22.9 MB
  • 03. Arrays/15. Searching Two Dimensional Array.mp4 22.9 MB
  • 13. Circular Doubly Linked List/1. Create Doubly Linked List.mp4 22.9 MB
  • 08. Linked List/5. Creation of Singly Linked List.mp4 22.8 MB
  • 06. ArrayList/8. Delete an Element for ArrayList.mp4 22.8 MB
  • 35. Dijkstra's Algorithm/3. Dijkstra's Algorithm in Java - 2.mp4 22.7 MB
  • 08. Linked List/9. Traversal of Singly Linked List.mp4 22.5 MB
  • 31. Graphs/7. Graph in Java using Adjacency List.mp4 22.5 MB
  • 03. Arrays/11. Create Two Dimensional Array.mp4 22.4 MB
  • 12. Doubly Linked List/6. Reverse Traversal of Doubly Linked List.mp4 22.4 MB
  • 45. Dynamic Programming/11. House Robber Problem using Dynamic Programming.mp4 22.4 MB
  • 03. Arrays/16. Delete Two Dimensional Array Element.mp4 21.7 MB
  • 10. Circular Singly Linked List/5. Traversal of Circular Singly Linked List.mp4 21.7 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/8. Solution Part 2 - Stack of Plates.mp4 21.6 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/1. Breadth First Search Algorithm (BFS).mp4 21.6 MB
  • 29. Sorting Algorithms/5. Selection Sort.mp4 21.5 MB
  • 33. Topological Sort/4. Topological Sort using Adjacency Matrix.mp4 21.5 MB
  • 02. Big O Notation/10. Space Complexity.mp4 21.5 MB
  • 13. Circular Doubly Linked List/5. Traversal of Circular Doubly Linked List.mp4 21.3 MB
  • 10. Circular Singly Linked List/6. Searching a Node in Circular Singly Linked List.mp4 21.1 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/11. Solution - Queue via Stacks.mp4 20.9 MB
  • 08. Linked List/3. Types of Linked List.mp4 20.7 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/7. Solution - Partition.mp4 20.7 MB
  • 22. Tree Binary Tree/4. Creating a Basic Tree in Java.mp4 20.5 MB
  • 22. Tree Binary Tree/11. PostOrder Traversal in Binary Tree using Linked List.mp4 20.2 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/1. Linked List Class.mp4 20.2 MB
  • 12. Doubly Linked List/7. Searching for a Node in Doubly Linked List.mp4 20.2 MB
  • 13. Circular Doubly Linked List/2. Insertion Circular Doubly Linked List.mp4 19.8 MB
  • 03. Arrays/13. Accessing Two Dimensional Array Element.mp4 19.8 MB
  • 13. Circular Doubly Linked List/8. Deletion in Circular Doubly Linked List.mp4 19.7 MB
  • 13. Circular Doubly Linked List/7. Search for a Node in Circular Doubly Linked List.mp4 19.5 MB
  • 48. Backtracking/4. N - Queens Problem.mp4 19.2 MB
  • 31. Graphs/5. Graph Representation.mp4 19.2 MB
  • 03. Arrays/7. Array Traversal.mp4 19.2 MB
  • 03. Arrays/14. Traverse Two Dimensional Array.mp4 18.7 MB
  • 08. Linked List/11. Deletion of a Node from Singly Linked List.mp4 18.5 MB
  • 25. AVL Tree/10. Delete a Node from AVL (LL, LR, RR, RR).mp4 18.4 MB
  • 27. Trie/1. What is a Trie Why we need Trie.mp4 18.4 MB
  • 12. Doubly Linked List/5. Traversal of Doubly Linked List.mp4 18.4 MB
  • 22. Tree Binary Tree/25. Delete Binary Tree (Array).mp4 18.3 MB
  • 13. Circular Doubly Linked List/6. Reverse Traversal of Circular Doubly Linked List.mp4 18.2 MB
  • 22. Tree Binary Tree/18. Insert Method Binary Tree (Array).mp4 18.2 MB
  • 19. Recursion/8. Fibonacci Series using Recursion.mp4 18.0 MB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/5. Solution - Return Nth to Last.mp4 18.0 MB
  • 12. Doubly Linked List/2. Insertion Doubly Linked List.mp4 17.9 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/9. Solution Part 3 - Follow UP.mp4 17.8 MB
  • 15. Stack/4. Stack Operations using Array (Create, isEmpty, isFull).mp4 17.7 MB
  • 48. Backtracking/1. What is Backtracking.mp4 17.6 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/4. BFS for SSSPP in Java using Adjacency Matrix.mp4 17.6 MB
  • 42. Greedy Algorithms/6. Coin Change Problem in Java.mp4 17.6 MB
  • 22. Tree Binary Tree/19. PreOrder Traversal Binary Tree (Array).mp4 17.6 MB
  • 33. Topological Sort/2. Topological Sort Algorithm.mp4 17.5 MB
  • 45. Dynamic Programming/10. Number Factor Top Down and Bottom Up.mp4 17.4 MB
  • 25. AVL Tree/5. Insert a Node in AVL (Left Right Condition).mp4 17.4 MB
  • 38. Floyd Warshall Algorithm/1. Floyd Warshall Algorithm.mp4 17.4 MB
  • 22. Tree Binary Tree/17. Create Binary Tree (Array).mp4 17.0 MB
  • 03. Arrays/8. Search for Array Element.mp4 17.0 MB
  • 24. Binary Search Tree/8. Search in Binary Search Tree.mp4 17.0 MB
  • 40. Kruskal and Prim's Algorithms/1. Kruskal Algorithm.mp4 17.0 MB
  • 26. Binary Heap/1. What is Binary Heap Why do we need Binary Heap.mp4 16.7 MB
  • 19. Recursion/4. The Logic Behind Recursion.mp4 16.6 MB
  • 43. Divide and Conquer Algorithms/9. Convert One String to Another in Java.mp4 16.5 MB
  • 04. PROJECT 1 - Arrays/3. Find the Days Above Average Temperature.mp4 16.5 MB
  • 03. Arrays/4. Create an Array.mp4 16.4 MB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/24. Solution - Permutation.mp4 16.4 MB
  • 06. ArrayList/7. Search for an Element in ArrayList.mp4 16.2 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/7. Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.mp4 16.1 MB
  • 22. Tree Binary Tree/23. Search Method Binary Tree (Array).mp4 16.1 MB
  • 08. Linked List/7. Insertion Algorithm in Singly Linked List.mp4 16.1 MB
  • 43. Divide and Conquer Algorithms/11. Zero One Knapsack Problem in Java.mp4 16.0 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/3. Breadth First Search Algorithm (BFS) in Java - Adjacency List.mp4 15.9 MB
  • 13. Circular Doubly Linked List/11. Delete Entire Circular Doubly Linked List.mp4 15.7 MB
  • 13. Circular Doubly Linked List/13. Time Complexity of Array vs Linked List.mp4 15.6 MB
  • 28. Hashing/3. Hash Functions.mp4 15.4 MB
  • 08. Linked List/1. What is a Linked List.mp4 15.4 MB
  • 12. Doubly Linked List/11. Delete Entire Doubly Linked List.mp4 15.2 MB
  • 47. A Recipe for Problem Solving/4. Step 3 - Break it Down.mp4 15.2 MB
  • 10. Circular Singly Linked List/7. Deletion of a Node from Circular Singly List.mp4 14.9 MB
  • 22. Tree Binary Tree/20. InOrder Traversal Binary Tree (Array).mp4 14.9 MB
  • 22. Tree Binary Tree/1. What is a Tree.mp4 14.9 MB
  • 13. Circular Doubly Linked List/3. Insertion Algorithm Circular Doubly Linked List.mp4 14.9 MB
  • 12. Doubly Linked List/8. Deletion of a Node in Doubly Linked List.mp4 14.8 MB
  • 06. ArrayList/6. Traversal of ArrayList.mp4 14.6 MB
  • 04. PROJECT 1 - Arrays/2. Calculate Average Temperature.mp4 14.6 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/6. Depth First Search (DFS) Algorithm in Java - Adjacency List.mp4 14.5 MB
  • 25. AVL Tree/1. What is an AVL Tree.mp4 14.5 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/5. Depth First Search (DFS) Algorithm.mp4 14.5 MB
  • 25. AVL Tree/6. Insert a Node in AVL (Right Right Condition).mp4 14.5 MB
  • 22. Tree Binary Tree/24. Delete a Node Binary Tree (Array).mp4 14.4 MB
  • 03. Arrays/2. Types of Arrays.mp4 14.4 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/2. Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP).mp4 14.3 MB
  • 25. AVL Tree/11. Delete a Node from ALL (All Together).mp4 14.3 MB
  • 19. Recursion/9. How to Measure Recursive Algorithm.mp4 14.2 MB
  • 43. Divide and Conquer Algorithms/6. House Robber.mp4 14.2 MB
  • 42. Greedy Algorithms/2. Known Greedy Algorithms.mp4 14.1 MB
  • 12. Doubly Linked List/3. Insertion Algorithm Doubly Linked List.mp4 14.1 MB
  • 17. Queue/2. Linear Queue Operations using Array.mp4 13.7 MB
  • 43. Divide and Conquer Algorithms/12. Longest Common Subsequence Problem.mp4 13.6 MB
  • 42. Greedy Algorithms/1. What is Greedy Algorithm.mp4 13.6 MB
  • 43. Divide and Conquer Algorithms/13. Longest Common Subsequence Problem in Java.mp4 13.5 MB
  • 13. Circular Doubly Linked List/9. Deletion Algorithm in Circular Doubly Linked List.mp4 13.5 MB
  • 10. Circular Singly Linked List/2. Insertion in Circular Singly Linked List.mp4 13.5 MB
  • 20. Cracking Recursion Interview Questions/3. Question 3 - GCD.mp4 13.4 MB
  • 22. Tree Binary Tree/22. levelOrder Traversal Binary Tree (Array).mp4 13.4 MB
  • 07. Cracking Big O Interview Questions - Arrays/7. Question 7 - Equivalent to O(N).mp4 13.3 MB
  • 36. Bellman Ford Algorithm/2. Bellman Ford Algorithm with Negative Cycle.mp4 13.2 MB
  • 30. Searching Algorithms/3. Linear Search in Java.mp4 13.1 MB
  • 02. Big O Notation/6. Big O - O(N^2).mp4 13.1 MB
  • 22. Tree Binary Tree/26. Array vs Linked List in Binary Tree Implementation.mp4 13.0 MB
  • 01. Introduction/1. Curriculum Walkthrough.mp4 12.9 MB
  • 39. Minimum Spanning Tree (Disjoint Set)/1. What is Minimum Spanning Tree.mp4 12.8 MB
  • 03. Arrays/9. Delete Array Element.mp4 12.8 MB
  • 43. Divide and Conquer Algorithms/14. Longest Palindromic Subsequence Problem.mp4 12.7 MB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/20. Solution - Max Product of Two Integers.mp4 12.7 MB
  • 25. AVL Tree/7. Insert a Node in AVL (Right Left Condition).mp4 12.6 MB
  • 43. Divide and Conquer Algorithms/1. What is a Divide and Conquer Algorithm.mp4 12.6 MB
  • 22. Tree Binary Tree/21. PostOrder Traversal Binary Tree (Array).mp4 12.6 MB
  • 17. Queue/1. What is a Queue.mp4 12.6 MB
  • 40. Kruskal and Prim's Algorithms/3. Prim's Algorithm.mp4 12.5 MB
  • 43. Divide and Conquer Algorithms/18. Number of Paths To Reach The Last Cell with Given Cost.mp4 12.5 MB
  • 31. Graphs/2. What is a Graph Why do we need Graph.mp4 12.5 MB
  • 43. Divide and Conquer Algorithms/15. Longest Palindromic Subsequence Problem in Java.mp4 12.4 MB
  • 07. Cracking Big O Interview Questions - Arrays/6. Question 6 - Time Complexity of Reverse Array Function.mp4 12.4 MB
  • 10. Circular Singly Linked List/10. Delete Entire Circular Singly Linked List.mp4 12.4 MB
  • 22. Tree Binary Tree/7. Binary Tree Representation.mp4 12.3 MB
  • 43. Divide and Conquer Algorithms/17. Minimum Cost to Reach Last Cell in Java.mp4 12.3 MB
  • 07. Cracking Big O Interview Questions - Arrays/1. Question 1 - Time Complexity of Method that returns Sum and Product of Array.mp4 12.2 MB
  • 19. Recursion/6. When to UseAvoid Recursion.mp4 12.2 MB
  • 38. Floyd Warshall Algorithm/2. Why Floyd Warshall Algorithm.mp4 12.1 MB
  • 43. Divide and Conquer Algorithms/19. Number of Paths To Reach The Last Cell with Given Cost in Java.mp4 12.1 MB
  • 47. A Recipe for Problem Solving/3. Step 2 - Examples.mp4 12.1 MB
  • 24. Binary Search Tree/7. Level Order Traversal Binary Search Tree.mp4 12.0 MB
  • 29. Sorting Algorithms/2. Types of Sorting.mp4 12.0 MB
  • 43. Divide and Conquer Algorithms/7. House Robber in Java.mp4 12.0 MB
  • 08. Linked List/13. Deletion of Entire Singly Linked List.mp4 12.0 MB
  • 07. Cracking Big O Interview Questions - Arrays/2. Question 2 - Time Complexity of Print Pairs Method.mp4 11.9 MB
  • 17. Queue/11. Queue Operations using Linked List.mp4 11.8 MB
  • 43. Divide and Conquer Algorithms/8. Convert One String to Another.mp4 11.7 MB
  • 42. Greedy Algorithms/7. Fractional Knapsack Problem.mp4 11.7 MB
  • 47. A Recipe for Problem Solving/2. Step 1 - Understand the Problem.mp4 11.6 MB
  • 45. Dynamic Programming/16. Convert one string to another using Dynamic Programming.mp4 11.6 MB
  • 37. All Pairs Shortest Path Problem/1. What is All Pairs Shortest Path Problem.mp4 11.6 MB
  • 12. Doubly Linked List/12. Time and Space Complexity of Doubly Linked List.mp4 11.5 MB
  • 10. Circular Singly Linked List/11. Time and Space Complexity of Circular Singly Linked List.mp4 11.4 MB
  • 02. Big O Notation/5. Drop Constants.mp4 11.4 MB
  • 12. Doubly Linked List/9. Deletion Algorithm Doubly Linked List.mp4 11.2 MB
  • 30. Searching Algorithms/6. Time Complexity of Binary Search.mp4 11.1 MB
  • 43. Divide and Conquer Algorithms/10. Zero One Knapsack Problem.mp4 11.0 MB
  • 43. Divide and Conquer Algorithms/4. Number Factor.mp4 10.9 MB
  • 22. Tree Binary Tree/8. Create Binary Tree using Linked List.mp4 10.9 MB
  • 27. Trie/2. Common Operations on a Trie (Creation).mp4 10.8 MB
  • 24. Binary Search Tree/4. PreOrder Traversal Binary Search Tree.mp4 10.8 MB
  • 42. Greedy Algorithms/3. Activity Selection Problem.mp4 10.8 MB
  • 24. Binary Search Tree/6. PostOrder Traversal Binary Search Tree.mp4 10.7 MB
  • 06. ArrayList/3. Creating ArrayList.mp4 10.6 MB
  • 35. Dijkstra's Algorithm/1. Dijkstra's Algorithm for SSSPP.mp4 10.6 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/1. What is Single Source Shortest Path Problem.mp4 10.5 MB
  • 31. Graphs/3. Graph Terminology.mp4 10.5 MB
  • 43. Divide and Conquer Algorithms/16. Minimum Cost to Reach Last Cell.mp4 10.3 MB
  • 45. Dynamic Programming/1. What is Dynamic Programming (Overlapping property).mp4 10.3 MB
  • 01. Introduction/3. What is an algorithm.mp4 10.3 MB
  • 03. Arrays/6. Accessing Elements in Array.mp4 10.2 MB
  • 26. Binary Heap/6. Time and Space Complexity of Binary Heap.mp4 10.1 MB
  • 22. Tree Binary Tree/3. Tree Terminology.mp4 10.0 MB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/18. Solution - Finding a Number in an Array.mp4 10.0 MB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/22. Solution - IsUnique Contains Duplicate - LeetCode 217.mp4 10.0 MB
  • 13. Circular Doubly Linked List/12. Time and Space Complexity of Circular Doubly Linked List.mp4 9.9 MB
  • 24. Binary Search Tree/5. InOrder Traversal Binary Search Tree.mp4 9.8 MB
  • 10. Circular Singly Linked List/8. Deletion Algorithm in Circular Singly Linked List.mp4 9.8 MB
  • 43. Divide and Conquer Algorithms/5. Number Factor in Java.mp4 9.8 MB
  • 10. Circular Singly Linked List/3. Insertion Algorithm in Circular Singly Linked List.mp4 9.7 MB
  • 15. Stack/7. Stack Operations using Linked List.mp4 9.6 MB
  • 31. Graphs/4. Types of Graph.mp4 9.6 MB
  • 28. Hashing/2. Hashing Terminology.mp4 9.5 MB
  • 36. Bellman Ford Algorithm/5. BFS vs Dijkstra vs Bellman Ford.mp4 9.3 MB
  • 43. Divide and Conquer Algorithms/2. Common Divide and Conquer Algorithms.mp4 9.2 MB
  • 28. Hashing/1. What is Hashing Why we need it.mp4 9.1 MB
  • 45. Dynamic Programming/2. Where Does the Name of DP Come From.mp4 9.0 MB
  • 29. Sorting Algorithms/3. Sorting Terminology.mp4 9.0 MB
  • 43. Divide and Conquer Algorithms/3. How to solve Fibonacci series using Divide and Conquer approach.mp4 8.9 MB
  • 48. Backtracking/2. Backtracking vs Brute Force.mp4 8.7 MB
  • 01. Introduction/4. Why are Data Structures and Algorithms important.mp4 8.7 MB
  • 02. Big O Notation/8. Big O - O(logN).mp4 8.7 MB
  • 45. Dynamic Programming/6. Is Merge Sort Dynamic Programming.mp4 8.6 MB
  • 15. Stack/2. Stack Operations.mp4 8.5 MB
  • 15. Stack/1. What and Why of Stack.mp4 8.5 MB
  • 28. Hashing/12. Practical Use of Hashing.mp4 8.4 MB
  • 28. Hashing/11. Pros and Cons of Resolution Techniques.mp4 8.4 MB
  • 24. Binary Search Tree/2. Create Binary Search Tree.mp4 8.3 MB
  • 22. Tree Binary Tree/16. Delet Entire Binary Tree (Linked List).mp4 8.3 MB
  • 19. Recursion/10. How to Measure Recursive Algorithm with Multiple Calls.mp4 8.1 MB
  • 08. Linked List/14. Time and Space Complexity of Singly Linked List.mp4 8.0 MB
  • 07. Cracking Big O Interview Questions - Arrays/3. Question 3 - Time Complexity of Print Unordered Pairs Method.mp4 8.0 MB
  • 36. Bellman Ford Algorithm/3. Why Bellman Ford runs V-1 times.mp4 7.9 MB
  • 37. All Pairs Shortest Path Problem/2. Dry Run for All Pairs Shortest Path Problem.mp4 7.7 MB
  • 06. ArrayList/2. ArrayList in Memory.mp4 7.6 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/9. BFS Traversal vs DFS Traversal.mp4 7.6 MB
  • 45. Dynamic Programming/5. Top Down vs Bottom Up.mp4 7.4 MB
  • 42. Greedy Algorithms/5. Coin Change Problem.mp4 7.4 MB
  • 33. Topological Sort/5. Time and Space Complexity of Topological Sort.mp4 7.3 MB
  • 17. Queue/6. Why Circular Queue.mp4 7.3 MB
  • 19. Recursion/5. Recursive vs Iterative Solution.mp4 7.3 MB
  • 06. ArrayList/9. Time and Space Complexity of ArrayList.mp4 7.3 MB
  • 38. Floyd Warshall Algorithm/5. BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall Algorithms.mp4 7.2 MB
  • 02. Big O Notation/11. How to Measure the Code using Big O.mp4 7.2 MB
  • 03. Arrays/10. Time and Space Complexity of 1D Arrays.mp4 7.1 MB
  • 02. Big O Notation/3. Big O - O(1).mp4 7.1 MB
  • 26. Binary Heap/5. Delete Entire Binary Heap.mp4 7.1 MB
  • 02. Big O Notation/9. Add vs Multiply.mp4 7.0 MB
  • 28. Hashing/6. Hash Table is Full.mp4 6.9 MB
  • 25. AVL Tree/2. Why Do We Need AVL Tree.mp4 6.9 MB
  • 03. Arrays/17. Time and Space Complexity of 2D Arrays.mp4 6.8 MB
  • 17. Queue/10. Time and Space Complexity of Circular Queue using Array.mp4 6.8 MB
  • 02. Big O Notation/2. Big O Notations - (Big O, Big Omega, Big Theta).mp4 6.7 MB
  • 24. Binary Search Tree/11. Time and Space Complexity of BST.mp4 6.6 MB
  • 17. Queue/5. Time and Space Complexity of Linear Queue using Array.mp4 6.6 MB
  • 35. Dijkstra's Algorithm/4. Dijkstra's Algorithm with Negative Cycle.mp4 6.6 MB
  • 08. Linked List/6. Insertion in Singly Linked List in Memory.mp4 6.6 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/4. Time Complexity of Breadth First Search (BFS) Algorithm.mp4 6.5 MB
  • 40. Kruskal and Prim's Algorithms/5. Kruskal vs Prim's Algorithms.mp4 6.4 MB
  • 19. Recursion/3. Why do we need Recursion.mp4 6.3 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/6. Why does BFS not work with Weighted Graph.mp4 6.3 MB
  • 24. Binary Search Tree/1. What is a Binary Search Tree Why do we need it.mp4 6.2 MB
  • 08. Linked List/2. Linked List vs Array.mp4 6.1 MB
  • 01. Introduction/6. Types of Algorithms.mp4 6.1 MB
  • 08. Linked List/4. Linked List in the Memory.mp4 6.0 MB
  • 22. Tree Binary Tree/6. Types of Binary Tree.mp4 6.0 MB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/8. Time Complexity of Depth First Search (DFS) Algorithm.mp4 5.9 MB
  • 06. ArrayList/5. Accessing Elements in ArrayList.mp4 5.9 MB
  • 24. Binary Search Tree/10. Delete BST.mp4 5.8 MB
  • 03. Arrays/3. Arrays in Memory.mp4 5.7 MB
  • 15. Stack/9. Time and Space Complexity of Stack using Linked List.mp4 5.7 MB
  • 33. Topological Sort/1. What is Topological Sort.mp4 5.6 MB
  • 29. Sorting Algorithms/1. What is Sorting.mp4 5.6 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/5. Time and Space Complexity of BFS for SSSPP.mp4 5.6 MB
  • 47. A Recipe for Problem Solving/1. Introduction.mp4 5.6 MB
  • 01. Introduction/2. What is a data structure.mp4 5.5 MB
  • 02. Big O Notation/4. Big O - O(N).mp4 5.4 MB
  • 25. AVL Tree/14. Time and Space Complexity of AVL.mp4 5.3 MB
  • 02. Big O Notation/7. Drop Non Dominant Terms.mp4 5.2 MB
  • 17. Queue/14. Time and Space Complexity of Queue using Linked List.mp4 5.2 MB
  • 22. Tree Binary Tree/5. What is A Binary Tree.mp4 5.1 MB
  • 39. Minimum Spanning Tree (Disjoint Set)/2. What is Disjoint Set.mp4 5.1 MB
  • 06. ArrayList/1. What is ArrayList.mp4 5.0 MB
  • 25. AVL Tree/15. Binary Search Tree vs AVL.mp4 4.8 MB
  • 17. Queue/15. Array vs Linked List Implementation.mp4 4.7 MB
  • 15. Stack/6. Time and Space Complexity of Stack using Array.mp4 4.7 MB
  • 01. Introduction/5. Types of Data Structures.mp4 4.6 MB
  • 30. Searching Algorithms/2. Linear Search.mp4 4.4 MB
  • 19. Recursion/1. Goals what you will learn by the end of this section.mp4 4.3 MB
  • 34. Single Source Shortest Path Problem (SSSPP)/7. Why does DFS not work for SSSP.mp4 4.2 MB
  • 30. Searching Algorithms/4. Binary Search.mp4 4.1 MB
  • 25. AVL Tree/13. Delete Entire AVL Tree.mp4 4.1 MB
  • 04. PROJECT 1 - Arrays/1. Goals - what you will make by the end of this section.mp4 4.0 MB
  • 07. Cracking Big O Interview Questions - Arrays/4. Question 4 - Find Time Complexity for Given Method.mp4 3.9 MB
  • 22. Tree Binary Tree/2. Why Tree.mp4 3.8 MB
  • 28. Hashing/13. Hashing vs Other DS.mp4 3.7 MB
  • 38. Floyd Warshall Algorithm/3. Floyd Warshall with Negative Cycle.mp4 3.7 MB
  • 27. Trie/6. Practical Uses of Trie.mp4 3.6 MB
  • 03. Arrays/18. When to UseAvoid Arrays.mp4 3.3 MB
  • 15. Stack/10. When to UseAvoid Stack.mp4 3.1 MB
  • 30. Searching Algorithms/1. Introduction To Search Algorithms.mp4 2.9 MB
  • 17. Queue/16. When to UseAvoid Queue.mp4 2.7 MB
  • 31. Graphs/1. What you will learn.mp4 2.7 MB
  • 07. Cracking Big O Interview Questions - Arrays/5. Question 5 - Find Time Complexity for Given Method.mp4 2.6 MB
  • 29. Sorting Algorithms/11. Comparison of Sorting Algorithms.mp4 2.6 MB
  • 15. Stack/3. Stack using Array vs Linked List.mp4 2.1 MB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/1. Goals.mp4 2.1 MB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/1. Introduction.mp4 1.3 MB
  • 49. My Other Courses/1. 2022-09-19_03-35-29-ce599a442a028e15029b84bfb65c08a3.PNG 976.6 kB
  • 49. My Other Courses/1. 2022-07-17_11-31-33-20027cd28fd6b9ecf4d19d19fb9b102b.png 339.2 kB
  • 49. My Other Courses/1. 2022-02-21_02-48-03-32d380eebea44c02e173209b32c6c0b8.png 314.1 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/13. Solution - Animal Shelter.vtt 38.5 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/3. Solution - Three in One.vtt 35.7 kB
  • 29. Sorting Algorithms/9. Quick Sort.vtt 33.4 kB
  • 22. Tree Binary Tree/15. Delete a Node in Binary Tree (Linked List).vtt 32.1 kB
  • 29. Sorting Algorithms/7. Bucket Sort.vtt 30.3 kB
  • 26. Binary Heap/4. Extract a Node from Binary Heap.vtt 28.3 kB
  • 17. Queue/8. Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array.vtt 27.5 kB
  • 26. Binary Heap/2. Common Operations on Binary Heap.vtt 27.3 kB
  • 29. Sorting Algorithms/10. Heap Sort.vtt 26.6 kB
  • 15. Stack/8. Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List.vtt 26.5 kB
  • 24. Binary Search Tree/9. Delete a Node in Binary Search Tree.vtt 26.2 kB
  • 02. Big O Notation/12.1 Big O Quiz.html 24.7 kB
  • 28. Hashing/7. Collision Resolution Technique - Linear Probing (Insert).vtt 24.3 kB
  • 27. Trie/5. Delete a String from Trie.vtt 24.1 kB
  • 42. Greedy Algorithms/4. Activity Selection Problem in Java.vtt 24.1 kB
  • 08. Linked List/12. Deletion Method in Singly Linked List.vtt 24.1 kB
  • 29. Sorting Algorithms/4. Bubble Sort.vtt 23.7 kB
  • 40. Kruskal and Prim's Algorithms/2. Kruskal Algorithm in Java.vtt 22.1 kB
  • 42. Greedy Algorithms/8. Fractional Knapsack Problem in Java.vtt 22.0 kB
  • 17. Queue/3. Create, isFull, isEmpty and enQueue methods using Linear Queue Array.vtt 21.7 kB
  • 08. Linked List/8. Insertion Method in Singly Linked List.vtt 21.5 kB
  • 29. Sorting Algorithms/8. Merge Sort.vtt 21.4 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/7. Solution Part 1 - Stack of Plates.vtt 21.3 kB
  • 12. Doubly Linked List/4. Insertion Method Doubly Linked List.vtt 21.0 kB
  • 27. Trie/3. Insert a String in Trie.vtt 20.7 kB
  • 15. Stack/12.2 Stack Quiz.html 20.6 kB
  • 13. Circular Doubly Linked List/4. Insertion Method Circular Doubly Linked List.vtt 20.4 kB
  • 25. AVL Tree/12. Delete a Node from AVL (Method in practice).vtt 20.3 kB
  • 12. Doubly Linked List/1. Create Doubly Linked List.vtt 20.3 kB
  • 22. Tree Binary Tree/14. Insert Method in Binary Tree (Linked List).vtt 19.9 kB
  • 25. AVL Tree/4. Insert a Node in AVL (Left Left Condition).vtt 19.8 kB
  • 29. Sorting Algorithms/6. Insertion Sort.vtt 19.8 kB
  • 10. Circular Singly Linked List/1. Create Circular Singly Linked List.vtt 19.6 kB
  • 17. Queue/9. Dequeue, Peek and Delete Methods in Circular Queue using Array.vtt 19.5 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/5. Solution - Stack Minimum.vtt 19.5 kB
  • 12. Doubly Linked List/10. Deletion Method in Doubly Linked List.vtt 19.4 kB
  • 25. AVL Tree/3. Common Operations on AVL Tree.vtt 19.1 kB
  • 30. Searching Algorithms/5. Binary Search in Java.vtt 18.8 kB
  • 19. Recursion/7. How to Write Recursion in 3 Steps.vtt 18.7 kB
  • 28. Hashing/10. Collision Resolution Technique - Open Addressing Double Hashing.vtt 18.5 kB
  • 15. Stack/5. Stack Operations using Array (Push, Pop, Peek, Delete).vtt 18.5 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/26. Rotate Matrix Image - LeetCode 48.vtt 18.3 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. AnimalShelter.zip 18.2 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/11. Solution - Queue via Stacks.vtt 18.2 kB
  • 24. Binary Search Tree/3. Insert a Node to Binary Search Tree.vtt 18.2 kB
  • 48. Backtracking/3.3 Backtracking Quiz.html 18.1 kB
  • 27. Trie/4. Search for a String in Trie.vtt 18.1 kB
  • 13. Circular Doubly Linked List/1. Create Doubly Linked List.vtt 18.1 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/11. Solution - Intersection.vtt 18.0 kB
  • 13. Circular Doubly Linked List/10. Deletion Method in Circular Doubly Linked List.vtt 18.0 kB
  • 45. Dynamic Programming/7. Number Factor Problem using Dynamic Programming.vtt 17.9 kB
  • 22. Tree Binary Tree/9. PreOrder Traversal in Binary Tree using Linked List.vtt 17.8 kB
  • 10. Circular Singly Linked List/4. Insertion Method Circular Singly Linked List.vtt 17.7 kB
  • 03. Arrays/5. Insertion in Array.vtt 17.5 kB
  • 35. Dijkstra's Algorithm/2. Dijkstra's Algorithm in Java - 1.vtt 17.5 kB
  • 31. Graphs/6. Graph in Java using Adjacency Matrix.vtt 17.3 kB
  • 17. Queue/4. Dequeue, Peek and Delete Methods using Linear Queue Array.vtt 17.0 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. StackofPlates.zip 16.9 kB
  • 10. Circular Singly Linked List/9. Deletion Method in Circular Singly Linked List.vtt 16.7 kB
  • 38. Floyd Warshall Algorithm/4. Floyd Warshall in Java.vtt 16.6 kB
  • 17. Queue/13. Dequeue, Peek and Delete Methods in Queue using Linked List.vtt 16.5 kB
  • 45. Dynamic Programming/3. Top Down with Memoization.vtt 16.3 kB
  • 17. Queue/12. Create, Enqueue and isEmpty Methods in Queue using Linked List.vtt 16.3 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/3. Solution - Remove Dups.vtt 16.1 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/2. Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.vtt 16.1 kB
  • 13. Circular Doubly Linked List/8. Deletion in Circular Doubly Linked List.vtt 15.9 kB
  • 29. Sorting Algorithms/5. Selection Sort.vtt 15.8 kB
  • 08. Linked List/3. Types of Linked List.vtt 15.7 kB
  • 39. Minimum Spanning Tree (Disjoint Set)/3. Disjoint Set in Java.vtt 15.7 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/8. Solution Part 2 - Stack of Plates.vtt 15.7 kB
  • 22. Tree Binary Tree/13. Search Method in Binary Tree (Linked List).vtt 15.7 kB
  • 33. Topological Sort/3. Topological Sort using Adjacency List.vtt 15.6 kB
  • 47. A Recipe for Problem Solving/5. Step 4 - Solve or Simplify.vtt 15.5 kB
  • 03. Arrays/11. Create Two Dimensional Array.vtt 15.5 kB
  • 27. Trie/1. What is a Trie Why we need Trie.vtt 15.4 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/9. Solution - Sum Lists.vtt 15.3 kB
  • 13. Circular Doubly Linked List/2. Insertion Circular Doubly Linked List.vtt 15.3 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/3. BFS for SSSPP in Java using Adjacency List.vtt 15.2 kB
  • 36. Bellman Ford Algorithm/4. Bellman Ford Algorithm Implementation in Java.vtt 15.1 kB
  • 25. AVL Tree/10. Delete a Node from AVL (LL, LR, RR, RR).vtt 15.0 kB
  • 45. Dynamic Programming/11. House Robber Problem using Dynamic Programming.vtt 15.0 kB
  • 10. Circular Singly Linked List/6. Searching a Node in Circular Singly Linked List.vtt 14.9 kB
  • 36. Bellman Ford Algorithm/1. Bellman Ford Algorithm for SSSPP.vtt 14.9 kB
  • 03. Arrays/12. Insertion - Two Dimensional Array.vtt 14.9 kB
  • 08. Linked List/5. Creation of Singly Linked List.vtt 14.8 kB
  • 10. Circular Singly Linked List/5. Traversal of Circular Singly Linked List.vtt 14.7 kB
  • 08. Linked List/9. Traversal of Singly Linked List.vtt 14.6 kB
  • 22. Tree Binary Tree/12. LevelOrder Traversal in Binary Tree using Linked List.vtt 14.6 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/3. Solution to Route Between Nodes.vtt 14.5 kB
  • 13. Circular Doubly Linked List/7. Search for a Node in Circular Doubly Linked List.vtt 14.4 kB
  • 12. Doubly Linked List/2. Insertion Doubly Linked List.vtt 14.3 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/1. Linked List Class.vtt 14.1 kB
  • 19. Recursion/4. The Logic Behind Recursion.vtt 13.9 kB
  • 40. Kruskal and Prim's Algorithms/4. Prim's Algorithm in Java.vtt 13.8 kB
  • 19. Recursion/8. Fibonacci Series using Recursion.vtt 13.8 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/7. Solution - Partition.vtt 13.7 kB
  • 22. Tree Binary Tree/10. InOrder Traversal in Binary Tree using Linked List.vtt 13.7 kB
  • 08. Linked List/10. Searching in Singly Linked List.vtt 13.6 kB
  • 22. Tree Binary Tree/4. Creating a Basic Tree in Java.vtt 13.6 kB
  • 28. Hashing/9. Collision Resolution Technique - Open Addressing Quadratic Probing.vtt 13.6 kB
  • 48. Backtracking/1. What is Backtracking.vtt 13.5 kB
  • 12. Doubly Linked List/7. Searching for a Node in Doubly Linked List.vtt 13.4 kB
  • 06. ArrayList/4. Insertion in ArrayList.vtt 13.4 kB
  • 31. Graphs/7. Graph in Java using Adjacency List.vtt 13.3 kB
  • 08. Linked List/11. Deletion of a Node from Singly Linked List.vtt 13.3 kB
  • 28. Hashing/3. Hash Functions.vtt 13.3 kB
  • 10. Circular Singly Linked List/7. Deletion of a Node from Circular Singly List.vtt 13.3 kB
  • 31. Graphs/5. Graph Representation.vtt 13.2 kB
  • 40. Kruskal and Prim's Algorithms/1. Kruskal Algorithm.vtt 13.2 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/5. Solution - Return Nth to Last.vtt 13.1 kB
  • 48. Backtracking/4. N - Queens Problem.vtt 13.0 kB
  • 03. Arrays/4. Create an Array.vtt 13.0 kB
  • 20. Cracking Recursion Interview Questions/1. Question 1 - Sum of Digits.vtt 13.0 kB
  • 03. Arrays/15. Searching Two Dimensional Array.vtt 12.9 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. QueueviaStacks.zip 12.9 kB
  • 33. Topological Sort/2. Topological Sort Algorithm.vtt 12.7 kB
  • 13. Circular Doubly Linked List/5. Traversal of Circular Doubly Linked List.vtt 12.6 kB
  • 28. Hashing/8. Collision Resolution Technique - Linear Probing (Search, Delete).vtt 12.6 kB
  • 12. Doubly Linked List/8. Deletion of a Node in Doubly Linked List.vtt 12.5 kB
  • 17. Queue/7. Circular Queue Operations using Array.vtt 12.4 kB
  • 13. Circular Doubly Linked List/6. Reverse Traversal of Circular Doubly Linked List.vtt 12.4 kB
  • 12. Doubly Linked List/5. Traversal of Doubly Linked List.vtt 12.3 kB
  • 15. Stack/4. Stack Operations using Array (Create, isEmpty, isFull).vtt 12.3 kB
  • 25. AVL Tree/6. Insert a Node in AVL (Right Right Condition).vtt 12.1 kB
  • 12. Doubly Linked List/6. Reverse Traversal of Doubly Linked List.vtt 12.1 kB
  • 45. Dynamic Programming/10. Number Factor Top Down and Bottom Up.vtt 12.1 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/24. Solution - Permutation.vtt 12.1 kB
  • 22. Tree Binary Tree/18. Insert Method Binary Tree (Array).vtt 12.0 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/12.57 BuildOrder.html 12.0 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/9. Solution Part 3 - Follow UP.vtt 11.9 kB
  • 17. Queue/11. Queue Operations using Linked List.vtt 11.9 kB
  • 38. Floyd Warshall Algorithm/1. Floyd Warshall Algorithm.vtt 11.9 kB
  • 42. Greedy Algorithms/6. Coin Change Problem in Java.vtt 11.9 kB
  • 01. Introduction/1. Curriculum Walkthrough.vtt 11.8 kB
  • 24. Binary Search Tree/8. Search in Binary Search Tree.vtt 11.8 kB
  • 13. Circular Doubly Linked List/11. Delete Entire Circular Doubly Linked List.vtt 11.6 kB
  • 02. Big O Notation/10. Space Complexity.vtt 11.6 kB
  • 47. A Recipe for Problem Solving/6. Step 5 - Look Back and Refactor.vtt 11.5 kB
  • 22. Tree Binary Tree/19. PreOrder Traversal Binary Tree (Array).vtt 11.4 kB
  • 25. AVL Tree/1. What is an AVL Tree.vtt 11.4 kB
  • 20. Cracking Recursion Interview Questions/4. Question 4 - Decimal to Binary.vtt 11.4 kB
  • 22. Tree Binary Tree/11. PostOrder Traversal in Binary Tree using Linked List.vtt 11.4 kB
  • 22. Tree Binary Tree/7. Binary Tree Representation.vtt 11.3 kB
  • 35. Dijkstra's Algorithm/3. Dijkstra's Algorithm in Java - 2.vtt 11.3 kB
  • 03. Arrays/8. Search for Array Element.vtt 11.2 kB
  • 08. Linked List/7. Insertion Algorithm in Singly Linked List.vtt 11.2 kB
  • 26. Binary Heap/1. What is Binary Heap Why do we need Binary Heap.vtt 11.1 kB
  • 43. Divide and Conquer Algorithms/9. Convert One String to Another in Java.vtt 11.1 kB
  • 42. Greedy Algorithms/2. Known Greedy Algorithms.vtt 11.1 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/4. BFS for SSSPP in Java using Adjacency Matrix.vtt 11.0 kB
  • 47. A Recipe for Problem Solving/4. Step 3 - Break it Down.vtt 11.0 kB
  • 22. Tree Binary Tree/23. Search Method Binary Tree (Array).vtt 11.0 kB
  • 28. Hashing/5. Direct Chaining Implementation - (Search, Delete).vtt 10.9 kB
  • 03. Arrays/7. Array Traversal.vtt 10.9 kB
  • 12. Doubly Linked List/11. Delete Entire Doubly Linked List.vtt 10.8 kB
  • 10. Circular Singly Linked List/2. Insertion in Circular Singly Linked List.vtt 10.8 kB
  • 22. Tree Binary Tree/17. Create Binary Tree (Array).vtt 10.8 kB
  • 17. Queue/2. Linear Queue Operations using Array.vtt 10.8 kB
  • 25. AVL Tree/11. Delete a Node from ALL (All Together).vtt 10.8 kB
  • 13. Circular Doubly Linked List/13. Time Complexity of Array vs Linked List.vtt 10.7 kB
  • 22. Tree Binary Tree/1. What is a Tree.vtt 10.7 kB
  • 13. Circular Doubly Linked List/3. Insertion Algorithm Circular Doubly Linked List.vtt 10.7 kB
  • 33. Topological Sort/4. Topological Sort using Adjacency Matrix.vtt 10.6 kB
  • 03. Arrays/1. What is an Array.vtt 10.6 kB
  • 03. Arrays/14. Traverse Two Dimensional Array.vtt 10.5 kB
  • 43. Divide and Conquer Algorithms/11. Zero One Knapsack Problem in Java.vtt 10.5 kB
  • 03. Arrays/13. Accessing Two Dimensional Array Element.vtt 10.4 kB
  • 19. Recursion/9. How to Measure Recursive Algorithm.vtt 10.4 kB
  • 45. Dynamic Programming/4. Bottom Up with Tabulation.vtt 10.4 kB
  • 15. Stack/7. Stack Operations using Linked List.vtt 10.4 kB
  • 13. Circular Doubly Linked List/9. Deletion Algorithm in Circular Doubly Linked List.vtt 10.3 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/5. Depth First Search (DFS) Algorithm.vtt 10.3 kB
  • 30. Searching Algorithms/3. Linear Search in Java.vtt 10.3 kB
  • 16. Stack Coding Exercises/8. SolutionExplanation and TimeSpace Complexity of Balanced Parentheses Checker.html 10.2 kB
  • 22. Tree Binary Tree/24. Delete a Node Binary Tree (Array).vtt 10.0 kB
  • 04. PROJECT 1 - Arrays/2. Calculate Average Temperature.vtt 10.0 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/2. Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP).vtt 10.0 kB
  • 25. AVL Tree/7. Insert a Node in AVL (Right Left Condition).vtt 10.0 kB
  • 43. Divide and Conquer Algorithms/6. House Robber.vtt 9.8 kB
  • 43. Divide and Conquer Algorithms/1. What is a Divide and Conquer Algorithm.vtt 9.8 kB
  • 22. Tree Binary Tree/20. InOrder Traversal Binary Tree (Array).vtt 9.8 kB
  • 04. PROJECT 1 - Arrays/3. Find the Days Above Average Temperature.vtt 9.7 kB
  • 15. Stack/2. Stack Operations.vtt 9.7 kB
  • 12. Doubly Linked List/3. Insertion Algorithm Doubly Linked List.vtt 9.7 kB
  • 03. Arrays/2. Types of Arrays.vtt 9.7 kB
  • 10. Circular Singly Linked List/10. Delete Entire Circular Singly Linked List.vtt 9.6 kB
  • 43. Divide and Conquer Algorithms/2. Common Divide and Conquer Algorithms.vtt 9.6 kB
  • 43. Divide and Conquer Algorithms/13. Longest Common Subsequence Problem in Java.vtt 9.6 kB
  • 03. Arrays/16. Delete Two Dimensional Array Element.vtt 9.5 kB
  • 47. A Recipe for Problem Solving/3. Step 2 - Examples.vtt 9.4 kB
  • 43. Divide and Conquer Algorithms/7. House Robber in Java.vtt 9.4 kB
  • 17. Queue/1. What is a Queue.vtt 9.3 kB
  • 20. Cracking Recursion Interview Questions/3. Question 3 - GCD.vtt 9.3 kB
  • 43. Divide and Conquer Algorithms/12. Longest Common Subsequence Problem.vtt 9.3 kB
  • 19. Recursion/6. When to UseAvoid Recursion.vtt 9.3 kB
  • 09. Linked List Coding Exercises/9.18 Singly Linked List - Rotate.html 9.3 kB
  • 22. Tree Binary Tree/26. Array vs Linked List in Binary Tree Implementation.vtt 9.2 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/3. Breadth First Search Algorithm (BFS) in Java - Adjacency List.vtt 9.2 kB
  • 12. Doubly Linked List/9. Deletion Algorithm Doubly Linked List.vtt 9.1 kB
  • 22. Tree Binary Tree/22. levelOrder Traversal Binary Tree (Array).vtt 9.0 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/7. Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.vtt 8.9 kB
  • 08. Linked List/13. Deletion of Entire Singly Linked List.vtt 8.9 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/6. Depth First Search (DFS) Algorithm in Java - Adjacency List.vtt 8.9 kB
  • 22. Tree Binary Tree/8. Create Binary Tree using Linked List.vtt 8.9 kB
  • 43. Divide and Conquer Algorithms/15. Longest Palindromic Subsequence Problem in Java.vtt 8.8 kB
  • 11. Circular Singly Linked List CODING EXERCISES/3.22 Delete a Node from a Circular Singly Linked List.html 8.7 kB
  • 35. Dijkstra's Algorithm/1. Dijkstra's Algorithm for SSSPP.vtt 8.7 kB
  • 22. Tree Binary Tree/21. PostOrder Traversal Binary Tree (Array).vtt 8.7 kB
  • 43. Divide and Conquer Algorithms/8. Convert One String to Another.vtt 8.7 kB
  • 09. Linked List Coding Exercises/11.19 Singly Linked List - Set.html 8.7 kB
  • 29. Sorting Algorithms/2. Types of Sorting.vtt 8.6 kB
  • 07. Cracking Big O Interview Questions - Arrays/2. Question 2 - Time Complexity of Print Pairs Method.vtt 8.6 kB
  • 10. Circular Singly Linked List/11. Time and Space Complexity of Circular Singly Linked List.vtt 8.6 kB
  • 47. A Recipe for Problem Solving/2. Step 1 - Understand the Problem.vtt 8.6 kB
  • 03. Arrays/9. Delete Array Element.vtt 8.5 kB
  • 09. Linked List Coding Exercises/5.16 Singly Linked List - Insert.html 8.5 kB
  • 08. Linked List/1. What is a Linked List.vtt 8.4 kB
  • 07. Cracking Big O Interview Questions - Arrays/6. Question 6 - Time Complexity of Reverse Array Function.vtt 8.3 kB
  • 43. Divide and Conquer Algorithms/19. Number of Paths To Reach The Last Cell with Given Cost in Java.vtt 8.3 kB
  • 20. Cracking Recursion Interview Questions/2. Question 2 - Power.vtt 8.3 kB
  • 27. Trie/2. Common Operations on a Trie (Creation).vtt 8.3 kB
  • 12. Doubly Linked List/12. Time and Space Complexity of Doubly Linked List.vtt 8.3 kB
  • 10. Circular Singly Linked List/8. Deletion Algorithm in Circular Singly Linked List.vtt 8.2 kB
  • 43. Divide and Conquer Algorithms/14. Longest Palindromic Subsequence Problem.vtt 8.2 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/20. Solution - Max Product of Two Integers.vtt 8.2 kB
  • 43. Divide and Conquer Algorithms/4. Number Factor.vtt 8.2 kB
  • 06. ArrayList/6. Traversal of ArrayList.vtt 8.1 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/6.35 Stack of Plates.html 8.1 kB
  • 07. Cracking Big O Interview Questions - Arrays/1. Question 1 - Time Complexity of Method that returns Sum and Product of Array.vtt 8.1 kB
  • 24. Binary Search Tree/7. Level Order Traversal Binary Search Tree.vtt 8.1 kB
  • 03. Arrays/6. Accessing Elements in Array.vtt 8.0 kB
  • 31. Graphs/4. Types of Graph.vtt 8.0 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/18. Solution - Finding a Number in an Array.vtt 7.9 kB
  • 28. Hashing/1. What is Hashing Why we need it.vtt 7.9 kB
  • 02. Big O Notation/8. Big O - O(logN).vtt 7.9 kB
  • 45. Dynamic Programming/16. Convert one string to another using Dynamic Programming.vtt 7.9 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/14.58 Find Common Ancestor.html 7.9 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/12.37 Animal Shelter.html 7.8 kB
  • 06. ArrayList/7. Search for an Element in ArrayList.vtt 7.8 kB
  • 26. Binary Heap/6. Time and Space Complexity of Binary Heap.vtt 7.8 kB
  • 42. Greedy Algorithms/1. What is Greedy Algorithm.vtt 7.8 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/10.28 Intersection.html 7.8 kB
  • 02. Big O Notation/1. What is Big O.vtt 7.7 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/22. Solution - IsUnique Contains Duplicate - LeetCode 217.vtt 7.7 kB
  • 43. Divide and Conquer Algorithms/5. Number Factor in Java.vtt 7.7 kB
  • 15. Stack/1. What and Why of Stack.vtt 7.6 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/10.56 Successor.html 7.5 kB
  • 06. ArrayList/3. Creating ArrayList.vtt 7.5 kB
  • 24. Binary Search Tree/4. PreOrder Traversal Binary Search Tree.vtt 7.5 kB
  • 43. Divide and Conquer Algorithms/18. Number of Paths To Reach The Last Cell with Given Cost.vtt 7.5 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/6.54 Check Balanced.html 7.5 kB
  • 22. Tree Binary Tree/3. Tree Terminology.vtt 7.4 kB
  • 30. Searching Algorithms/6. Time Complexity of Binary Search.vtt 7.4 kB
  • 43. Divide and Conquer Algorithms/16. Minimum Cost to Reach Last Cell.vtt 7.3 kB
  • 40. Kruskal and Prim's Algorithms/3. Prim's Algorithm.vtt 7.3 kB
  • 23. Coding Exercises TreeBinary Tree/6.51 Post-Order Traversal (Iterative).html 7.3 kB
  • 13. Circular Doubly Linked List/12. Time and Space Complexity of Circular Doubly Linked List.vtt 7.2 kB
  • 42. Greedy Algorithms/3. Activity Selection Problem.vtt 7.2 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/2.52 Route Between Nodes.html 7.2 kB
  • 17. Queue/6. Why Circular Queue.vtt 7.1 kB
  • 09. Linked List Coding Exercises/13.20 Singly Linked List - Remove.html 7.1 kB
  • 11. Circular Singly Linked List CODING EXERCISES/4. Solution - Delete a Node from a Circular Singly Linked List.html 7.1 kB
  • 23. Coding Exercises TreeBinary Tree/2.49 In-Order Traversal (Iterative).html 7.1 kB
  • 09. Linked List Coding Exercises/7.17 Singly Linked List - Get.html 7.0 kB
  • 43. Divide and Conquer Algorithms/10. Zero One Knapsack Problem.vtt 7.0 kB
  • 24. Binary Search Tree/2. Create Binary Search Tree.vtt 7.0 kB
  • 45. Dynamic Programming/17.66 Convert One String to Another using Top Down Approach.html 7.0 kB
  • 45. Dynamic Programming/19.67 Convert One String to Another using Bottom Up Approach.html 7.0 kB
  • 31. Graphs/3. Graph Terminology.vtt 7.0 kB
  • 06. ArrayList/8. Delete an Element for ArrayList.vtt 6.9 kB
  • 45. Dynamic Programming/1. What is Dynamic Programming (Overlapping property).vtt 6.9 kB
  • 19. Recursion/2. What is Recursion.vtt 6.9 kB
  • 11. Circular Singly Linked List CODING EXERCISES/5.23 Count the Number of Nodes.html 6.9 kB
  • 10. Circular Singly Linked List/3. Insertion Algorithm in Circular Singly Linked List.vtt 6.9 kB
  • 43. Divide and Conquer Algorithms/17. Minimum Cost to Reach Last Cell in Java.vtt 6.9 kB
  • 36. Bellman Ford Algorithm/2. Bellman Ford Algorithm with Negative Cycle.vtt 6.9 kB
  • 11. Circular Singly Linked List CODING EXERCISES/1.21 Implement a Circular Singly Linked List.html 6.9 kB
  • 28. Hashing/11. Pros and Cons of Resolution Techniques.vtt 6.9 kB
  • 29. Sorting Algorithms/3. Sorting Terminology.vtt 6.9 kB
  • 11. Circular Singly Linked List CODING EXERCISES/2. Solution - Implement a Circular Singly Linked List.html 6.8 kB
  • 24. Binary Search Tree/5. InOrder Traversal Binary Search Tree.vtt 6.7 kB
  • 09. Linked List Coding Exercises/3.15 Singly Linked List - Pop.html 6.7 kB
  • 42. Greedy Algorithms/7. Fractional Knapsack Problem.vtt 6.7 kB
  • 28. Hashing/6. Hash Table is Full.vtt 6.7 kB
  • 23. Coding Exercises TreeBinary Tree/4.50 Pre-Order Traversal (Iterative).html 6.6 kB
  • 43. Divide and Conquer Algorithms/3. How to solve Fibonacci series using Divide and Conquer approach.vtt 6.6 kB
  • 07. Cracking Big O Interview Questions - Arrays/3. Question 3 - Time Complexity of Print Unordered Pairs Method.vtt 6.6 kB
  • 09. Linked List Coding Exercises/1.14 Singly Linked List - Push.html 6.5 kB
  • 16. Stack Coding Exercises/2. Solution and Explanation - Implement Stack Class.html 6.5 kB
  • 08. Linked List/14. Time and Space Complexity of Singly Linked List.vtt 6.4 kB
  • 46. CHALLENGING Dynamic Programming Problems/8.71 Longest Common Subsequence.html 6.4 kB
  • 16. Stack Coding Exercises/3.30 Push Method.html 6.4 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/8.27 Sum Lists.html 6.4 kB
  • 17. Queue/10. Time and Space Complexity of Circular Queue using Array.vtt 6.4 kB
  • 28. Hashing/2. Hashing Terminology.vtt 6.4 kB
  • 39. Minimum Spanning Tree (Disjoint Set)/1. What is Minimum Spanning Tree.vtt 6.4 kB
  • 16. Stack Coding Exercises/7.32 Balanced Parentheses Checker.html 6.3 kB
  • 02. Big O Notation/2. Big O Notations - (Big O, Big Omega, Big Theta).vtt 6.3 kB
  • 03. Arrays/10. Time and Space Complexity of 1D Arrays.vtt 6.3 kB
  • 31. Graphs/2. What is a Graph Why do we need Graph.vtt 6.3 kB
  • 48. Backtracking/2. Backtracking vs Brute Force.vtt 6.3 kB
  • 45. Dynamic Programming/6. Is Merge Sort Dynamic Programming.vtt 6.3 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/9. BFS Traversal vs DFS Traversal.vtt 6.3 kB
  • 45. Dynamic Programming/5. Top Down vs Bottom Up.vtt 6.3 kB
  • 03. Arrays/17. Time and Space Complexity of 2D Arrays.vtt 6.3 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/1. What is Single Source Shortest Path Problem.vtt 6.2 kB
  • 44. Divide and Conquer CODING EXERCISES/5.61 Divide and Conquer - findRotatedIndex.html 6.1 kB
  • 16. Stack Coding Exercises/5.31 Pop Method.html 6.1 kB
  • 06. ArrayList/2. ArrayList in Memory.vtt 6.1 kB
  • 25. AVL Tree/2. Why Do We Need AVL Tree.vtt 6.1 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/6.26 Partition.html 6.1 kB
  • 46. CHALLENGING Dynamic Programming Problems/10.72 Longest Palindromic Subsequence using Top Down Approach.html 6.1 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/2.24 Remove Dups.html 6.0 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/8.55 Validate BST.html 6.0 kB
  • 48. Backtracking/5. N - Queens problem in Java.html 6.0 kB
  • 19. Recursion/10. How to Measure Recursive Algorithm with Multiple Calls.vtt 6.0 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/4.53 Minimal Tree.html 5.9 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/6. Solution to Best Score.html 5.9 kB
  • 38. Floyd Warshall Algorithm/2. Why Floyd Warshall Algorithm.vtt 5.9 kB
  • 23. Coding Exercises TreeBinary Tree/7. Solution to Post-Order Traversal (Iterative) Time and Space Complexity.html 5.9 kB
  • 24. Binary Search Tree/6. PostOrder Traversal Binary Search Tree.vtt 5.9 kB
  • 23. Coding Exercises TreeBinary Tree/1.48 Implement Binary Tree.html 5.9 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/4.25 Return Nth to Last.html 5.9 kB
  • 22. Tree Binary Tree/6. Types of Binary Tree.vtt 5.9 kB
  • 30. Searching Algorithms/2. Linear Search.vtt 5.9 kB
  • 46. CHALLENGING Dynamic Programming Problems/4.69 Longest Common Subsequence Length problem using Top Down Approach.html 5.8 kB
  • 17. Queue/5. Time and Space Complexity of Linear Queue using Array.vtt 5.8 kB
  • 08. Linked List/4. Linked List in the Memory.vtt 5.8 kB
  • 01. Introduction/6. Types of Algorithms.vtt 5.8 kB
  • 03. Arrays/3. Arrays in Memory.vtt 5.8 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/10. Solution to Duplicate Number.html 5.8 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/2.33 Three in One.html 5.8 kB
  • 24. Binary Search Tree/11. Time and Space Complexity of BST.vtt 5.7 kB
  • 42. Greedy Algorithms/5. Coin Change Problem.vtt 5.7 kB
  • 19. Recursion/5. Recursive vs Iterative Solution.vtt 5.7 kB
  • 46. CHALLENGING Dynamic Programming Problems/12.73 Longest Palindromic Subsequence using Bottom Up Approach.html 5.7 kB
  • 45. Dynamic Programming/8.62 Number Factor Top Down Approach.html 5.7 kB
  • 45. Dynamic Programming/9.63 Number Factor Bottom Up Approach.html 5.6 kB
  • 02. Big O Notation/6. Big O - O(N^2).vtt 5.6 kB
  • 45. Dynamic Programming/14.65 House Robber Bottom Up Approach.html 5.6 kB
  • 45. Dynamic Programming/12.64 House Robber Top Down Approach.html 5.6 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/25.13 Rotate Matrix.html 5.6 kB
  • 25. AVL Tree/16. AVL.java 5.6 kB
  • 28. Hashing/12. Practical Use of Hashing.vtt 5.6 kB
  • 02. Big O Notation/5. Drop Constants.vtt 5.6 kB
  • 08. Linked List/2. Linked List vs Array.vtt 5.5 kB
  • 37. All Pairs Shortest Path Problem/1. What is All Pairs Shortest Path Problem.vtt 5.5 kB
  • 16. Stack Coding Exercises/1.29 Implement Stack.html 5.4 kB
  • 44. Divide and Conquer CODING EXERCISES/3.60 Divide and Conquer - sortedFrequency.html 5.3 kB
  • 37. All Pairs Shortest Path Problem/2. Dry Run for All Pairs Shortest Path Problem.vtt 5.3 kB
  • 46. CHALLENGING Dynamic Programming Problems/14.74 Longest Palindromic Substring.html 5.3 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/12. Solution to Remove Duplicates from Sorted Array - LeetCode 26.html 5.3 kB
  • 21. Bonus CHALLENGING Recursion Problems/10.45 someRecursive.html 5.3 kB
  • 01. Introduction/4. Why are Data Structures and Algorithms important.vtt 5.3 kB
  • 01. Introduction/3. What is an algorithm.vtt 5.3 kB
  • 46. CHALLENGING Dynamic Programming Problems/6.70 Longest Common Subsequence Length problem using Bottom Up Approach.html 5.2 kB
  • 15. Stack/9. Time and Space Complexity of Stack using Linked List.vtt 5.2 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/13.7 Best Time to Buy and Sell Stock - LeetCode 121.html 5.2 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/15.8 Two Sum - LeetCode 1.html 5.1 kB
  • 21. Bonus CHALLENGING Recursion Problems/9.44 isPalindrome.html 5.1 kB
  • 24. Binary Search Tree/1. What is a Binary Search Tree Why do we need it.vtt 5.1 kB
  • 08. Linked List/6. Insertion in Singly Linked List in Memory.vtt 5.1 kB
  • 17. Queue/14. Time and Space Complexity of Queue using Linked List.vtt 5.1 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/5.3 Best Score.html 5.1 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/9.5 Duplicate Number.html 5.1 kB
  • 40. Kruskal and Prim's Algorithms/5. Kruskal vs Prim's Algorithms.vtt 5.0 kB
  • 46. CHALLENGING Dynamic Programming Problems/2.68 Longest repeated Subsequence Length problem.html 5.0 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/7.4 Missing Number.html 5.0 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/1.1 Middle Function.html 5.0 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/23.12 Permutation.html 5.0 kB
  • 35. Dijkstra's Algorithm/4. Dijkstra's Algorithm with Negative Cycle.vtt 4.9 kB
  • 23. Coding Exercises TreeBinary Tree/3. Solution to In-Order Traversal (Iterative) Time and Space Complexity.html 4.9 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/11.6 Remove Duplicates from Sorted Array - LeetCode 26.html 4.9 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/19.10 Max Product of Two Integers.html 4.9 kB
  • 22. Tree Binary Tree/25. Delete Binary Tree (Array).vtt 4.9 kB
  • 44. Divide and Conquer CODING EXERCISES/1.59 Divide and Conquer - countZeroes.html 4.9 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/4.34 Stack Minimum.html 4.8 kB
  • 36. Bellman Ford Algorithm/3. Why Bellman Ford runs V-1 times.vtt 4.8 kB
  • 25. AVL Tree/14. Time and Space Complexity of AVL.vtt 4.8 kB
  • 23. Coding Exercises TreeBinary Tree/5. Solution to Pre-Order Traversal (Iterative) Time and Space Complexity.html 4.8 kB
  • 01. Introduction/2. What is a data structure.vtt 4.8 kB
  • 07. Cracking Big O Interview Questions - Arrays/7. Question 7 - Equivalent to O(N).vtt 4.8 kB
  • 21. Bonus CHALLENGING Recursion Problems/6.42 fib.html 4.8 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/10.36 Queue via Stacks.html 4.8 kB
  • 01. Introduction/5. Types of Data Structures.vtt 4.7 kB
  • 21. Bonus CHALLENGING Recursion Problems/3.39 factorial.html 4.7 kB
  • 21. Bonus CHALLENGING Recursion Problems/12.47 capitalizeWord.html 4.7 kB
  • 19. Recursion/3. Why do we need Recursion.vtt 4.7 kB
  • 33. Topological Sort/5. Time and Space Complexity of Topological Sort.vtt 4.7 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/21.11 IsUnique Contains Duplicate - LeetCode 217.html 4.7 kB
  • 21. Bonus CHALLENGING Recursion Problems/4.40 product of Array.html 4.6 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/3.2 2D Arrays.html 4.6 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/4. Time Complexity of Breadth First Search (BFS) Algorithm.vtt 4.6 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/6. Why does BFS not work with Weighted Graph.vtt 4.6 kB
  • 21. Bonus CHALLENGING Recursion Problems/8.43 reverse.html 4.6 kB
  • 21. Bonus CHALLENGING Recursion Problems/2.38 power.html 4.6 kB
  • 21. Bonus CHALLENGING Recursion Problems/5.41 recursiveRange.html 4.6 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/17.9 Finding a Number in an Array.html 4.6 kB
  • 36. Bellman Ford Algorithm/5. BFS vs Dijkstra vs Bellman Ford.vtt 4.5 kB
  • 21. Bonus CHALLENGING Recursion Problems/11.46 First Uppercase.html 4.5 kB
  • 02. Big O Notation/11. How to Measure the Code using Big O.vtt 4.5 kB
  • 22. Tree Binary Tree/5. What is A Binary Tree.vtt 4.5 kB
  • 25. AVL Tree/15. Binary Search Tree vs AVL.vtt 4.4 kB
  • 22. Tree Binary Tree/27. BinaryTreeLL.java 4.4 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/2. Solution to Middle Function.html 4.3 kB
  • 02. Big O Notation/9. Add vs Multiply.vtt 4.3 kB
  • 30. Searching Algorithms/4. Binary Search.vtt 4.3 kB
  • 22. Tree Binary Tree/16. Delet Entire Binary Tree (Linked List).vtt 4.3 kB
  • 29. Sorting Algorithms/1. What is Sorting.vtt 4.3 kB
  • 24. Binary Search Tree/10. Delete BST.vtt 4.3 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/8. Solution to Missing Number.html 4.3 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/8. Time Complexity of Depth First Search (DFS) Algorithm.vtt 4.3 kB
  • 15. Stack/6. Time and Space Complexity of Stack using Array.vtt 4.2 kB
  • 06. ArrayList/1. What is ArrayList.vtt 4.2 kB
  • 47. A Recipe for Problem Solving/1. Introduction.vtt 4.2 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/5. Time and Space Complexity of BFS for SSSPP.vtt 4.1 kB
  • 04. PROJECT 1 - Arrays/1. Goals - what you will make by the end of this section.vtt 4.0 kB
  • 33. Topological Sort/1. What is Topological Sort.vtt 4.0 kB
  • 06. ArrayList/9. Time and Space Complexity of ArrayList.vtt 4.0 kB
  • 02. Big O Notation/3. Big O - O(1).vtt 3.9 kB
  • 03. Arrays/18. When to UseAvoid Arrays.vtt 3.9 kB
  • 39. Minimum Spanning Tree (Disjoint Set)/2. What is Disjoint Set.vtt 3.9 kB
  • 11. Circular Singly Linked List CODING EXERCISES/6. Solution to Count the Number of Nodes.html 3.9 kB
  • 22. Tree Binary Tree/2. Why Tree.vtt 3.8 kB
  • 26. Binary Heap/5. Delete Entire Binary Heap.vtt 3.7 kB
  • 02. Big O Notation/4. Big O - O(N).vtt 3.7 kB
  • 13. Circular Doubly Linked List/14. CircularDoublyLinkedList.java 3.7 kB
  • 17. Queue/15. Array vs Linked List Implementation.vtt 3.7 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/8. SSSPP.zip 3.7 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/14. Solution to Best Time to Buy and Sell Stock - LeetCode 121.html 3.6 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/16. Solution to Two Sum - LeetCode 1.html 3.6 kB
  • 12. Doubly Linked List/13. DoublyLinkedList.java 3.6 kB
  • 29. Sorting Algorithms/12. BinaryHeap.java 3.6 kB
  • 16. Stack Coding Exercises/4. Solution and Explanation - Push Method.html 3.5 kB
  • 06. ArrayList/5. Accessing Elements in ArrayList.vtt 3.3 kB
  • 24. Binary Search Tree/12. BinarySearchTree.java 3.3 kB
  • 25. AVL Tree/13. Delete Entire AVL Tree.vtt 3.3 kB
  • 02. Big O Notation/7. Drop Non Dominant Terms.vtt 3.3 kB
  • 09. Linked List Coding Exercises/12. Solution to Singly Linked List - Set.html 3.3 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/13. Solution to Build Order.html 3.2 kB
  • 07. Cracking Big O Interview Questions - Arrays/4. Question 4 - Find Time Complexity for Given Method.vtt 3.1 kB
  • 26. Binary Heap/7. BinaryHeap.java 3.1 kB
  • 45. Dynamic Programming/2. Where Does the Name of DP Come From.vtt 3.1 kB
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/4. Solution to 2D Arrays.html 3.1 kB
  • 15. Stack/10. When to UseAvoid Stack.vtt 3.1 kB
  • 38. Floyd Warshall Algorithm/3. Floyd Warshall with Negative Cycle.vtt 3.1 kB
  • 33. Topological Sort/6. TopologicalSort.zip 3.0 kB
  • 34. Single Source Shortest Path Problem (SSSPP)/7. Why does DFS not work for SSSP.vtt 3.0 kB
  • 16. Stack Coding Exercises/6. SolutionExplanation and TimeSpace Complexity - Pop Method.html 3.0 kB
  • 17. Queue/16. When to UseAvoid Queue.vtt 3.0 kB
  • 30. Searching Algorithms/7. Searching.zip 3.0 kB
  • 36. Bellman Ford Algorithm/6. WeightedGraph.java 2.9 kB
  • 10. Circular Singly Linked List/12. CircularSinglyLinkedList.java 2.9 kB
  • 09. Linked List Coding Exercises/10. Solution to Singly Linked List - Rotate.html 2.9 kB
  • 27. Trie/6. Practical Uses of Trie.vtt 2.9 kB
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/12. Questions.java 2.8 kB
  • 31. Graphs/8. Archive.zip 2.8 kB
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/10. Archive.zip 2.8 kB
  • 28. Hashing/14. Hashing-Quadratic-Probing.zip 2.8 kB
  • 28. Hashing/14. Hashing-Linear-Probing.zip 2.8 kB
  • 08. Linked List/15. SinglyLinkedList.java 2.8 kB
  • 15. Stack/11. LinkedList.java 2.8 kB
  • 17. Queue/17. LinkedList.java 2.8 kB
  • 28. Hashing/13. Hashing vs Other DS.vtt 2.8 kB
  • 28. Hashing/14. DoubleHashing.zip 2.8 kB
  • 28. Hashing/14. Hashing-DirectChaining.zip 2.6 kB
  • 30. Searching Algorithms/1. Introduction To Search Algorithms.vtt 2.5 kB
  • 27. Trie/7. Trie.java 2.4 kB
  • 45. Dynamic Programming/18. Solution to Convert One String to Another using Top Down Approach.html 2.4 kB
  • 45. Dynamic Programming/20. Solution to Convert One String to Another using Bottom Up Approach.html 2.4 kB
  • 09. Linked List Coding Exercises/6. Solution to Singly Linked List - Insert.html 2.4 kB
  • 22. Tree Binary Tree/27. BinaryTree.java 2.3 kB
  • 31. Graphs/1. What you will learn.vtt 2.2 kB
  • 15. Stack/3. Stack using Array vs Linked List.vtt 2.2 kB
  • 07. Cracking Big O Interview Questions - Arrays/5. Question 5 - Find Time Complexity for Given Method.vtt 2.2 kB
  • 03. Arrays/19. TwoDimensionalArray.java 2.1 kB
  • 40. Kruskal and Prim's Algorithms/6. Prims.java 2.1 kB
  • 29. Sorting Algorithms/11. Comparison of Sorting Algorithms.vtt 2.1 kB
  • 17. Queue/17. CircularQueue.java 2.0 kB
  • 21. Bonus CHALLENGING Recursion Problems/13. SOLUTIONS PART 2.html 1.9 kB
  • 38. Floyd Warshall Algorithm/6. FloydWarshall.java 1.9 kB
  • 17. Queue/17. QueueArray.java 1.7 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/1. Goals.vtt 1.6 kB
  • 03. Arrays/19. SingleDimensionArray.java 1.6 kB
  • 29. Sorting Algorithms/12. BucketSort.java 1.6 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. ThreeInOne.java 1.5 kB
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/3. ThreeInOne.java 1.5 kB
  • 46. CHALLENGING Dynamic Programming Problems/9. Solution to Longest Common Subsequence.html 1.5 kB
  • 09. Linked List Coding Exercises/8. Solution to Singly Linked List - Get.html 1.5 kB
  • 35. Dijkstra's Algorithm/5. WeightedGraph.java 1.5 kB
  • 40. Kruskal and Prim's Algorithms/6. Kruskal.java 1.4 kB
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/5. Solution to Minimal Tree.html 1.4 kB
  • 46. CHALLENGING Dynamic Programming Problems/11. Solution to Longest Palindromic Subsequence using Top Down Approach.html 1.4 kB
  • 19. Recursion/1. Goals what you will learn by the end of this section.vtt 1.4 kB
  • 49. My Other Courses/1. Bonus Lecture.html 1.4 kB
  • 09. Linked List Coding Exercises/14. Solution to Singly Linked List - Remove.html 1.3 kB
  • 39. Minimum Spanning Tree (Disjoint Set)/4. DisjointSet.java 1.3 kB
  • 15. Stack/11. StackArray.java 1.3 kB
  • 09. Linked List Coding Exercises/4. Solution to Singly Linked List - Pop.html 1.2 kB
  • 46. CHALLENGING Dynamic Programming Problems/5. Solution to Longest Common Subsequence Length problem using Top Down Approach.html 1.2 kB
  • 44. Divide and Conquer CODING EXERCISES/6. Solution to Divide and Conquer - findRotatedIndex.html 1.2 kB
  • 42. Greedy Algorithms/9. FractionalKnapsack.java 1.1 kB
  • 29. Sorting Algorithms/12. MergeSort.java 1.1 kB
  • 21. Bonus CHALLENGING Recursion Problems/7. SOLUTIONS PART 1.html 1.1 kB
  • 45. Dynamic Programming/13. Solution to House Robber Top Down Approach.html 1.0 kB
  • 45. Dynamic Programming/15. Solution to House Robber Bottom Up Approach.html 1.0 kB
  • 17. Queue/17. QueueLinkedList.java 1.0 kB
  • 15. Stack/11. StackLinkedList.java 966 Bytes
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/9. Solution to Validate BST.html 947 Bytes
  • 46. CHALLENGING Dynamic Programming Problems/13. Solution to Longest Palindromic Subsequence using Bottom Up Approach.html 931 Bytes
  • 42. Greedy Algorithms/9. KnapsackItem.java 892 Bytes
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/1. Introduction.vtt 871 Bytes
  • 42. Greedy Algorithms/9. ActivitySelection.java 860 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. rotateMatrix.java 857 Bytes
  • 44. Divide and Conquer CODING EXERCISES/4. Solution to Divide and Conquer - sortedFrequency.html 856 Bytes
  • 46. CHALLENGING Dynamic Programming Problems/15. Solution to Longest Palindromic Substring.html 842 Bytes
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/12. LinkedList.java 809 Bytes
  • 04. PROJECT 1 - Arrays/4. ArrayProject.java 802 Bytes
  • 42. Greedy Algorithms/9. Activity.java 792 Bytes
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/7. Solution to Check Balanced.html 784 Bytes
  • 09. Linked List Coding Exercises/2. Solution to Singly Linked List - Push.html 724 Bytes
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/11. Solution to Successor.html 711 Bytes
  • 29. Sorting Algorithms/12. QuickSort.java 701 Bytes
  • 43. Divide and Conquer Algorithms/20. ConvertOneStringToAnother.java 700 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. permutation.java 696 Bytes
  • 39. Minimum Spanning Tree (Disjoint Set)/4. WeightedNode.java 685 Bytes
  • 43. Divide and Conquer Algorithms/20. NumberOfPathsToReachLastCell.java 684 Bytes
  • 35. Dijkstra's Algorithm/5. WeightedNode.java 658 Bytes
  • 36. Bellman Ford Algorithm/6. WeightedNode.java 658 Bytes
  • 38. Floyd Warshall Algorithm/6. WeightedNode.java 658 Bytes
  • 43. Divide and Conquer Algorithms/20. LongestPalindormicSubsequence.java 649 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. maxProduct.java 646 Bytes
  • 43. Divide and Conquer Algorithms/20. ZeroOneKnapsack.java 641 Bytes
  • 46. CHALLENGING Dynamic Programming Problems/3. Solution to Longest repeated Subsequence Length problem.html 610 Bytes
  • 46. CHALLENGING Dynamic Programming Problems/7. Solution to Longest Common Subsequence Length problem using Bottom Up Approach.html 598 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. twosum.java 556 Bytes
  • 29. Sorting Algorithms/12. SelectionSort.java 540 Bytes
  • 43. Divide and Conquer Algorithms/20. LongestCommonSubsequence.java 531 Bytes
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. StackMin.java 523 Bytes
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/5. StackMin.java 523 Bytes
  • 43. Divide and Conquer Algorithms/20. HouseRobber.java 520 Bytes
  • 22. Tree Binary Tree/27. TreeNode.java 477 Bytes
  • 42. Greedy Algorithms/9. CoinChangeProblem.java 469 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. isunique.java 467 Bytes
  • 29. Sorting Algorithms/12. BubbleSort.java 467 Bytes
  • 41. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)/15. Solution to Find Common Ancestor.html 464 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. findanumber.java 462 Bytes
  • 29. Sorting Algorithms/12. HeapSort.java 460 Bytes
  • 43. Divide and Conquer Algorithms/20. MinCostToReachLastCell.java 427 Bytes
  • 44. Divide and Conquer CODING EXERCISES/2. Solution to Divide and Conquer - countZeroes.html 424 Bytes
  • 08. Linked List/15. MainSinglyLinkedList.java 421 Bytes
  • 29. Sorting Algorithms/12. InsertionSort.java 419 Bytes
  • 20. Cracking Recursion Interview Questions/5. Question2.java 362 Bytes
  • 19. Recursion/11. RecrusionFibonacci.java 332 Bytes
  • 20. Cracking Recursion Interview Questions/5. Question3.java 329 Bytes
  • 20. Cracking Recursion Interview Questions/5. Question4.java 329 Bytes
  • 46. CHALLENGING Dynamic Programming Problems/1. NOTE ON THIS SECTION.html 322 Bytes
  • 19. Recursion/11. Recursion.java 317 Bytes
  • 20. Cracking Recursion Interview Questions/5. question1.java 310 Bytes
  • 10. Circular Singly Linked List/12. MainCircularSinglyLinkedList.java 309 Bytes
  • 13. Circular Doubly Linked List/14. MainCircularDoublyLinkedList.java 308 Bytes
  • 43. Divide and Conquer Algorithms/20. NumberFactor.java 306 Bytes
  • 21. Bonus CHALLENGING Recursion Problems/1. Important Note!.html 297 Bytes
  • 12. Doubly Linked List/13. MainDoublyLinkedList.java 277 Bytes
  • 03. Arrays/19. Download Resources.html 269 Bytes
  • 04. PROJECT 1 - Arrays/4. Download Resources.html 269 Bytes
  • 05. Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions/27. Download Resources.html 269 Bytes
  • 08. Linked List/15. Download Resources.html 269 Bytes
  • 10. Circular Singly Linked List/12. Download Resources.html 269 Bytes
  • 12. Doubly Linked List/13. Download Resources.html 269 Bytes
  • 13. Circular Doubly Linked List/14. Download Resources.html 269 Bytes
  • 14. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)/12. Download Resources.html 269 Bytes
  • 15. Stack/11. Download Resources.html 269 Bytes
  • 17. Queue/17. Download Resources.html 269 Bytes
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. Download Resources.html 269 Bytes
  • 19. Recursion/11. Download the Resources.html 269 Bytes
  • 20. Cracking Recursion Interview Questions/5. Download the Resources.html 269 Bytes
  • 22. Tree Binary Tree/27. Download Resources.html 269 Bytes
  • 24. Binary Search Tree/12. Download Resources.html 269 Bytes
  • 25. AVL Tree/16. Download Resources.html 269 Bytes
  • 26. Binary Heap/7. Download Resources.html 269 Bytes
  • 27. Trie/7. Download Resources.html 269 Bytes
  • 28. Hashing/14. Download Resources.html 269 Bytes
  • 29. Sorting Algorithms/12. Download Resources.html 269 Bytes
  • 30. Searching Algorithms/7. Download Resources.html 269 Bytes
  • 31. Graphs/8. Download Resources.html 269 Bytes
  • 32. Graph Traversal - Breadth First Search and Depth First Search Algorithms/10. Download Resources.html 269 Bytes
  • 33. Topological Sort/6. Download Resources.html 269 Bytes
  • 34. Single Source Shortest Path Problem (SSSPP)/8. Download Resources.html 269 Bytes
  • 35. Dijkstra's Algorithm/5. Download Resources.html 269 Bytes
  • 36. Bellman Ford Algorithm/6. Download Resources.html 269 Bytes
  • 38. Floyd Warshall Algorithm/6. Download Resources.html 269 Bytes
  • 39. Minimum Spanning Tree (Disjoint Set)/4. Download Resources.html 269 Bytes
  • 40. Kruskal and Prim's Algorithms/6. Download Resources.html 269 Bytes
  • 42. Greedy Algorithms/9. Download Resources.html 269 Bytes
  • 43. Divide and Conquer Algorithms/20. Download Resources.html 269 Bytes
  • 27. Trie/7. TrieNode.java 219 Bytes
  • 15. Stack/11. MainStackLinkedList.java 193 Bytes
  • 01. Introduction/7. Lecture Notes.html 165 Bytes
  • 25. AVL Tree/16. BinaryNode.java 162 Bytes
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/14. Node.java 138 Bytes
  • 18. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)/5. Node.java 138 Bytes
  • 01. Introduction/8. Motivation.html 127 Bytes
  • 22. Tree Binary Tree/27. BinaryNode.java 125 Bytes
  • 12. Doubly Linked List/13. DoublyNode.java 100 Bytes
  • 13. Circular Doubly Linked List/14. DoublyNode.java 100 Bytes
  • 49. My Other Courses/1. AppMillers-Tech-Community.txt 76 Bytes
  • 08. Linked List/15. Node.java 62 Bytes
  • 10. Circular Singly Linked List/12. Node.java 62 Bytes
  • 15. Stack/11. Node.java 62 Bytes
  • 17. Queue/17. Node.java 62 Bytes
  • 45. Dynamic Programming/7. Number-factor.txt 48 Bytes
  • 06. ArrayList/1. ArrayList.java.txt 40 Bytes
  • 06. ArrayList/9. ArrayList.java.txt 40 Bytes

随机展示

相关说明

本站不存储任何资源内容，只收集BT种子元数据(例如文件名和文件大小)和磁力链接(BT种子标识符)，并提供查询服务，是一个完全合法的搜索引擎系统。 网站不提供种子下载服务，用户可以通过第三方链接或磁力链接获取到相关的种子资源。本站也不对BT种子真实性及合法性负责，请用户注意甄别！