589689.xyz

[Coding Ninjas] Java Foundation with Data Structures & Algorithms (2020) [En]

  • 收录时间:2022-04-14 01:50:01
  • 文件大小:8GB
  • 下载次数:1
  • 最近下载:2022-04-14 01:50:01
  • 磁力链接:
立即下载 复制链接

文件列表

  1. DSA1/1.Lecture 1 3a Flowcharts/0.Intro to Flowcharts_1.mp4 181MB
  2. DSA1/15.Lecture 3 3a Recursion 1/11.Recursion and Arrays contd-.mp4 143MB
  3. DSA1/11.Lecture 8 3a Strings and 2D Arrays/6.2D Arrays_1.mp4 142MB
  4. DSA1/8.Lecture 5 3a Function, Variables and their Scope/4.How Function Calling Works 3F_2.mp4 113MB
  5. DSA1/14.Lecture 2 3a OOPS 2/0.Component of OOPS_1.mp4 113MB
  6. DSA1/13.Lecture 1 3a OOPS 1/2.Access Modifiers-_1.mp4 108MB
  7. DSA1/3.Lecture3 3a Conditionals and Loops/3.While Loop_1.mp4 101MB
  8. DSA1/2.Lecture2 3a Getting Started with Java/0.Java Platform Independence_1.mp4 98MB
  9. DSA2/20.Lecture 15 3a Tries and Huffman Coding/3.Tries Implementation - Search a Word_1.mp4 93MB
  10. DSA2/17.Lecture 13 3a Hashmaps/2.Remove Duplicates_1.mp4 70MB
  11. DSA2/11.Lecture 9 3a Stacks and Queues/11.Queue Using Array.mp4 69MB
  12. DSA2/21.Lecture 16 3a DP - 1/0.Fibonacci - 1-1.mkv 67MB
  13. DSA1/10.Lecture 7 3a Searching and Sorting/10.How to Merge two sorted arrays 3F_1.mp4 64MB
  14. DSA2/9.Lecture 7 3a Linked List 1/6.Taking Linked List Input.mp4 61MB
  15. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/1.Cycle Detection.mp4 60MB
  16. DSA2/11.Lecture 9 3a Stacks and Queues/1.Stack Using Array.mp4 60MB
  17. DSA1/13.Lecture 1 3a OOPS 1/11.Dynamic Array class .mp4 58MB
  18. DSA1/2.Lecture2 3a Getting Started with Java/13.Operators.mp4 58MB
  19. DSA2/23.Lecture 18 3a OOPS - 3/2.Tic Tac Toe - 2.mp4 58MB
  20. DSA2/9.Lecture 7 3a Linked List 1/4.Print Linked List.mp4 57MB
  21. DSA1/13.Lecture 1 3a OOPS 1/8.Fraction class .mp4 57MB
  22. DSA2/20.Lecture 15 3a Tries and Huffman Coding/1.Tries Implementation - Insert a Word.mp4 56MB
  23. DSA2/22.Lecture 17 3a DP - 2/5.LCS.mp4 56MB
  24. DSA2/18.Lecture 14 3a Priority Queues/13.Inbuilt Priority Queue and K sorted array.mp4 55MB
  25. DSA1/9.Lecture 6_ Arrays/0.What Are Arrays -1.mkv 55MB
  26. DSA2/11.Lecture 9 3a Stacks and Queues/10.Queue Introduction_1.mp4 55MB
  27. DSA2/9.Lecture 7 3a Linked List 1/9.Insert Node in Linked List.mp4 54MB
  28. DSA1/8.Lecture 5 3a Function, Variables and their Scope/0.What Are Functions 3f.mp4 54MB
  29. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/8.Prim's Algorithm - Solution.mp4 54MB
  30. DSA1/11.Lecture 8 3a Strings and 2D Arrays/3.How are Strings Stored 3f.mp4 53MB
  31. DSA2/21.Lecture 16 3a DP - 1/5.Solution - Min Steps To 1-5.mkv 53MB
  32. DSA2/18.Lecture 14 3a Priority Queues/3.CBT Height and its implementation.mp4 51MB
  33. DSA2/21.Lecture 16 3a DP - 1/11.Solution - Number Of Balanced Bts-3.mkv 51MB
  34. DSA1/9.Lecture 6_ Arrays/2.Passing Arrays To Functions-4.mkv 51MB
  35. DSA1/3.Lecture3 3a Conditionals and Loops/0.Conditionals.mp4 51MB
  36. DSA2/10.Lecture 8 3a Linked List 2/15.Variations Of Ll-7.mkv 51MB
  37. DSA1/11.Lecture 8 3a Strings and 2D Arrays/8.How are 2D Arrays Stored 3f.mp4 50MB
  38. DSA2/5.Lecture 4 3a Recursion 2/6.Quick Sort.mp4 50MB
  39. DSA2/18.Lecture 14 3a Priority Queues/4.Insert and Delete in Heaps.mp4 50MB
  40. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1.Theoretical Analysis.mp4 49MB
  41. DSA1/13.Lecture 1 3a OOPS 1/6.Important Keywords .mp4 49MB
  42. DSA1/11.Lecture 8 3a Strings and 2D Arrays/0.Strings.mp4 49MB
  43. DSA2/22.Lecture 17 3a DP - 2/4.Minimum Cost Path - DP.mp4 49MB
  44. DSA2/21.Lecture 16 3a DP - 1/1.Fibonacci - 2-2.mkv 48MB
  45. DSA2/8.Lecture 6 3a OOPS 3/6.Generics.mp4 48MB
  46. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/5.Complexity of Kruskal's Algorithm_1.mp4 47MB
  47. DSA2/23.Lecture 18 3a OOPS - 3/3.Tic Tac Toe - 3.mp4 47MB
  48. DSA2/9.Lecture 7 3a Linked List 1/1.ArrayList.mp4 46MB
  49. DSA1/15.Lecture 3 3a Recursion 1/0.Introduction to Recursion.mp4 46MB
  50. DSA1/15.Lecture 3 3a Recursion 1/8.Recursion and Arrays.mp4 46MB
  51. DSA2/23.Lecture 18 3a OOPS - 3/4.Othello.mp4 46MB
  52. DSA2/23.Lecture 18 3a OOPS - 3/0.Introduction_1.mp4 46MB
  53. DSA2/24.Lecture 19 3a Graphs/3.DFS - Adjacency Matrix.mp4 45MB
  54. DSA2/13.Lecture 11 3a Binary Trees/10.Traversals in Binary Tree_1.mp4 45MB
  55. DSA1/6.Lecture 4 3a Operators and For Loop/6.Break and Continue.mp4 45MB
  56. DSA2/8.Lecture 6 3a OOPS 3/0.Final Keyword_1.mp4 45MB
  57. DSA2/11.Lecture 9 3a Stacks and Queues/4.Stack Using LL - Introduction.mp4 45MB
  58. DSA1/13.Lecture 1 3a OOPS 1/0.Introduction to OOPS .mp4 45MB
  59. DSA2/22.Lecture 17 3a DP - 2/12.Edit Distance - Memoization and DP.mp4 45MB
  60. DSA2/9.Lecture 7 3a Linked List 1/3.Intro to Linked List.mp4 44MB
  61. DSA1/14.Lecture 2 3a OOPS 2/10.Exception Handling.mp4 44MB
  62. DSA2/12.Lecture 10 3a Trees/3.Take Input - Level wise.mp4 44MB
  63. DSA1/1.Lecture 1 3a Flowcharts/5.Understanding Loop.mp4 44MB
  64. DSA2/20.Lecture 15 3a Tries and Huffman Coding/8.Huffman Coding.mp4 44MB
  65. DSA2/9.Lecture 7 3a Linked List 1/0.What are Data Structures 3F_1.mp4 44MB
  66. DSA2/23.Lecture 18 3a OOPS - 3/7.Calculator UI - Handling Button Clicks.mp4 44MB
  67. DSA2/5.Lecture 4 3a Recursion 2/12.Print Subsequences of a String.mp4 44MB
  68. DSA2/13.Lecture 11 3a Binary Trees/8.Diameter Binary Tree.mp4 43MB
  69. DSA2/18.Lecture 14 3a Priority Queues/12.Inplace Heap Sort - Solution.mp4 43MB
  70. DSA1/2.Lecture2 3a Getting Started with Java/3.Understanding Variables.mp4 43MB
  71. DSA2/18.Lecture 14 3a Priority Queues/8.Remove Min Solution and Complexity Analysis.mp4 42MB
  72. DSA1/3.Lecture3 3a Conditionals and Loops/6.Patterns.mp4 42MB
  73. DSA1/15.Lecture 3 3a Recursion 1/1.Recursion and PMI.mp4 42MB
  74. DSA2/12.Lecture 10 3a Trees/2.Take Input and Print - Recursive.mp4 42MB
  75. DSA1/11.Lecture 8 3a Strings and 2D Arrays/12.Jagged Arrays.mp4 42MB
  76. DSA2/17.Lecture 13 3a Hashmaps/8.Hashmap Implementation - 1.mp4 41MB
  77. DSA2/22.Lecture 17 3a DP - 2/6.LCS - Memoization .mp4 41MB
  78. DSA1/9.Lecture 6_ Arrays/6.How Are Arrays Stored - 1-8.mkv 41MB
  79. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/4.Kruskals Algorithm - Solution.mp4 41MB
  80. DSA2/18.Lecture 14 3a Priority Queues/6.Implementation - Insert.mp4 41MB
  81. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/6.Prim's Algorithm.mp4 41MB
  82. DSA2/10.Lecture 8 3a Linked List 2/12.Insert Recursively-5.mkv 40MB
  83. DSA2/23.Lecture 18 3a OOPS - 3/6.Calculator UI.mp4 40MB
  84. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/12.Space Complexity Analysis.mp4 40MB
  85. DSA2/15.Lecture 12 3a Binary Search Trees/18.BST Class - Insert Delete Solution.mp4 39MB
  86. DSA2/20.Lecture 15 3a Tries and Huffman Coding/4.Tries Implementation - Delete a Word.mp4 39MB
  87. DSA1/6.Lecture 4 3a Operators and For Loop/1.Increment Decrement Operators.mp4 39MB
  88. DSA2/11.Lecture 9 3a Stacks and Queues/0.Introduction to Stacks.mp4 38MB
  89. DSA2/10.Lecture 8 3a Linked List 2/8.Reverse Recursively Double Node-14.mkv 38MB
  90. DSA1/1.Lecture 1 3a Flowcharts/2.Decision Making.mp4 38MB
  91. DSA2/22.Lecture 17 3a DP - 2/7.LCS - DP.mp4 38MB
  92. DSA2/10.Lecture 8 3a Linked List 2/7.Reverse Ll (N2)-13.mkv 38MB
  93. DSA2/12.Lecture 10 3a Trees/1.TreeNode class.mp4 37MB
  94. DSA2/5.Lecture 4 3a Recursion 2/3.Merge Sort.mp4 37MB
  95. DSA1/10.Lecture 7 3a Searching and Sorting/3.Selection Sort.mp4 36MB
  96. DSA2/22.Lecture 17 3a DP - 2/3.Minimum Cost Path - Memoization.mp4 35MB
  97. DSA2/18.Lecture 14 3a Priority Queues/16.Inbuilt Max Priority Queue.mp4 35MB
  98. DSA2/17.Lecture 13 3a Hashmaps/11.Rehashing.mp4 35MB
  99. DSA2/5.Lecture 4 3a Recursion 2/9.Return Subsequences.mp4 35MB
  100. DSA1/6.Lecture 4 3a Operators and For Loop/0.Bitwise Operators.mp4 35MB
  101. DSA2/17.Lecture 13 3a Hashmaps/0.Introduction to Hashmaps.mp4 35MB
  102. DSA2/10.Lecture 8 3a Linked List 2/17.Linked List In Collections-8.mkv 34MB
  103. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/0.MST & Kruskals Introduction.mp4 34MB
  104. DSA1/10.Lecture 7 3a Searching and Sorting/0.What is Binary Search 3f.mp4 34MB
  105. DSA2/18.Lecture 14 3a Priority Queues/10.Inplace Heap Sort.mp4 34MB
  106. DSA2/17.Lecture 13 3a Hashmaps/6.Bucket Array and Hash Function.mp4 33MB
  107. DSA1/2.Lecture2 3a Getting Started with Java/5.Taking Input.mp4 33MB
  108. DSA2/13.Lecture 11 3a Binary Trees/9.Diameter Binary Tree Better.mp4 33MB
  109. DSA2/13.Lecture 11 3a Binary Trees/15.Construct Tree From Preorder and Inorder Solution.mp4 33MB
  110. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.Order Complexity Analysis.mp4 33MB
  111. DSA2/20.Lecture 15 3a Tries and Huffman Coding/0.Introduction To Tries.mp4 32MB
  112. DSA2/23.Lecture 18 3a OOPS - 3/1.Tic Tac Toe - 1.mp4 32MB
  113. DSA2/10.Lecture 8 3a Linked List 2/11.Reverse Iterative-4.mkv 32MB
  114. DSA2/15.Lecture 12 3a Binary Search Trees/7.Check BST - 2.mp4 32MB
  115. DSA2/24.Lecture 19 3a Graphs/6.Solution 3a BFS Traversal.mp4 32MB
  116. DSA2/8.Lecture 6 3a OOPS 3/2.Abstract Functions and Classes.mp4 32MB
  117. DSA1/2.Lecture2 3a Getting Started with Java/8.How is Data Stored 3f.mp4 31MB
  118. DSA2/13.Lecture 11 3a Binary Trees/2.Take Tree Input Iteratively.mp4 31MB
  119. DSA2/11.Lecture 9 3a Stacks and Queues/14.Queue Using LL Introduction.mp4 31MB
  120. DSA2/18.Lecture 14 3a Priority Queues/1.Ways to implement Priority Queues.mp4 31MB
  121. DSA2/22.Lecture 17 3a DP - 2/10.Edit Distance - Recursive.mp4 31MB
  122. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/10.Dijkstra’s Algorithm.mp4 30MB
  123. DSA2/13.Lecture 11 3a Binary Trees/1.Take Tree Input and Print Recursively.mp4 30MB
  124. DSA2/8.Lecture 6 3a OOPS 3/8.Bound Generic Types.mp4 30MB
  125. DSA2/15.Lecture 12 3a Binary Search Trees/6.Check BST - 1.mp4 30MB
  126. DSA2/17.Lecture 13 3a Hashmaps/1.Inbuilt Hashmap.mp4 30MB
  127. DSA1/2.Lecture2 3a Getting Started with Java/2.Hello World!.mp4 29MB
  128. DSA1/4.Lecture 3a Patterns 1/4.Triangular Patterns.mp4 28MB
  129. DSA1/15.Lecture 3 3a Recursion 1/6.Fibonacci Number.mp4 28MB
  130. DSA2/5.Lecture 4 3a Recursion 2/7.Quick Sort - Dry Run.mp4 28MB
  131. DSA2/5.Lecture 4 3a Recursion 2/0.Recursion and Strings.mp4 27MB
  132. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/7.Theoretical Analysis - Recursive Algorithms.mp4 27MB
  133. DSA2/11.Lecture 9 3a Stacks and Queues/12.Dynamic Queue.mp4 27MB
  134. DSA1/13.Lecture 1 3a OOPS 1/12.Intro 3a Polynomial class.mp4 27MB
  135. DSA1/6.Lecture 4 3a Operators and For Loop/3.For Loop.mp4 27MB
  136. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/12.Dijkstra Algorithm - Solution.mp4 27MB
  137. DSA2/10.Lecture 8 3a Linked List 2/2.Merge Two Sorted Ll-10.mkv 26MB
  138. DSA2/21.Lecture 16 3a DP - 1/9.Number Of Balanced Bts-7.mkv 26MB
  139. DSA1/13.Lecture 1 3a OOPS 1/4.Constructors.mp4 26MB
  140. DSA1/14.Lecture 2 3a OOPS 2/8.Polymorphism.mp4 26MB
  141. DSA1/14.Lecture 2 3a OOPS 2/6.Inheritance and Constructors.mp4 26MB
  142. DSA1/6.Lecture 4 3a Operators and For Loop/9.Scope of Variables.mp4 25MB
  143. DSA1/4.Lecture 3a Patterns 1/3.Square Patterns.mp4 25MB
  144. DSA2/5.Lecture 4 3a Recursion 2/5.Merge Sort Dry run.mp4 25MB
  145. DSA1/10.Lecture 7 3a Searching and Sorting/12.Merge Two Sorted Arrays.mp4 25MB
  146. DSA1/2.Lecture2 3a Getting Started with Java/11.How are Negative Numbers Stored 3f.mp4 25MB
  147. DSA2/21.Lecture 16 3a DP - 1/7.Minimum Count Of Squares-6.mkv 25MB
  148. DSA2/15.Lecture 12 3a Binary Search Trees/16.BST Class - How to Insert and Delete node 3f.mp4 25MB
  149. DSA2/10.Lecture 8 3a Linked List 2/13.Delete Recursively_1.mp4._01_ 24MB
  150. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/2.Kruskal's Algorithm.mp4 24MB
  151. DSA1/14.Lecture 2 3a OOPS 2/2.Inheritance and Private Members.mp4 24MB
  152. DSA1/10.Lecture 7 3a Searching and Sorting/6.Bubble Sort.mp4 24MB
  153. DSA2/22.Lecture 17 3a DP - 2/15.0 1 Knapsack - Recursive.mp4 24MB
  154. DSA2/8.Lecture 6 3a OOPS 3/4.Interfaces.mp4 24MB
  155. DSA2/22.Lecture 17 3a DP - 2/2. Minimum Cost Path - Recursive.mp4 24MB
  156. DSA2/11.Lecture 9 3a Stacks and Queues/6.Stack Using LL .mp4 23MB
  157. DSA2/18.Lecture 14 3a Priority Queues/2.Heaps Introduction.mp4 23MB
  158. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/11.Fibonacci Time Complexity Analysis.mp4 23MB
  159. DSA2/20.Lecture 15 3a Tries and Huffman Coding/3.Tries Implementation - Search a Word.mp4 23MB
  160. DSA2/15.Lecture 12 3a Binary Search Trees/15.BST Class.mp4 23MB
  161. DSA1/0.Welcome/0.Course Introduction.mp4 22MB
  162. DSA2/17.Lecture 13 3a Hashmaps/7.Collision Handling.mp4 22MB
  163. DSA2/20.Lecture 15 3a Tries and Huffman Coding/7.Types of Tries.mp4 22MB
  164. DSA2/15.Lecture 12 3a Binary Search Trees/13.Root to Node Path.mp4 22MB
  165. DSA2/17.Lecture 13 3a Hashmaps/9.Hashmap Implementation - 2.mp4 21MB
  166. DSA2/12.Lecture 10 3a Trees/0.Trees Introduction.mp4 21MB
  167. DSA2/10.Lecture 8 3a Linked List 2/9.Reverse Recursively O(N)-15.mkv 21MB
  168. DSA1/14.Lecture 2 3a OOPS 2/4.Protected and Super Keywords.mp4 21MB
  169. DSA2/13.Lecture 11 3a Binary Trees/0.Binary Tree Introduction.mp4 21MB
  170. DSA2/15.Lecture 12 3a Binary Search Trees/19.Types of Balanced BSTs.mp4 21MB
  171. DSA2/11.Lecture 9 3a Stacks and Queues/16.Queue Using LL.mp4 21MB
  172. DSA1/4.Lecture 3a Patterns 1/8.Character Patterns.mp4 20MB
  173. DSA2/18.Lecture 14 3a Priority Queues/0.What is Priority Queue.mp4 20MB
  174. DSA1/1.Lecture 1 3a Flowcharts/8.Let's solve a problem.mp4 20MB
  175. DSA1/1.Lecture 1 3a Flowcharts/10.Check Prime Solution.mp4 20MB
  176. DSA1/5.Lecture 3a Patterns 2/4.Isosceles Triangle.mp4 20MB
  177. DSA1/10.Lecture 7 3a Searching and Sorting/9.Insertion Sort.mp4 20MB
  178. DSA2/11.Lecture 9 3a Stacks and Queues/8.Balanced Parenthesis.mp4 20MB
  179. DSA1/10.Lecture 7 3a Searching and Sorting/2.Binary Search.mp4 18MB
  180. DSA1/10.Lecture 7 3a Searching and Sorting/4.Understanding Bubble Sort.mp4 18MB
  181. DSA2/5.Lecture 4 3a Recursion 2/10.Return Keypad.mp4 18MB
  182. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/9.Merge Sort Time Complexity Analysis.mp4 18MB
  183. DSA2/17.Lecture 13 3a Hashmaps/10.Time Complexity and Load Factor.mp4 18MB
  184. DSA2/22.Lecture 17 3a DP - 2/8.Edit Distance.mp4 17MB
  185. DSA1/2.Lecture2 3a Getting Started with Java/9.Explicit Typecasting.mp4 17MB
  186. DSA2/8.Lecture 6 3a OOPS 3/7.Generic Methods.mp4 17MB
  187. DSA2/12.Lecture 10 3a Trees/14.Tree Traversals.mp4 17MB
  188. DSA2/13.Lecture 11 3a Binary Trees/13.Construct Tree From Preorder and Inorder.mp4 17MB
  189. DSA2/20.Lecture 15 3a Tries and Huffman Coding/6.HashMap vs Tries.mp4 17MB
  190. DSA1/5.Lecture 3a Patterns 2/0.Reverse Triangle.mp4 16MB
  191. DSA2/15.Lecture 12 3a Binary Search Trees/8.Check BST - 3.mp4 16MB
  192. DSA2/22.Lecture 17 3a DP - 2/13.0 1 Knapsack.mp4 16MB
  193. DSA2/24.Lecture 19 3a Graphs/1.Graphs Terminology.mp4 16MB
  194. DSA2/11.Lecture 9 3a Stacks and Queues/2.Stack Double Capacity.mp4 16MB
  195. DSA2/15.Lecture 12 3a Binary Search Trees/0.Introduction to BST.mp4 15MB
  196. DSA2/21.Lecture 16 3a DP - 1/2.Min Steps To 1-4.mkv 15MB
  197. DSA1/8.Lecture 5 3a Function, Variables and their Scope/8.Pass By Value.mp4 15MB
  198. DSA2/24.Lecture 19 3a Graphs/2.Graphs Implementation .mp4 14MB
  199. DSA2/12.Lecture 10 3a Trees/11.Depth of a node.mp4 14MB
  200. DSA2/22.Lecture 17 3a DP - 2/0.Minimum Cost Path.mp4 14MB
  201. DSA1/4.Lecture 3a Patterns 1/0.Introduction to Patterns.mp4 14MB
  202. DSA2/5.Lecture 4 3a Recursion 2/13.Print Keypad Combinations.mp4 14MB
  203. DSA1/10.Lecture 7 3a Searching and Sorting/7.Understanding Insertion Sort.mp4 14MB
  204. DSA2/18.Lecture 14 3a Priority Queues/15.K largest elements - Solution.mp4 14MB
  205. DSA2/10.Lecture 8 3a Linked List 2/0.Midpoint Of Linked List-2.mkv 14MB
  206. DSA1/9.Lecture 6_ Arrays/8.How Are Arrays Stored - 3-10.mkv 13MB
  207. DSA1/8.Lecture 5 3a Function, Variables and their Scope/6.Variables and Scopes.mp4 13MB
  208. DSA2/10.Lecture 8 3a Linked List 2/4.Merge Sort-12.mkv 13MB
  209. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/9.Complexity of Prim's Algorithm.mp4 13MB
  210. DSA1/4.Lecture 3a Patterns 1/1.Basic Pattern.mp4 13MB
  211. DSA2/11.Lecture 9 3a Stacks and Queues/7.Stack in Collections.mp4 12MB
  212. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/4.Insertion Sort Time Complexity Analysis.mp4 12MB
  213. DSA1/9.Lecture 6_ Arrays/7.How Are Arrays Stored - 2-9.mkv 12MB
  214. DSA2/24.Lecture 19 3a Graphs/4.BFS Traversal.mp4 12MB
  215. DSA2/11.Lecture 9 3a Stacks and Queues/17.Queue in Collections.mp4 12MB
  216. DSA2/15.Lecture 12 3a Binary Search Trees/11.BST to Sorted LL.mp4 11MB
  217. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/14.Merge Sort Space Complexity Analysis.mp4 11MB
  218. DSA2/24.Lecture 19 3a Graphs/0.Graphs Introduction.mp4 11MB
  219. DSA2/12.Lecture 10 3a Trees/5.Find Number of nodes.mp4 11MB
  220. DSA2/13.Lecture 11 3a Binary Trees/4.Count Nodes in Binary Tree.mp4 11MB
  221. DSA2/18.Lecture 14 3a Priority Queues/5.Example Solution.mp4 10MB
  222. DSA2/12.Lecture 10 3a Trees/7.Node with largest data.mp4 10MB
  223. DSA2/24.Lecture 19 3a Graphs/9.Get Path - DFS.mp4 10MB
  224. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/15.Fibonacci Space Complexity Analysis.mp4 10MB
  225. DSA1/8.Lecture 5 3a Function, Variables and their Scope/5.Benefits Of Functions.mp4 9MB
  226. DSA1/13.Lecture 1 3a OOPS 1/9.Intro 3a Complex Number Class.mp4 9MB
  227. DSA1/15.Lecture 3 3a Recursion 1/12.Recursion and Helper Functions.mp4 9MB
  228. DSA2/10.Lecture 8 3a Linked List 2/13.Delete Recursively-6.mkv 8MB
  229. DSA2/15.Lecture 12 3a Binary Search Trees/9.Construct BST from a Sorted Array.mp4 8MB
  230. DSA1/5.Lecture 3a Patterns 2/2.Inverted Triangle.mp4 8MB
  231. DSA2/24.Lecture 19 3a Graphs/17.Weighted & Directed Graphs.mp4 7MB
  232. DSA2/24.Lecture 19 3a Graphs/11.Get Path - BFS.mp4 7MB
  233. DSA2/24.Lecture 19 3a Graphs/15.Return all connected components.mp4 7MB
  234. DSA2/9.Lecture 7 3a Linked List 1/10.How to Delete Node in LL 3f.mp4 7MB
  235. DSA2/12.Lecture 10 3a Trees/9.Find Height.mp4 7MB
  236. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/5.Selection Sort Time Complexity Analysis.mp4 6MB
  237. DSA2/24.Lecture 19 3a Graphs/7.Has path .mp4 5MB
  238. DSA2/24.Lecture 19 3a Graphs/13.Is Connected 3f.mp4 5MB
  239. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/3.Linear Search Time Complexity Analysis.mp4 5MB
  240. DSA2/15.Lecture 12 3a Binary Search Trees/1.Search Node in BST.mp4 5MB
  241. DSA2/15.Lecture 12 3a Binary Search Trees/3.Print Elements in Range.mp4 5MB
  242. DSA2/12.Lecture 10 3a Trees/12.Hint 3a Count leaf nodes.mp4 3MB
  243. DSA2/18.Assignment 3a Priority Queues/Assignment 3a Priority Queues/4.Buy the ticket.txt 2KB
  244. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/2.Array Intersection.txt 2KB
  245. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/5.Sum of Two Arrays.txt 2KB
  246. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/6.Check Number sequence.txt 2KB
  247. DSA1/11.Lecture 8 3a Strings and 2D Arrays/9.Largest Row or Column.txt 2KB
  248. DSA2/9.Lecture 7 3a Linked List 1/Delete a Node from Linked List.txt 2KB
  249. DSA2/9.Assignment 3a Linked List 1/Assignment 3a Linked List 1/1.AppendLastNToFirst.txt 2KB
  250. DSA2/0.Questions to Practice!/Questions to Practice!/7.Three Teams.txt 2KB
  251. DSA1/11.Lecture 8 3a Strings and 2D Arrays/11.Print Spiral.txt 2KB
  252. DSA1/9.Lecture 6_ Arrays/4.Linear Search.txt 2KB
  253. DSA2/9.Assignment 3a Linked List 1/Assignment 3a Linked List 1/0.Find a Node in Linked List.txt 2KB
  254. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/0.Push Zeros to end.txt 2KB
  255. DSA2/0.Questions to Practice!/Questions to Practice!/6.Bringing them together.txt 2KB
  256. DSA1/13.Lecture 1 3a OOPS 1/10.Complex Number Class.txt 2KB
  257. DSA2/0.Questions to Practice!/Questions to Practice!/4.Organizational Woes.txt 2KB
  258. DSA1/3.Lecture3 3a Conditionals and Loops/5.Fahrenheit to Celsius.txt 2KB
  259. DSA1/3.Assignment 3a Conditionals and Loops/Assignment 3a Conditionals and Loops/0.Total Salary.txt 2KB
  260. DSA1/11.Lecture 8 3a Strings and 2D Arrays/10.Print Like a Wave.txt 2KB
  261. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/4.Triplet Sum.txt 2KB
  262. DSA2/9.Assignment 3a Linked List 1/Assignment 3a Linked List 1/3.Print Reverse LinkedList.txt 2KB
  263. DSA2/0.Questions to Practice!/Questions to Practice!/5.Count how many people are not working.txt 1KB
  264. DSA2/0.Questions to Practice!/Questions to Practice!/2.Warm Reception.txt 1KB
  265. DSA2/9.Lecture 7 3a Linked List 1/Print i-th Node Data.txt 1KB
  266. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/3.Pair Sum.txt 1KB
  267. DSA1/10.Lecture 7 3a Searching and Sorting/11.Merge Two Sorted Arrays.txt 1KB
  268. DSA1/8.Lecture 5 3a Function, Variables and their Scope/2.Fahrenheit to Celsius Function.txt 1KB
  269. DSA2/9.Assignment 3a Linked List 1/Assignment 3a Linked List 1/4.Palindrome LinkedList.txt 1KB
  270. DSA2/9.Assignment 3a Linked List 1/Assignment 3a Linked List 1/2.Eliminate duplicates from LL.txt 1KB
  271. DSA2/23.Lecture 18 3a OOPS - 3/Othello.txt 1KB
  272. DSA2/11.Assignment 3a Stacks and Queues/Assignment 3a Stacks and Queues/3.Stock Span.txt 1KB
  273. DSA2/26.Assignment 3a Graphs (Optional)/Assignment 3a Graphs (Optional)/2.Connecting Dots.txt 1KB
  274. DSA1/13.Lecture 1 3a OOPS 1/13.Polynomial class.txt 1KB
  275. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/4.Sort 0 1 2 .txt 1KB
  276. DSA1/11.Lecture 8 3a Strings and 2D Arrays/7.Row Wise Sum.txt 1KB
  277. DSA2/0.Questions to Practice!/Questions to Practice!/1.Chocolate Carton Distribution Problem.txt 1KB
  278. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/2.Second Largest in array.txt 1KB
  279. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/1.Find Duplicate.txt 1KB
  280. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/5.Sort 0 1.txt 1KB
  281. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/1.Rotate array.txt 1KB
  282. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/5.Rotate array.txt 1KB
  283. DSA1/10.Lecture 7 3a Searching and Sorting/1.Binary Search.txt 1KB
  284. DSA2/17.Assignment 3a Hashmaps/Assignment 3a Hashmaps/1.Longest consecutive Sequence.txt 1KB
  285. DSA1/9.Assignment 3a Arrays 1/Assignment 3a Arrays 1/0.Find Unique.txt 1KB
  286. DSA2/24.Lecture 19 3a Graphs/Get Path - DFS.txt 1KB
  287. DSA2/24.Lecture 19 3a Graphs/Get Path - BFS.txt 1KB
  288. DSA1/10.Assignment 3a Arrays 2/Assignment 3a Arrays 2/3.Check Array Rotation.txt 1KB
  289. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/6.Check Array Rotation.txt 1KB
  290. DSA2/24.Lecture 19 3a Graphs/All connected components.txt 1KB
  291. DSA1/9.Lecture 6_ Arrays/10.Swap Alternate.txt 1KB
  292. DSA1/10.Lecture 7 3a Searching and Sorting/8.Insertion sort.txt 1KB
  293. DSA1/10.Lecture 7 3a Searching and Sorting/5.Bubble Sort.txt 1KB
  294. DSA2/22.Assignment 3a DP/Assignment 3a DP/4.Matrix Chain Multiplication.txt 1KB
  295. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/Kruskals Algorithm.txt 1KB
  296. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/Prim's Algorithm.txt 1KB
  297. DSA1/9.Lecture 6_ Arrays/5.Arrange Numbers in the Array.txt 1KB
  298. DSA2/11.Lecture 9 3a Stacks and Queues/Queue using LL.txt 1KB
  299. DSA2/11.Lecture 9 3a Stacks and Queues/Stack Using LL.txt 1KB
  300. DSA2/15.Lecture 12 3a Binary Search Trees/BST class.txt 1KB
  301. DSA2/9.Lecture 7 3a Linked List 1/Length of a Singly Linked List(Iterative).txt 1KB
  302. DSA1/2.Lecture2 3a Getting Started with Java/7.Average Marks.txt 1KB
  303. DSA2/25.Lecture 20 3a Graphs 2 (Optional)/Dijkstra's Algorithm.txt 1KB
  304. DSA1/17.Assignment 3a Recursion 1b/Assignment 3a Recursion 1b/4.Tower of Hanoi.txt 1KB
  305. DSA2/18.Assignment 3a Priority Queues/Assignment 3a Priority Queues/3.Running median.txt 1KB
  306. DSA2/21.Lecture 16 3a DP - 1/Min Steps to one.txt 1KB
  307. DSA1/3.Assignment 3a Conditionals and Loops/Assignment 3a Conditionals and Loops/1.Sum of even & odd.txt 1KB
  308. DSA2/20.Assignment 3a Tries/Assignment 3a Tries/1.Palindrome Pair.txt 1KB
  309. DSA1/9.Lecture 6_ Arrays/3.Return array Sum.txt 1KB
  310. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/3.Pair sum in array.txt 1KB
  311. DSA2/24.Lecture 19 3a Graphs/Is Connected 3f.txt 1KB
  312. DSA2/15.BST and Binary Tree/BST and Binary Tree/1.LCA of Binary Tree.txt 1014B
  313. DSA2/15.BST and Binary Tree/BST and Binary Tree/2.LCA of BST.txt 1009B
  314. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/4.Triplet sum.txt 1006B
  315. DSA2/24.Lecture 19 3a Graphs/Has Path .txt 998B
  316. DSA2/24.Lecture 19 3a Graphs/BFS Traversal.txt 988B
  317. DSA2/26.Assignment 3a Graphs (Optional)/Assignment 3a Graphs (Optional)/1.Coding Ninjas.txt 978B
  318. DSA2/21.Lecture 16 3a DP - 1/Minimum Count.txt 974B
  319. DSA2/0.Questions to Practice!/Questions to Practice!/0.Gather Rain Water.txt 962B
  320. DSA2/9.Lecture 7 3a Linked List 1/1.Find Output.txt 957B
  321. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/3.Structurally identical.txt 951B
  322. DSA2/9.Lecture 7 3a Linked List 1/3.What will be the Output 3f.txt 931B
  323. DSA2/20.Assignment 3a Tries/Assignment 3a Tries/2.Auto complete.txt 930B
  324. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/4.kReverse.txt 921B
  325. DSA2/17.Lecture 13 3a Hashmaps/Pair sum to 0.txt 919B
  326. DSA2/13.Lecture 11 3a Binary Trees/Print Level Wise.txt 913B
  327. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/2.Print Array intersection.txt 909B
  328. DSA2/16.BST and BT/BST and BT/1.Replace with Sum of greater nodes.txt 905B
  329. DSA2/18.Lecture 14 3a Priority Queues/Max priority queue class.txt 904B
  330. DSA2/17.Lecture 13 3a Hashmaps/Print Array intersection.txt 898B
  331. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/0.Sum or Product.txt 891B
  332. DSA1/14.Lecture 2 3a OOPS 2/5.Correct option.txt 883B
  333. DSA2/17.Assignment 3a Hashmaps/Assignment 3a Hashmaps/2.Pairs with difference K.txt 871B
  334. DSA1/15.Lecture 3 3a Recursion 1/14.Last index of x.txt 852B
  335. DSA2/22.Assignment 3a DP/Assignment 3a DP/3.Ways To Make Coin Change.txt 852B
  336. DSA2/13.Lecture 11 3a Binary Trees/Mirror a Binary tree.txt 846B
  337. DSA2/15.BST and Binary Tree/BST and Binary Tree/0.Create & Insert Duplicate Node.txt 844B
  338. DSA1/13.Lecture 1 3a OOPS 1/5.What is the output.txt 840B
  339. DSA1/11.Strings/Strings/5.Compress the String.txt 834B
  340. DSA2/26.Assignment 3a Graphs (Optional)/Assignment 3a Graphs (Optional)/0.Islands.txt 834B
  341. DSA2/10.Lecture 8 3a Linked List 2/Delete node recursively.txt 829B
  342. DSA2/10.Lecture 8 _ Linked List 2/Delete node recursively.txt 829B
  343. DSA1/11.Strings/Strings/0.Check Permutation.txt 827B
  344. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/4.Print Subsets of Array.txt 821B
  345. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/0.Check AB.txt 819B
  346. DSA1/11.Strings/Strings/3.Remove character.txt 812B
  347. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/4.Next larger element.txt 810B
  348. DSA2/10.Lecture 8 3a Linked List 2/Merge Two Sorted Linked Lists.txt 807B
  349. DSA2/17.Lecture 13 3a Hashmaps/Maximum Frequency Number.txt 807B
  350. DSA2/22.Lecture 17 3a DP - 2/0 1 Knapsack.txt 801B
  351. DSA2/11.Assignment 3a Stacks and Queues/Assignment 3a Stacks and Queues/2.Check redundant brackets.txt 797B
  352. DSA2/9.Lecture 7 3a Linked List 1/2.What will be the output 3f.txt 789B
  353. DSA2/26.Assignment 3a Graphs (Optional)/Assignment 3a Graphs (Optional)/3.Largest Piece.txt 788B
  354. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/3.Swap two Node of LL.txt 787B
  355. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/3.Remove Leaf nodes.txt 787B
  356. DSA2/15.BST and Binary Tree/BST and Binary Tree/3.Pair sum BInary Tree.txt 782B
  357. DSA2/22.Assignment 3a DP/Assignment 3a DP/1.Longest Increasing Subsequence.txt 781B
  358. DSA2/13.Lecture 11 3a Binary Trees/Construct Tree from preorder & inorder.txt 767B
  359. DSA1/5.Lecture 3a Patterns 2/6.Pattern 3a Triangle of numbers.txt 763B
  360. DSA2/18.Lecture 14 3a Priority Queues/K largest elements.txt 758B
  361. DSA2/18.Assignment 3a Priority Queues/Assignment 3a Priority Queues/1.Kth largest element.txt 754B
  362. DSA1/14.Lecture 2 3a OOPS 2/5.Fill the output.txt 752B
  363. DSA2/5.Lecture 4 3a Recursion 2/Return Keypad - String.txt 752B
  364. DSA2/22.Assignment 3a DP/Assignment 3a DP/2.All possible ways.txt 751B
  365. DSA2/0.Questions to Practice!/Questions to Practice!/3.Maximum Subarray Sum.txt 749B
  366. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/1.Duplicate in array.txt 747B
  367. DSA2/22.Lecture 17 3a DP - 2/Edit Distance.txt 746B
  368. DSA2/15.Lecture 12 3a Binary Search Trees/Search in BST.txt 745B
  369. DSA1/11.Strings/Strings/4.Highest Occurring Character.txt 741B
  370. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/1.Even after Odd LinkedList.txt 736B
  371. DSA1/11.Lecture 8 3a Strings and 2D Arrays/4.All substrings.txt 735B
  372. DSA1/15.Lecture 3 3a Recursion 1/13.First Index.txt 735B
  373. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/0.Check if generic tree contain element x.txt 735B
  374. DSA2/26.Assignment 3a Graphs (Optional)/Assignment 3a Graphs (Optional)/4.3 Cycle.txt 733B
  375. DSA1/11.Lecture 8 3a Strings and 2D Arrays/5.Reverse string Word Wise.txt 732B
  376. DSA2/13.Lecture 11 3a Binary Trees/Construct Tree from postorder & inorder.txt 730B
  377. DSA2/22.Assignment 3a DP/Assignment 3a DP/5.Coin Tower.txt 730B
  378. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/3.Return subset of an array.txt 728B
  379. DSA2/15.Lecture 12 3a Binary Search Trees/Check BST.txt 721B
  380. DSA2/22.Lecture 17 3a DP - 2/Min cost Path.txt 720B
  381. DSA1/14.Lecture 2 3a OOPS 2/7.What is the output.txt 719B
  382. DSA1/15.Lecture 3 3a Recursion 1/15.All indexes of x.txt 716B
  383. DSA1/5.Lecture 3a Patterns 2/7.Diamond of Stars.txt 715B
  384. DSA2/20.Assignment 3a Tries/Assignment 3a Tries/0.Pattern Matching.txt 714B
  385. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/4.Decimal to Binary.txt 710B
  386. DSA1/17.Assignment 3a Recursion 1b/Assignment 3a Recursion 1b/2.String to Integer.txt 708B
  387. DSA1/3.Lecture3 3a Conditionals and Loops/2.Find Character Case.txt 707B
  388. DSA2/16.BST and BT/BST and BT/3.Pair sum in a BST.txt 706B
  389. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/2.Delete every N nodes.txt 695B
  390. DSA2/6.Assignment 3a Arrays (Optimised)/Assignment 3a Arrays (Optimised)/0.Find the Unique Element.txt 690B
  391. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/1.Number of Nodes greater than x .txt 690B
  392. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/5.ZigZag tree.txt 689B
  393. DSA2/11.Assignment 3a Stacks and Queues/Assignment 3a Stacks and Queues/0.Reverse Stack.txt 687B
  394. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/5.Return subsets sum to K.txt 686B
  395. DSA1/15.Lecture 3 3a Recursion 1/10.Check number recursively.txt 684B
  396. DSA1/14.Lecture 2 3a OOPS 2/11.What is the output.txt 680B
  397. DSA1/11.Strings/Strings/2.Reverse Each Word.txt 679B
  398. DSA1/5.Lecture 3a Patterns 2/1.Mirror Number Pattern.txt 678B
  399. DSA2/18.Assignment 3a Priority Queues/Assignment 3a Priority Queues/2.Merge K sorted arrays.txt 678B
  400. DSA2/12.Lecture 10 3a Trees/Number of Nodes greater than x .txt 677B
  401. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/8.Print all Codes - String.txt 663B
  402. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/0.Find a node in LL (recursive).txt 663B
  403. DSA2/15.Lecture 12 3a Binary Search Trees/Find path in BST.txt 660B
  404. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/2.Node having sum of children and node is max.txt 656B
  405. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/6.Print Subset Sum to K.txt 655B
  406. DSA2/15.Lecture 12 3a Binary Search Trees/Elements in between K1 & K2.txt 655B
  407. DSA2/17.Assignment 3a Hashmaps/Assignment 3a Hashmaps/3.Longest subset zero sum.txt 653B
  408. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/2.Reverse of a number.txt 643B
  409. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/4.Time Complexity of Code.txt 641B
  410. DSA2/5.Lecture 4 3a Recursion 2/Quick Sort.txt 637B
  411. DSA1/3.Assignment 3a Conditionals and Loops/Assignment 3a Conditionals and Loops/2.Find power of a number.txt 635B
  412. DSA1/11.Strings/Strings/1.Remove Consecutive Duplicates.txt 634B
  413. DSA2/12.Lecture 10 3a Trees/Print Level wise.txt 634B
  414. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/4.Level wise linkedlist.txt 632B
  415. DSA2/5.Lecture 4 3a Recursion 2/Merge Sort.txt 631B
  416. DSA2/21.Lecture 16 3a DP - 1/Number of balanced Binary Trees.txt 630B
  417. DSA1/3.Lecture3 3a Conditionals and Loops/9.Star Pattern.txt 627B
  418. DSA1/5.Lecture 3a Patterns 2/5.Star Pattern.txt 627B
  419. DSA1/4.Lecture 3a Patterns 1/11.Interesting Alphabets.txt 623B
  420. DSA1/11.Lecture 8 3a Strings and 2D Arrays/2.String Palindrome.txt 623B
  421. DSA2/15.Lecture 12 3a Binary Search Trees/Construct BST.txt 619B
  422. DSA1/16.Assignment 3a Recursion 1a/Assignment 3a Recursion 1a/0.Multiplication (Recursive).txt 615B
  423. DSA1/8.Lecture 5 3a Function, Variables and their Scope/3.Fibonacci Member.txt 614B
  424. DSA2/15.BST and Binary Tree/BST and Binary Tree/4.Path Sum Root to Leaf.txt 614B
  425. DSA2/22.Assignment 3a DP/Assignment 3a DP/7.Shortest Subsequence.txt 613B
  426. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/5.Second Largest Element In Tree.txt 612B
  427. DSA1/4.Lecture 3a Patterns 1/2.Square Pattern.txt 610B
  428. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/7.Replace node with depth.txt 610B
  429. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/1.is Balanced.txt 608B
  430. DSA1/11.Lecture 8 3a Strings and 2D Arrays/1.Count Words.txt 606B
  431. DSA2/11.Assignment 3a Stacks and Queues/Assignment 3a Stacks and Queues/4.Minimum bracket Reversal.txt 604B
  432. DSA2/12.Lecture 10 3a Trees/Post-order Traversal.txt 603B
  433. DSA2/22.Assignment 3a DP/Assignment 3a DP/6.Maximum Square Matrix With All Zeros.txt 603B
  434. DSA1/15.Lecture 3 3a Recursion 1/9.Sum of array (recursive).txt 602B
  435. DSA1/14.Lecture 2 3a OOPS 2/3.What is the output.txt 598B
  436. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/7.Return all codes - String.txt 597B
  437. DSA2/16.BST and BT/BST and BT/2.Print nodes at distance k from node.txt 596B
  438. DSA2/22.Assignment 3a DP/Assignment 3a DP/0.Loot Houses.txt 594B
  439. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/2.Binary Search (Recursive).txt 593B
  440. DSA2/17.Assignment 3a Hashmaps/Assignment 3a Hashmaps/0.Extract Unique characters.txt 593B
  441. DSA2/5.Lecture 4 3a Recursion 2/Print Keypad - String.txt 588B
  442. DSA1/4.Lecture 3a Patterns 1/5.Triangle Star Pattern.txt 587B
  443. DSA1/6.Lecture 4 3a Operators and For Loop/8.All prime numbers.txt 586B
  444. DSA1/13.Lecture 1 3a OOPS 1/5.Fill the output.txt 584B
  445. DSA2/13.Lecture 11 3a Binary Trees/Postorder Binary Tree.txt 584B
  446. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/1.Staircase.txt 583B
  447. DSA1/4.Lecture 3a Patterns 1/9.Alpha Pattern.txt 582B
  448. DSA2/13.Lecture 11 3a Binary Trees/Preorder Binary Tree.txt 580B
  449. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/3.Time Complexity of Code.txt 578B
  450. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/6.Nodes without sibling.txt 577B
  451. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/2.Level order traversal.txt 575B
  452. DSA2/13.Lecture 11 3a Binary Trees/Height of binary tree.txt 574B
  453. DSA1/17.Assignment 3a Recursion 1b/Assignment 3a Recursion 1b/3.Pair star.txt 573B
  454. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/9.Return Permutations - String.txt 573B
  455. DSA2/11.Lecture 9 3a Stacks and Queues/If Brackets are balanced 3f.txt 572B
  456. DSA1/13.Lecture 1 3a OOPS 1/7.What is the output.txt 571B
  457. DSA2/13.Lecture 11 3a Binary Trees/Is node present 3f.txt 571B
  458. DSA1/17.Assignment 3a Recursion 1b/Assignment 3a Recursion 1b/1.Remove X.txt 569B
  459. DSA1/14.Lecture 2 3a OOPS 2/1.What is the output.txt 565B
  460. DSA1/15.Lecture 3 3a Recursion 1/3.Print numbers.txt 564B
  461. DSA1/6.Lecture 4 3a Operators and For Loop/5.Nth Fibonacci number.txt 563B
  462. DSA2/5.Lecture 4 3a Recursion 2/Replace character recursively.txt 563B
  463. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/5.Square Root (Integral).txt 559B
  464. DSA1/15.Lecture 3 3a Recursion 1/2.x to the power n.txt 558B
  465. DSA1/14.Lecture 2 3a OOPS 2/9.Fill the output.txt 550B
  466. DSA1/5.Lecture 3a Patterns 2/3.Inverted Number Pattern.txt 547B
  467. DSA2/11.Assignment 3a Stacks and Queues/Assignment 3a Stacks and Queues/1.Reverse Queue.txt 544B
  468. DSA1/4.Lecture 3a Patterns 1/6.Triangle Number Pattern.txt 543B
  469. DSA2/10.Lecture 8 3a Linked List 2/MergeSort Linked List.txt 543B
  470. DSA1/4.Lecture 3a Patterns 1/7.Reverse Number Pattern.txt 542B
  471. DSA1/15.Lecture 3 3a Recursion 1/4.Number of digits.txt 541B
  472. DSA2/21.Lecture 16 3a DP - 1/Staircase.txt 537B
  473. DSA2/12.Assignment 3a Trees/Assignment 3a Trees/6.Count leaf Nodes.txt 535B
  474. DSA2/16.BST and BT/BST and BT/0.Largest BST.txt 535B
  475. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/4.All fibonacci numbers.txt 530B
  476. DSA1/4.Lecture 3a Patterns 1/10.Character Pattern.txt 526B
  477. DSA1/16.Assignment 3a Recursion 1a/Assignment 3a Recursion 1a/3.Check Palindrome (recursive).txt 522B
  478. DSA2/12.Lecture 10 3a Trees/Count leaf Nodes.txt 522B
  479. DSA2/18.Assignment 3a Priority Queues/Assignment 3a Priority Queues/0.Check Max-Heap.txt 521B
  480. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/0.Check triangle.txt 518B
  481. DSA2/10.Assignment 3a Linked List 2/Assignment 3a Linked List 2/5.Bubble Sort (Iterative) LinkedList.txt 513B
  482. DSA2/12.Lecture 10 3a Trees/Sum of all nodes.txt 513B
  483. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/1.Terms of AP.txt 511B
  484. DSA2/18.Lecture 14 3a Priority Queues/Inplace Heap sort.txt 511B
  485. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/5.Member of Fibonacci .txt 508B
  486. DSA2/5.Lecture 4 3a Recursion 2/Remove Duplicates .txt 500B
  487. DSA1/6.Assignment 3a More on Loops/Assignment 3a More on Loops/3.Binary to decimal.txt 492B
  488. DSA2/15.Lecture 12 3a Binary Search Trees/BST to LL.txt 489B
  489. DSA2/12.Lecture 10 3a Trees/Height of generic Tree.txt 484B
  490. DSA1/16.Assignment 3a Recursion 1a/Assignment 3a Recursion 1a/1.Count Zeros.txt 483B
  491. DSA2/9.Lecture 7 3a Linked List 1/4.Operations in O(1).txt 476B
  492. DSA2/10.Lecture 8 3a Linked List 2/0.Circular doubly LL.txt 475B
  493. DSA2/10.Lecture 8 _ Linked List 2/0.Circular doubly LL.txt 475B
  494. DSA1/16.Assignment 3a Recursion 1a/Assignment 3a Recursion 1a/2.Geometric Sum.txt 470B
  495. DSA2/9.Lecture 7 3a Linked List 1/3.Operations in O(1).txt 467B
  496. DSA1/1.Lecture 1 3a Flowcharts/3.Check Number.txt 466B
  497. DSA1/1.Lecture 1 3a Flowcharts/4.Form triangle.txt 462B
  498. DSA2/10.Lecture 8 3a Linked List 2/2.Double LL.txt 461B
  499. DSA2/10.Lecture 8 3a Linked List 2/3.Circular LL.txt 461B
  500. DSA2/10.Lecture 8 _ Linked List 2/2.Double LL.txt 461B
  501. DSA2/10.Lecture 8 _ Linked List 2/3.Circular LL.txt 461B
  502. DSA2/20.Lecture 15 3a Tries and Huffman Coding/Count words in Trie.txt 460B
  503. DSA2/8.Lecture 6 3a OOPS 3/2.What is the output.txt 459B
  504. DSA2/10.Lecture 8 3a Linked List 2/Midpoint LinkedList.txt 458B
  505. DSA1/16.Assignment 3a Recursion 1a/Assignment 3a Recursion 1a/4.Sum of digits (recursive).txt 457B
  506. DSA1/13.Lecture 1 3a OOPS 1/3.What is the output.txt 456B
  507. DSA1/6.Lecture 4 3a Operators and For Loop/2.Guess the output.txt 442B
  508. DSA1/8.Lecture 5 3a Function, Variables and their Scope/7.Check the error.txt 442B
  509. DSA1/1.Lecture 1 3a Flowcharts/4Form triangle.txt 437B
  510. DSA1/9.Lecture 6_ Arrays/9.What is the output.txt 433B
  511. DSA1/13.Lecture 1 3a OOPS 1/1.Find correct statement.txt 431B
  512. DSA1/1.Lecture 1 3a Flowcharts/3Check Number.txt 429B
  513. DSA1/1.Lecture 1 3a Flowcharts/6.Find Product.txt 429B
  514. DSA1/17.Assignment 3a Recursion 1b/Assignment 3a Recursion 1b/0.Replace pi (recursive).txt 427B
  515. DSA2/8.Lecture 6 3a OOPS 3/0.What is the output.txt 424B
  516. DSA2/10.Lecture 8 3a Linked List 2/Reverse LL (Recursive).txt 424B
  517. DSA2/10.Lecture 8 3a Linked List 2/Reverse LL (Iterative) .txt 421B
  518. DSA1/3.Lecture3 3a Conditionals and Loops/8.Number Pattern.txt 417B
  519. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/1.Sum of evens.txt 410B
  520. DSA2/8.Lecture 6 3a OOPS 3/1.What is the output.txt 408B
  521. DSA1/1.Lecture 1 3a Flowcharts/6Find Product.txt 406B
  522. DSA1/3.Lecture3 3a Conditionals and Loops/1.Find the output.txt 406B
  523. DSA2/13.Assignment 3a Binary Trees/Assignment 3a Binary Trees/0.Sum of all nodes.txt 405B
  524. DSA2/18.Lecture 14 3a Priority Queues/Remove Min.txt 398B
  525. DSA2/5.Assignment 3a Recursion 2/Assignment 3a Recursion 2/10.Print Permutations - String.txt 397B
  526. DSA2/9.Lecture 7 3a Linked List 1/4.Figure out the correct statement.txt 394B
  527. DSA1/15.Lecture 3 3a Recursion 1/7.What is the output.txt 391B
  528. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/3.All primes.txt 385B
  529. DSA1/1.Lecture 1 3a Flowcharts/7.Print even numbers.txt 376B
  530. DSA1/1.Lecture 1 3a Flowcharts/9.Check Prime.txt 372B
  531. DSA2/20.Lecture 15 3a Tries and Huffman Coding/Search Words.txt 368B
  532. DSA1/3.Lecture3 3a Conditionals and Loops/1.What will be the output.txt 358B
  533. DSA1/1.Lecture 1 3a Flowcharts/7Print even numbers.txt 357B
  534. DSA1/3.Lecture3 3a Conditionals and Loops/7.Number Pattern.txt 354B
  535. DSA1/1.Assignment 3a Flowcharts/Assignment 3a Flowcharts/2.Find GCD.txt 351B
  536. DSA1/1.Lecture 1 3a Flowcharts/9Check Prime.txt 349B
  537. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1.What is time complexity.txt 341B
  538. DSA2/9.Lecture 7 3a Linked List 1/3.Figure out the element .txt 340B
  539. DSA1/6.Lecture 4 3a Operators and For Loop/10.Check the error.txt 325B
  540. DSA1/8.Lecture 5 3a Function, Variables and their Scope/9.Fill the output.txt 323B
  541. DSA1/6.Lecture 4 3a Operators and For Loop/7.What is the output.txt 320B
  542. DSA1/1.Lecture 1 3a Flowcharts/1.Average.txt 318B
  543. DSA1/8.Lecture 5 3a Function, Variables and their Scope/1.Find the output.txt 316B
  544. DSA1/6.Lecture 4 3a Operators and For Loop/4.What is the output.txt 314B
  545. DSA1/8.Lecture 5 3a Function, Variables and their Scope/1.Fill the output.txt 314B
  546. DSA1/3.Lecture3 3a Conditionals and Loops/4.Sum of Even Numbers till N.txt 307B
  547. DSA1/6.Lecture 4 3a Operators and For Loop/2.Bitwise Operator.txt 306B
  548. DSA1/2.Lecture2 3a Getting Started with Java/14.Find the output.txt 305B
  549. DSA1/1.Lecture 1 3a Flowcharts/1Average.txt 304B
  550. DSA1/2.Lecture2 3a Getting Started with Java/6.Multiple inputs.txt 304B
  551. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/2.Fibonacci.txt 303B
  552. DSA1/3.Lecture3 3a Conditionals and Loops/1.Figure out the output .txt 302B
  553. DSA2/9.Lecture 7 3a Linked List 1/1.Add element at last.txt 300B
  554. DSA1/6.Lecture 4 3a Operators and For Loop/10.What is the output.txt 297B
  555. DSA1/2.Lecture2 3a Getting Started with Java/6.Integer and String.txt 290B
  556. DSA1/2.Lecture2 3a Getting Started with Java/14.Predict the output.txt 280B
  557. DSA1/2.Lecture2 3a Getting Started with Java/6.Predict the output.txt 279B
  558. DSA1/2.Lecture2 3a Getting Started with Java/6.String output.txt 270B
  559. DSA1/8.Lecture 5 3a Function, Variables and their Scope/1.Return type.txt 256B
  560. DSA2/9.Lecture 7 3a Linked List 1/2.Insert at 2nd position.txt 255B
  561. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.What is time complexity.txt 253B
  562. DSA1/14.Lecture 2 3a OOPS 2/9.Correct statement(s).txt 248B
  563. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/2.Time Complexity.txt 248B
  564. DSA1/14.Lecture 2 3a OOPS 2/1.Valid statements.txt 242B
  565. DSA2/11.Lecture 9 3a Stacks and Queues/4.Insert in queue.txt 236B
  566. DSA1/2.Lecture2 3a Getting Started with Java/4.Uninitialized Local Variable.txt 233B
  567. DSA2/11.Lecture 9 3a Stacks and Queues/3.Worst case operation.txt 233B
  568. DSA2/11.Lecture 9 3a Stacks and Queues/1.Correct order.txt 224B
  569. DSA2/11.Lecture 9 3a Stacks and Queues/3.Correct order.txt 224B
  570. DSA2/8.Lecture 6 3a OOPS 3/1.Correct Statement.txt 215B
  571. DSA1/9.Lecture 6_ Arrays/1.What is the output.txt 205B
  572. DSA2/11.Lecture 9 3a Stacks and Queues/4.Stack implementation.txt 200B
  573. DSA1/6.Lecture 4 3a Operators and For Loop/7.Skip iteration.txt 193B
  574. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1. Theoretical Analysis.txt 193B
  575. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/5.Operations for merging.txt 193B
  576. DSA1/13.Lecture 1 3a OOPS 1/7.Reference keyword.txt 189B
  577. DSA1/9.Lecture 6_ Arrays/9.Correct Statement.txt 186B
  578. DSA2/9.Lecture 7 3a Linked List 1/1.Size of ArrayList.txt 182B
  579. DSA2/9.Lecture 7 3a Linked List 1/2.ArrayList of Integers.txt 181B
  580. DSA2/9.Lecture 7 3a Linked List 1/0.Collection class for Dynamic array.txt 174B
  581. DSA2/11.Lecture 9 3a Stacks and Queues/2.Insert element.txt 173B
  582. DSA1/13.Lecture 1 3a OOPS 1/1.Create object.txt 171B
  583. DSA2/11.Lecture 9 3a Stacks and Queues/2.Correct statement.txt 169B
  584. DSA2/8.Lecture 6 3a OOPS 3/2.Abstract method.txt 162B
  585. DSA1/2.Lecture2 3a Getting Started with Java/4.Size of long .txt 161B
  586. DSA1/2.Lecture2 3a Getting Started with Java/10.Figure out the Output.txt 160B
  587. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/2.InsertionSort Worst Case Time Complexity.txt 160B
  588. DSA2/8.Lecture 6 3a OOPS 3/2.Prevent inheritance.txt 159B
  589. DSA2/9.Lecture 7 3a Linked List 1/0.Search in LL.txt 158B
  590. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.Efficiency of an Algorithm.txt 155B
  591. DSA1/2.Lecture2 3a Getting Started with Java/4.Boolean Variable.txt 154B
  592. DSA1/13.Lecture 1 3a OOPS 1/1.Memory allocation.txt 153B
  593. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1.Fibonacci.txt 153B
  594. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.Linear Search Worst Case.txt 150B
  595. DSA1/2.Lecture2 3a Getting Started with Java/10.Automatic type conversion.txt 147B
  596. DSA1/2.Lecture2 3a Getting Started with Java/10.Check for Error.txt 147B
  597. DSA1/2.Lecture2 3a Getting Started with Java/14.Error in code.txt 147B
  598. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.Recurrence for Merge Sort.txt 143B
  599. DSA1/2.Lecture2 3a Getting Started with Java/4.Datatype.txt 142B
  600. DSA1/13.Lecture 1 3a OOPS 1/7.Constructor access.txt 142B
  601. DSA2/11.Lecture 9 3a Stacks and Queues/1.Use recursion.txt 139B
  602. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1.Linear Search.txt 136B
  603. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/3.Selection Sort.txt 134B
  604. DSA2/10.Lecture 8 3a Linked List 2/1.Traversal in LL.txt 134B
  605. DSA2/10.Lecture 8 _ Linked List 2/1.Traversal in LL.txt 134B
  606. DSA1/13.Lecture 1 3a OOPS 1/3.Check Statements.txt 131B
  607. DSA1/2.Lecture2 3a Getting Started with Java/4.Valid Variable Name.txt 129B
  608. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/0.Merge Sort space.txt 127B
  609. DSA2/8.Lecture 6 3a OOPS 3/3.Incorrect Statement.txt 127B
  610. DSA1/2.Lecture2 3a Getting Started with Java/12.Short data type.txt 125B
  611. DSA2/8.Lecture 6 3a OOPS 3/1.Interface.txt 124B
  612. DSA2/6.Lecture 5 3a Time and Space Complexity Analysis/1.Merge sort.txt 123B
  613. DSA2/8.Lecture 6 3a OOPS 3/0.Final constructor.txt 123B
  614. DSA2/8.Lecture 6 3a OOPS 3/3.Invalid statement.txt 122B
  615. DSA2/9.Lecture 7 3a Linked List 1/0.Linked List Usecase.txt 116B
  616. DSA1/14.Lecture 2 3a OOPS 2/11.Valid statement.txt 115B
  617. DSA1/2.Lecture2 3a Getting Started with Java/12.Byte.txt 106B
  618. DSA2/8.Lecture 6 3a OOPS 3/3.Final class.txt 100B
  619. DSA2/11.Lecture 9 3a Stacks and Queues/0.Queue.txt 88B
  620. DSA2/11.Lecture 9 3a Stacks and Queues/0.Stack.txt 88B
  621. DSA1/10.Lecture 7 3a Searching and Sorting/16a49809-b545-437b-b919-d035da3e8d5c 1B
  622. DSA1/10.Lecture 7 3a Searching and Sorting/48fd94fd-2121-4958-981f-e73a37848233 1B
  623. DSA1/11.Lecture 8 3a Strings and 2D Arrays/0ea0b3ca-d1df-4c57-a393-782537fe770e 1B
  624. DSA1/11.Lecture 8 3a Strings and 2D Arrays/33563ea8-8310-4121-aed7-77471c22d706 1B
  625. DSA1/15.Lecture 3 3a Recursion 1/4550aca5-d548-40e7-b591-1ec6bdec6018 1B
  626. DSA2/10.Lecture 8 3a Linked List 2/4dfb7b6c-8a96-4400-863a-9e7754d4eae9 1B
  627. DSA2/10.Lecture 8 3a Linked List 2/202f9f27-36ca-49cc-965e-e3fa8f5e1ea5 1B
  628. DSA2/13.Lecture 11 3a Binary Trees/552ee00a-ce40-45ef-a9b7-53891e115a77 1B
  629. DSA2/13.Lecture 11 3a Binary Trees/abb33b5e-073c-480e-818a-64ae3d1fcb46 1B