:Search:

[Apna College] Alpha Batch 5.0 | Complete Placement Course

Torrent:
Magnet Download .torrent File
Info Hash: 25EEE12586A360305ACE93346F385630A7CB2774
Similar Posts:
Name Uploaded Size Se Le Upl. by
[Apna College] Alpha Batch 5.0 | Complete Placement Course [Apna College] Alpha Batch 5.0 | Complete Placement Course
2025-07-15 25.4 GB 0 7 Firon5
Uploader: Firon5
Source: TP Logo The Pirate Bay
Downloads: 8
Description:
[Apna College] Alpha Batch 5.0 | Complete Placement Course Master coding, DSA, and placement skills with Apna College Alpha Batch 5.0. > Become placement-ready in just 3.5 months. > Learn from industry experts through structured videos and live mentorship. > Join thousands who've landed jobs in top-tier companies. > Official website: `apnacollege.in/course/alpha-batch-5` --- # 1,339 files (25.4 GB) comprehensive material included
Category: Books
Size: 25.4 GB
Added: July 15, 2025, 9:40 a.m.
Peers: Seeders: 0, Leechers: 7 (Last updated: 9 months ago)
Tracker Data:
Tracker Seeders Leechers Completed
udp://tracker.opentrackr.org:1337/announce 0 4 3
udp://tracker.openbittorrent.com:6969/announce (Failed to scrape UDP tracker) 0 0 0
udp://tracker.internetwarriors.net:1337/announce (Failed to scrape UDP tracker) 0 0 0
udp://tracker.leechers-paradise.org:6969/announce (Failed to scrape UDP tracker) 0 0 0
udp://tracker.coppersurfer.tk:6969/announce (Failed to scrape UDP tracker) 0 0 0
udp://exodus.desync.com:6969/announce (Failed to scrape UDP tracker) 0 0 0
udp://tracker.therarbg.to:6969/announce 0 0 1
udp://tracker.tiny-vps.com:6969/announce (Failed to scrape UDP tracker) 0 0 0
udp://open.demonii.si:1337/announce (Failed to scrape UDP tracker) 0 0 0
udp://tracker.torrent.eu.org:451/announce 0 3 4
Files:
  1. ['css/style.css'] 0 bytes
  2. ['files/0. Updated Topic List.txt'] 0 bytes
  3. ['files/1. Alpha Curriculum.pdf'] 0 bytes
  4. ['files/2. Installation Resources.pdf'] 0 bytes
  5. ['files/2. Installation Resources.pdf_thumb.jpg'] 0 bytes
  6. ['files/3. Telegram Channel.pdf'] 0 bytes
  7. ['files/3. Telegram Channel.pdf_thumb.jpg'] 0 bytes
  8. ['files/4.1 Space & Time Complexity.pdf'] 0 bytes
  9. ['files/4.1 Space & Time Complexity.pdf_thumb.jpg'] 0 bytes
  10. ['files/9_Comparison Table_.mp4_thumb.jpg'] 0 bytes
  11. ['files/9_Comparison Table_.pdf'] 0 bytes
  12. ['files/AVL Trees (Reading Material).pdf'] 0 bytes
  13. ['files/AVL Trees (Reading Material).pdf_thumb.jpg'] 0 bytes
  14. ['files/Assignment in 31 (1).txt'] 0 bytes
  15. ['files/Assignment in 31.txt'] 0 bytes
  16. ['files/Assignment in 33.txt'] 0 bytes
  17. ['files/Assignment in 41 (1).txt'] 0 bytes
  18. ['files/Assignment in 41 (2).txt'] 0 bytes
  19. ['files/Assignment in 41 (3).txt'] 0 bytes
  20. ['files/Assignment in 41.txt'] 0 bytes
  21. ['files/Assignment in 48 (1).txt'] 0 bytes
  22. ['files/Assignment in 48 (2).txt'] 0 bytes
  23. ['files/Assignment in 48 (3).txt'] 0 bytes
  24. ['files/Assignment in 48 (4).txt'] 0 bytes
  25. ['files/Assignment in 48.txt'] 0 bytes
  26. ['files/Assignments in 25.txt'] 0 bytes
  27. ['files/BST Solutions.pdf'] 0 bytes
  28. ['files/BST Solutions.pdf_thumb.jpg'] 0 bytes
  29. ['files/Circular LInked List ( Reading Material).pdf'] 0 bytes
  30. ['files/Circular LInked List ( Reading Material).pdf_thumb.jpg'] 0 bytes
  31. ['files/Comparatos In Java (Reading Material).pdf'] 0 bytes
  32. ['files/Comparatos In Java (Reading Material).pdf_thumb.jpg'] 0 bytes
  33. ['files/Computer Networking Notes for Tech Placements.pdf'] 0 bytes
  34. ['files/Computer Networking Notes for Tech Placements.pdf_thumb.jpg'] 0 bytes
  35. ['files/DBMS_Notes.pdf'] 0 bytes
  36. ['files/DBMS_Notes.pdf_thumb.jpg'] 0 bytes
  37. ['files/DSA_QUES_SHEET.pdf'] 0 bytes
  38. ['files/DSA_QUES_SHEET.pdf_thumb.jpg'] 0 bytes
  39. ['files/Helpful Projects.pdf'] 0 bytes
  40. ['files/Helpful Projects.pdf_thumb.jpg'] 0 bytes
  41. ['files/Looking Forward - Advanced Pattern.pdf'] 0 bytes
  42. ['files/Looking Forward - Advanced Pattern.pdf_thumb.jpg'] 0 bytes
  43. ['files/Operating System Notes.pdf'] 0 bytes
  44. ['files/Operating System Notes.pdf_thumb.jpg'] 0 bytes
  45. ['files/Operator Precedence.pdf'] 0 bytes
  46. ['files/Operator Precedence.pdf_thumb.jpg'] 0 bytes
  47. ['files/Practice Questions (1).pdf'] 0 bytes
  48. ['files/Practice Questions (1).pdf_thumb.jpg'] 0 bytes
  49. ['files/Practice Questions (10).pdf'] 0 bytes
  50. ['files/Practice Questions (10).pdf_thumb.jpg'] 0 bytes
  51. ['files/Practice Questions (11).pdf'] 0 bytes
  52. ['files/Practice Questions (11).pdf_thumb.jpg'] 0 bytes
  53. ['files/Practice Questions (12).pdf'] 0 bytes
  54. ['files/Practice Questions (12).pdf_thumb.jpg'] 0 bytes
  55. ['files/Practice Questions (13).pdf'] 0 bytes
  56. ['files/Practice Questions (13).pdf_thumb.jpg'] 0 bytes
  57. ['files/Practice Questions (14).pdf'] 0 bytes
  58. ['files/Practice Questions (14).pdf_thumb.jpg'] 0 bytes
  59. ['files/Practice Questions (15).pdf'] 0 bytes
  60. ['files/Practice Questions (15).pdf_thumb.jpg'] 0 bytes
  61. ['files/Practice Questions (16).pdf'] 0 bytes
  62. ['files/Practice Questions (16).pdf_thumb.jpg'] 0 bytes
  63. ['files/Practice Questions (17).pdf'] 0 bytes
  64. ['files/Practice Questions (17).pdf_thumb.jpg'] 0 bytes
  65. ['files/Practice Questions (18).pdf'] 0 bytes
  66. ['files/Practice Questions (18).pdf_thumb.jpg'] 0 bytes
  67. ['files/Practice Questions (19).pdf'] 0 bytes
  68. ['files/Practice Questions (19).pdf_thumb.jpg'] 0 bytes
  69. ['files/Practice Questions (2).pdf'] 0 bytes
  70. ['files/Practice Questions (2).pdf_thumb.jpg'] 0 bytes
  71. ['files/Practice Questions (20).pdf'] 0 bytes
  72. ['files/Practice Questions (20).pdf_thumb.jpg'] 0 bytes
  73. ['files/Practice Questions (21).pdf'] 0 bytes
  74. ['files/Practice Questions (21).pdf_thumb.jpg'] 0 bytes
  75. ['files/Practice Questions (22).pdf'] 0 bytes
  76. ['files/Practice Questions (22).pdf_thumb.jpg'] 0 bytes
  77. ['files/Practice Questions (23).pdf'] 0 bytes
  78. ['files/Practice Questions (23).pdf_thumb.jpg'] 0 bytes
  79. ['files/Practice Questions (24).pdf'] 0 bytes
  80. ['files/Practice Questions (24).pdf_thumb.jpg'] 0 bytes
  81. ['files/Practice Questions (25).pdf'] 0 bytes
  82. ['files/Practice Questions (25).pdf_thumb.jpg'] 0 bytes
  83. ['files/Practice Questions (26).pdf'] 0 bytes
  84. ['files/Practice Questions (26).pdf_thumb.jpg'] 0 bytes
  85. ['files/Practice Questions (27).pdf'] 0 bytes
  86. ['files/Practice Questions (27).pdf_thumb.jpg'] 0 bytes
  87. ['files/Practice Questions (3).pdf'] 0 bytes
  88. ['files/Practice Questions (3).pdf_thumb.jpg'] 0 bytes
  89. ['files/Practice Questions (4).pdf'] 0 bytes
  90. ['files/Practice Questions (4).pdf_thumb.jpg'] 0 bytes
  91. ['files/Practice Questions (5).pdf'] 0 bytes
  92. ['files/Practice Questions (5).pdf_thumb.jpg'] 0 bytes
  93. ['files/Practice Questions (6).pdf'] 0 bytes
  94. ['files/Practice Questions (6).pdf_thumb.jpg'] 0 bytes
  95. ['files/Practice Questions (7).pdf'] 0 bytes
  96. ['files/Practice Questions (7).pdf_thumb.jpg'] 0 bytes
  97. ['files/Practice Questions (8).pdf'] 0 bytes
  98. ['files/Practice Questions (8).pdf_thumb.jpg'] 0 bytes
  99. ['files/Practice Questions (9).pdf'] 0 bytes
  100. ['files/Practice Questions (9).pdf_thumb.jpg'] 0 bytes
  101. ['files/Practice Questions.pdf'] 0 bytes
  102. ['files/Practice Questions.pdf_thumb.jpg'] 0 bytes
  103. ['files/Quantitative Aptitude-12.pdf'] 0 bytes
  104. ['files/Quantitative Aptitude-12.pdf_thumb.jpg'] 0 bytes
  105. ['files/Solution for Practice Qs (1).pdf'] 0 bytes
  106. ['files/Solution for Practice Qs (1).pdf_thumb.jpg'] 0 bytes
  107. ['files/Solution for Practice Qs (2).pdf'] 0 bytes
  108. ['files/Solution for Practice Qs (2).pdf_thumb.jpg'] 0 bytes
  109. ['files/Solution for Practice Qs (3).pdf'] 0 bytes
  110. ['files/Solution for Practice Qs (3).pdf_thumb.jpg'] 0 bytes
  111. ['files/Solution for Practice Qs (4).pdf'] 0 bytes
  112. ['files/Solution for Practice Qs (4).pdf_thumb.jpg'] 0 bytes
  113. ['files/Solution for Practice Qs (5).pdf'] 0 bytes
  114. ['files/Solution for Practice Qs (5).pdf_thumb.jpg'] 0 bytes
  115. ['files/Solution for Practice Qs (6).pdf'] 0 bytes
  116. ['files/Solution for Practice Qs (6).pdf_thumb.jpg'] 0 bytes
  117. ['files/Solution for Practice Qs (7).pdf'] 0 bytes
  118. ['files/Solution for Practice Qs (7).pdf_thumb.jpg'] 0 bytes
  119. ['files/Solution for Practice Qs (8).pdf'] 0 bytes
  120. ['files/Solution for Practice Qs (8).pdf_thumb.jpg'] 0 bytes
  121. ['files/Solution for Practice Qs (9).pdf'] 0 bytes
  122. ['files/Solution for Practice Qs (9).pdf_thumb.jpg'] 0 bytes
  123. ['files/Solution for Practice Qs.pdf'] 0 bytes
  124. ['files/Solution for Practice Qs.pdf_thumb.jpg'] 0 bytes
  125. ['files/Solutions for Practice Qs (1).pdf'] 0 bytes
  126. ['files/Solutions for Practice Qs (1).pdf_thumb.jpg'] 0 bytes
  127. ['files/Solutions for Practice Qs (10).pdf'] 0 bytes
  128. ['files/Solutions for Practice Qs (10).pdf_thumb.jpg'] 0 bytes
  129. ['files/Solutions for Practice Qs (11).pdf'] 0 bytes
  130. ['files/Solutions for Practice Qs (11).pdf_thumb.jpg'] 0 bytes
  131. ['files/Solutions for Practice Qs (12).pdf'] 0 bytes
  132. ['files/Solutions for Practice Qs (12).pdf_thumb.jpg'] 0 bytes
  133. ['files/Solutions for Practice Qs (13).pdf'] 0 bytes
  134. ['files/Solutions for Practice Qs (13).pdf_thumb.jpg'] 0 bytes
  135. ['files/Solutions for Practice Qs (14).pdf'] 0 bytes
  136. ['files/Solutions for Practice Qs (14).pdf_thumb.jpg'] 0 bytes
  137. ['files/Solutions for Practice Qs (15).pdf'] 0 bytes
  138. ['files/Solutions for Practice Qs (15).pdf_thumb.jpg'] 0 bytes
  139. ['files/Solutions for Practice Qs (16).pdf'] 0 bytes
  140. ['files/Solutions for Practice Qs (16).pdf_thumb.jpg'] 0 bytes
  141. ['files/Solutions for Practice Qs (17).pdf'] 0 bytes
  142. ['files/Solutions for Practice Qs (17).pdf_thumb.jpg'] 0 bytes
  143. ['files/Solutions for Practice Qs (2).pdf'] 0 bytes
  144. ['files/Solutions for Practice Qs (2).pdf_thumb.jpg'] 0 bytes
  145. ['files/Solutions for Practice Qs (3).pdf'] 0 bytes
  146. ['files/Solutions for Practice Qs (3).pdf_thumb.jpg'] 0 bytes
  147. ['files/Solutions for Practice Qs (4).pdf'] 0 bytes
  148. ['files/Solutions for Practice Qs (4).pdf_thumb.jpg'] 0 bytes
  149. ['files/Solutions for Practice Qs (5).pdf'] 0 bytes
  150. ['files/Solutions for Practice Qs (5).pdf_thumb.jpg'] 0 bytes
  151. ['files/Solutions for Practice Qs (6).pdf'] 0 bytes
  152. ['files/Solutions for Practice Qs (6).pdf_thumb.jpg'] 0 bytes
  153. ['files/Solutions for Practice Qs (7).pdf'] 0 bytes
  154. ['files/Solutions for Practice Qs (7).pdf_thumb.jpg'] 0 bytes
  155. ['files/Solutions for Practice Qs (8).pdf'] 0 bytes
  156. ['files/Solutions for Practice Qs (8).pdf_thumb.jpg'] 0 bytes
  157. ['files/Solutions for Practice Qs (9).pdf'] 0 bytes
  158. ['files/Solutions for Practice Qs (9).pdf_thumb.jpg'] 0 bytes
  159. ['files/Solutions for Practice Qs.pdf'] 0 bytes
  160. ['files/Solutions for Practice Qs.pdf_thumb.jpg'] 0 bytes
  161. ['images/back.png'] 0 bytes
  162. ['images/[email protected]'] 0 bytes
  163. ['images/media_call.png'] 0 bytes
  164. ['images/[email protected]'] 0 bytes
  165. ['images/media_contact.png'] 0 bytes
  166. ['images/[email protected]'] 0 bytes
  167. ['images/media_file.png'] 0 bytes
  168. ['images/[email protected]'] 0 bytes
  169. ['images/media_game.png'] 0 bytes
  170. ['images/[email protected]'] 0 bytes
  171. ['images/media_location.png'] 0 bytes
  172. ['images/[email protected]'] 0 bytes
  173. ['images/media_music.png'] 0 bytes
  174. ['images/[email protected]'] 0 bytes
  175. ['images/media_photo.png'] 0 bytes
  176. ['images/[email protected]'] 0 bytes
  177. ['images/media_shop.png'] 0 bytes
  178. ['images/[email protected]'] 0 bytes
  179. ['images/media_video.png'] 0 bytes
  180. ['images/[email protected]'] 0 bytes
  181. ['images/media_voice.png'] 0 bytes
  182. ['images/[email protected]'] 0 bytes
  183. ['images/section_calls.png'] 0 bytes
  184. ['images/[email protected]'] 0 bytes
  185. ['images/section_chats.png'] 0 bytes
  186. ['images/[email protected]'] 0 bytes
  187. ['images/section_contacts.png'] 0 bytes
  188. ['images/[email protected]'] 0 bytes
  189. ['images/section_frequent.png'] 0 bytes
  190. ['images/[email protected]'] 0 bytes
  191. ['images/section_other.png'] 0 bytes
  192. ['images/[email protected]'] 0 bytes
  193. ['images/section_photos.png'] 0 bytes
  194. ['images/[email protected]'] 0 bytes
  195. ['images/section_sessions.png'] 0 bytes
  196. ['images/[email protected]'] 0 bytes
  197. ['images/section_stories.png'] 0 bytes
  198. ['images/[email protected]'] 0 bytes
  199. ['images/section_web.png'] 0 bytes
  200. ['images/[email protected]'] 0 bytes
  201. ['js/script.js'] 0 bytes
  202. ['photos/photo_10@07-07-2025_08-34-56.jpg'] 0 bytes
  203. ['photos/photo_10@07-07-2025_08-34-56_thumb.jpg'] 0 bytes
  204. ['photos/photo_11@07-07-2025_08-35-09.jpg'] 0 bytes
  205. ['photos/photo_11@07-07-2025_08-35-09_thumb.jpg'] 0 bytes
  206. ['photos/photo_12@07-07-2025_08-35-23.jpg'] 0 bytes
  207. ['photos/photo_12@07-07-2025_08-35-23_thumb.jpg'] 0 bytes
  208. ['photos/photo_13@07-07-2025_08-35-34.jpg'] 0 bytes
  209. ['photos/photo_13@07-07-2025_08-35-34_thumb.jpg'] 0 bytes
  210. ['photos/photo_14@07-07-2025_08-35-37.jpg'] 0 bytes
  211. ['photos/photo_14@07-07-2025_08-35-37_thumb.jpg'] 0 bytes
  212. ['photos/photo_15@07-07-2025_08-35-42.jpg'] 0 bytes
  213. ['photos/photo_15@07-07-2025_08-35-42_thumb.jpg'] 0 bytes
  214. ['photos/photo_16@07-07-2025_08-35-55.jpg'] 0 bytes
  215. ['photos/photo_16@07-07-2025_08-35-55_thumb.jpg'] 0 bytes
  216. ['photos/photo_17@07-07-2025_08-35-55.jpg'] 0 bytes
  217. ['photos/photo_17@07-07-2025_08-35-55_thumb.jpg'] 0 bytes
  218. ['photos/photo_18@07-07-2025_08-36-05.jpg'] 0 bytes
  219. ['photos/photo_18@07-07-2025_08-36-05_thumb.jpg'] 0 bytes
  220. ['photos/photo_19@07-07-2025_08-36-15.jpg'] 0 bytes
  221. ['photos/photo_19@07-07-2025_08-36-15_thumb.jpg'] 0 bytes
  222. ['photos/photo_1@07-07-2025_08-33-57.jpg'] 0 bytes
  223. ['photos/photo_1@07-07-2025_08-33-57_thumb.jpg'] 0 bytes
  224. ['photos/photo_20@07-07-2025_08-36-25.jpg'] 0 bytes
  225. ['photos/photo_20@07-07-2025_08-36-25_thumb.jpg'] 0 bytes
  226. ['photos/photo_21@07-07-2025_08-36-34.jpg'] 0 bytes
  227. ['photos/photo_21@07-07-2025_08-36-34_thumb.jpg'] 0 bytes
  228. ['photos/photo_22@07-07-2025_08-36-35.jpg'] 0 bytes
  229. ['photos/photo_22@07-07-2025_08-36-35_thumb.jpg'] 0 bytes
  230. ['photos/photo_23@07-07-2025_08-36-45.jpg'] 0 bytes
  231. ['photos/photo_23@07-07-2025_08-36-45_thumb.jpg'] 0 bytes
  232. ['photos/photo_24@07-07-2025_08-36-56.jpg'] 0 bytes
  233. ['photos/photo_24@07-07-2025_08-36-56_thumb.jpg'] 0 bytes
  234. ['photos/photo_25@07-07-2025_08-37-01.jpg'] 0 bytes
  235. ['photos/photo_25@07-07-2025_08-37-01_thumb.jpg'] 0 bytes
  236. ['photos/photo_26@07-07-2025_08-37-08.jpg'] 0 bytes
  237. ['photos/photo_26@07-07-2025_08-37-08_thumb.jpg'] 0 bytes
  238. ['photos/photo_27@07-07-2025_08-37-18.jpg'] 0 bytes
  239. ['photos/photo_27@07-07-2025_08-37-18_thumb.jpg'] 0 bytes
  240. ['photos/photo_28@07-07-2025_08-37-27.jpg'] 0 bytes
  241. ['photos/photo_28@07-07-2025_08-37-27_thumb.jpg'] 0 bytes
  242. ['photos/photo_29@07-07-2025_08-37-37.jpg'] 0 bytes
  243. ['photos/photo_29@07-07-2025_08-37-37_thumb.jpg'] 0 bytes
  244. ['photos/photo_2@07-07-2025_08-33-59.jpg'] 0 bytes
  245. ['photos/photo_2@07-07-2025_08-33-59_thumb.jpg'] 0 bytes
  246. ['photos/photo_30@07-07-2025_08-37-45.jpg'] 0 bytes
  247. ['photos/photo_30@07-07-2025_08-37-45_thumb.jpg'] 0 bytes
  248. ['photos/photo_31@07-07-2025_08-37-53.jpg'] 0 bytes
  249. ['photos/photo_31@07-07-2025_08-37-53_thumb.jpg'] 0 bytes
  250. ['photos/photo_32@07-07-2025_08-37-58.jpg'] 0 bytes
  251. ['photos/photo_32@07-07-2025_08-37-58_thumb.jpg'] 0 bytes
  252. ['photos/photo_33@07-07-2025_08-38-03.jpg'] 0 bytes
  253. ['photos/photo_33@07-07-2025_08-38-03_thumb.jpg'] 0 bytes
  254. ['photos/photo_34@07-07-2025_08-38-09.jpg'] 0 bytes
  255. ['photos/photo_34@07-07-2025_08-38-09_thumb.jpg'] 0 bytes
  256. ['photos/photo_35@07-07-2025_08-38-14.jpg'] 0 bytes
  257. ['photos/photo_35@07-07-2025_08-38-14_thumb.jpg'] 0 bytes
  258. ['photos/photo_36@07-07-2025_08-38-23.jpg'] 0 bytes
  259. ['photos/photo_36@07-07-2025_08-38-23_thumb.jpg'] 0 bytes
  260. ['photos/photo_37@07-07-2025_08-38-36.jpg'] 0 bytes
  261. ['photos/photo_37@07-07-2025_08-38-36_thumb.jpg'] 0 bytes
  262. ['photos/photo_38@07-07-2025_08-38-44.jpg'] 0 bytes
  263. ['photos/photo_38@07-07-2025_08-38-44_thumb.jpg'] 0 bytes
  264. ['photos/photo_39@07-07-2025_08-38-49.jpg'] 0 bytes
  265. ['photos/photo_39@07-07-2025_08-38-49_thumb.jpg'] 0 bytes
  266. ['photos/photo_3@07-07-2025_08-34-02.jpg'] 0 bytes
  267. ['photos/photo_3@07-07-2025_08-34-02_thumb.jpg'] 0 bytes
  268. ['photos/photo_40@07-07-2025_08-38-53.jpg'] 0 bytes
  269. ['photos/photo_40@07-07-2025_08-38-53_thumb.jpg'] 0 bytes
  270. ['photos/photo_41@07-07-2025_08-38-57.jpg'] 0 bytes
  271. ['photos/photo_41@07-07-2025_08-38-57_thumb.jpg'] 0 bytes
  272. ['photos/photo_42@07-07-2025_08-39-00.jpg'] 0 bytes
  273. ['photos/photo_42@07-07-2025_08-39-00_thumb.jpg'] 0 bytes
  274. ['photos/photo_43@07-07-2025_08-39-05.jpg'] 0 bytes
  275. ['photos/photo_43@07-07-2025_08-39-05_thumb.jpg'] 0 bytes
  276. ['photos/photo_44@07-07-2025_08-39-07.jpg'] 0 bytes
  277. ['photos/photo_44@07-07-2025_08-39-07_thumb.jpg'] 0 bytes
  278. ['photos/photo_45@07-07-2025_08-39-12.jpg'] 0 bytes
  279. ['photos/photo_45@07-07-2025_08-39-12_thumb.jpg'] 0 bytes
  280. ['photos/photo_46@07-07-2025_08-39-17.jpg'] 0 bytes
  281. ['photos/photo_46@07-07-2025_08-39-17_thumb.jpg'] 0 bytes
  282. ['photos/photo_47@07-07-2025_08-39-21.jpg'] 0 bytes
  283. ['photos/photo_47@07-07-2025_08-39-21_thumb.jpg'] 0 bytes
  284. ['photos/photo_48@07-07-2025_08-39-25.jpg'] 0 bytes
  285. ['photos/photo_48@07-07-2025_08-39-25_thumb.jpg'] 0 bytes
  286. ['photos/photo_49@07-07-2025_08-39-29.jpg'] 0 bytes
  287. ['photos/photo_49@07-07-2025_08-39-29_thumb.jpg'] 0 bytes
  288. ['photos/photo_4@07-07-2025_08-34-03.jpg'] 0 bytes
  289. ['photos/photo_4@07-07-2025_08-34-03_thumb.jpg'] 0 bytes
  290. ['photos/photo_50@07-07-2025_08-39-34.jpg'] 0 bytes
  291. ['photos/photo_50@07-07-2025_08-39-34_thumb.jpg'] 0 bytes
  292. ['photos/photo_5@07-07-2025_08-34-16.jpg'] 0 bytes
  293. ['photos/photo_5@07-07-2025_08-34-16_thumb.jpg'] 0 bytes
  294. ['photos/photo_6@07-07-2025_08-34-23.jpg'] 0 bytes
  295. ['photos/photo_6@07-07-2025_08-34-23_thumb.jpg'] 0 bytes
  296. ['photos/photo_7@07-07-2025_08-34-34.jpg'] 0 bytes
  297. ['photos/photo_7@07-07-2025_08-34-34_thumb.jpg'] 0 bytes
  298. ['photos/photo_8@07-07-2025_08-34-40.jpg'] 0 bytes
  299. ['photos/photo_8@07-07-2025_08-34-40_thumb.jpg'] 0 bytes
  300. ['photos/photo_9@07-07-2025_08-34-47.jpg'] 0 bytes
  301. ['photos/photo_9@07-07-2025_08-34-47_thumb.jpg'] 0 bytes
  302. ['video_files/1 (1). Introduction.mp4'] 0 bytes
  303. ['video_files/1 (1). Introduction.mp4_thumb.jpg'] 0 bytes
  304. ['video_files/1 (2). Introduction.mp4'] 0 bytes
  305. ['video_files/1 (2). Introduction.mp4_thumb.jpg'] 0 bytes
  306. ['video_files/1 (3). Introduction.mp4'] 0 bytes
  307. ['video_files/1 (3). Introduction.mp4_thumb.jpg'] 0 bytes
  308. ['video_files/1. (For New Students) Bonus Live Session.mp4'] 0 bytes
  309. ['video_files/1. (For New Students) Bonus Live Session.mp4_thumb.jpg'] 0 bytes
  310. ['video_files/1. Basics of Matrices (Math).mp4'] 0 bytes
  311. ['video_files/1. Basics of Matrices (Math).mp4_thumb.jpg'] 0 bytes
  312. ['video_files/1. Bellman Ford Algorithm.mp4'] 0 bytes
  313. ['video_files/1. Bellman Ford Algorithm.mp4_thumb.jpg'] 0 bytes
  314. ['video_files/1. Cheapest Flights within K Stops.mp4'] 0 bytes
  315. ['video_files/1. Cheapest Flights within K Stops.mp4_thumb.jpg'] 0 bytes
  316. ['video_files/1. Classes & Objects.mp4'] 0 bytes
  317. ['video_files/1. Classes & Objects.mp4_thumb.jpg'] 0 bytes
  318. ['video_files/1. Coin Change (Live Class).mp4'] 0 bytes
  319. ['video_files/1. Coin Change (Live Class).mp4_thumb.jpg'] 0 bytes
  320. ['video_files/1. Connected Components.mp4'] 0 bytes
  321. ['video_files/1. Connected Components.mp4_thumb.jpg'] 0 bytes
  322. ['video_files/1. Creating A Java File.mp4'] 0 bytes
  323. ['video_files/1. Creating A Java File.mp4_thumb.jpg'] 0 bytes
  324. ['video_files/1. Detecting Cycle in LL.mp4'] 0 bytes
  325. ['video_files/1. Detecting Cycle in LL.mp4_thumb.jpg'] 0 bytes
  326. ['video_files/1. Diameter of a Tree (Approach1).mp4'] 0 bytes
  327. ['video_files/1. Diameter of a Tree (Approach1).mp4_thumb.jpg'] 0 bytes
  328. ['video_files/1. Hashing Introduction.mp4'] 0 bytes
  329. ['video_files/1. Hashing Introduction.mp4_thumb.jpg'] 0 bytes
  330. ['video_files/1. Hollow Rectangle Pattern.mp4'] 0 bytes
  331. ['video_files/1. Hollow Rectangle Pattern.mp4_thumb.jpg'] 0 bytes
  332. ['video_files/1. If Else.mp4'] 0 bytes
  333. ['video_files/1. If Else.mp4_thumb.jpg'] 0 bytes
  334. ['video_files/1. Introduction To 2D Arrays.mp4'] 0 bytes
  335. ['video_files/1. Introduction To 2D Arrays.mp4_thumb.jpg'] 0 bytes
  336. ['video_files/1. Introduction To Bit Manipulation.mp4'] 0 bytes
  337. ['video_files/1. Introduction To Bit Manipulation.mp4_thumb.jpg'] 0 bytes
  338. ['video_files/1. Introduction To Function.mp4'] 0 bytes
  339. ['video_files/1. Introduction To Function.mp4_thumb.jpg'] 0 bytes
  340. ['video_files/1. Introduction to ArrayList.mp4'] 0 bytes
  341. ['video_files/1. Introduction to ArrayList.mp4_thumb.jpg'] 0 bytes
  342. ['video_files/1. Introduction to Binary Trees.mp4'] 0 bytes
  343. ['video_files/1. Introduction to Binary Trees.mp4_thumb.jpg'] 0 bytes
  344. ['video_files/1. Introduction to DP.mp4'] 0 bytes
  345. ['video_files/1. Introduction to DP.mp4_thumb.jpg'] 0 bytes
  346. ['video_files/1. Introduction to Graphs.mp4'] 0 bytes
  347. ['video_files/1. Introduction to Graphs.mp4_thumb.jpg'] 0 bytes
  348. ['video_files/1. Introduction to Greedy.mp4'] 0 bytes
  349. ['video_files/1. Introduction to Greedy.mp4_thumb.jpg'] 0 bytes
  350. ['video_files/1. Introduction to Linked List.mp4'] 0 bytes
  351. ['video_files/1. Introduction to Linked List.mp4_thumb.jpg'] 0 bytes
  352. ['video_files/1. Introduction to Priority Queues.mp4'] 0 bytes
  353. ['video_files/1. Introduction to Priority Queues.mp4_thumb.jpg'] 0 bytes
  354. ['video_files/1. Introduction to Queues.mp4'] 0 bytes
  355. ['video_files/1. Introduction to Queues.mp4_thumb.jpg'] 0 bytes
  356. ['video_files/1. Introduction.mp4'] 0 bytes
  357. ['video_files/1. Introduction.mp4_thumb.jpg'] 0 bytes
  358. ['video_files/1. Kth Level of a Tree.mp4'] 0 bytes
  359. ['video_files/1. Kth Level of a Tree.mp4_thumb.jpg'] 0 bytes
  360. ['video_files/1. Longest Common Substring.mp4'] 0 bytes
  361. ['video_files/1. Longest Common Substring.mp4_thumb.jpg'] 0 bytes
  362. ['video_files/1. Loops Basics.mp4'] 0 bytes
  363. ['video_files/1. Loops Basics.mp4_thumb.jpg'] 0 bytes
  364. ['video_files/1. Path to Placement_1.mp4'] 0 bytes
  365. ['video_files/1. Path to Placement_1.mp4_thumb.jpg'] 0 bytes
  366. ['video_files/1. Print Star Pattern.mp4'] 0 bytes
  367. ['video_files/1. Print Star Pattern.mp4_thumb.jpg'] 0 bytes
  368. ['video_files/1. Segment Trees Introduction.mp4'] 0 bytes
  369. ['video_files/1. Segment Trees Introduction.mp4_thumb.jpg'] 0 bytes
  370. ['video_files/1. Sorted Array to Balanced BST.mp4'] 0 bytes
  371. ['video_files/1. Sorted Array to Balanced BST.mp4_thumb.jpg'] 0 bytes
  372. ['video_files/1. Stack Introduction.mp4'] 0 bytes
  373. ['video_files/1. Stack Introduction.mp4_thumb.jpg'] 0 bytes
  374. ["video_files/1. Strongly Connected Components (Kosaraju's Algorithm).mp4"] 0 bytes
  375. ["video_files/1. Strongly Connected Components (Kosaraju's Algorithm).mp4_thumb.jpg"] 0 bytes
  376. ["video_files/1. Topological Sort using BFS (Kahn's Algorithm).mp4"] 0 bytes
  377. ["video_files/1. Topological Sort using BFS (Kahn's Algorithm).mp4_thumb.jpg"] 0 bytes
  378. ['video_files/1. Tries Introduction.mp4'] 0 bytes
  379. ['video_files/1. Tries Introduction.mp4_thumb.jpg'] 0 bytes
  380. ['video_files/1. Types of Knapsack problems.mp4'] 0 bytes
  381. ['video_files/1. Types of Knapsack problems.mp4_thumb.jpg'] 0 bytes
  382. ['video_files/1. Types of Operators.mp4'] 0 bytes
  383. ['video_files/1. Types of Operators.mp4_thumb.jpg'] 0 bytes
  384. ['video_files/1. What Is Sorting.mp4'] 0 bytes
  385. ['video_files/1. What Is Sorting.mp4_thumb.jpg'] 0 bytes
  386. ['video_files/1. What are Flowcharts.mp4'] 0 bytes
  387. ['video_files/1. What are Flowcharts.mp4_thumb.jpg'] 0 bytes
  388. ['video_files/1. What are Strings.mp4'] 0 bytes
  389. ['video_files/1. What are Strings.mp4_thumb.jpg'] 0 bytes
  390. ['video_files/1. What to Install (on your laptopcomputer)_1.mp4'] 0 bytes
  391. ['video_files/1. What to Install (on your laptopcomputer)_1.mp4_thumb.jpg'] 0 bytes
  392. ['video_files/1. Wildcard Matching - Hard (Explanation).mp4'] 0 bytes
  393. ['video_files/1. Wildcard Matching - Hard (Explanation).mp4_thumb.jpg'] 0 bytes
  394. ['video_files/1.What is Divide & Conquer%3f.mp4'] 0 bytes
  395. ['video_files/1.What is Divide & Conquer%3f.mp4_thumb.jpg'] 0 bytes
  396. ['video_files/1.What is Recursion%3f.mp4'] 0 bytes
  397. ['video_files/1.What is Recursion%3f.mp4_thumb.jpg'] 0 bytes
  398. ['video_files/10 - Check If Odd Or Even.mp4'] 0 bytes
  399. ['video_files/10 - Check If Odd Or Even.mp4_thumb.jpg'] 0 bytes
  400. ['video_files/10. Calculator.mp4'] 0 bytes
  401. ['video_files/10. Calculator.mp4_thumb.jpg'] 0 bytes
  402. ['video_files/10. Container with Most Water (Brute Force).mp4'] 0 bytes
  403. ['video_files/10. Container with Most Water (Brute Force).mp4_thumb.jpg'] 0 bytes
  404. ['video_files/10. Counting Sort Code.mp4'] 0 bytes
  405. ['video_files/10. Counting Sort Code.mp4_thumb.jpg'] 0 bytes
  406. ['video_files/10. Diamond Patter.mp4'] 0 bytes
  407. ['video_files/10. Diamond Patter.mp4_thumb.jpg'] 0 bytes
  408. ['video_files/10. Do While Loop.mp4'] 0 bytes
  409. ['video_files/10. Do While Loop.mp4_thumb.jpg'] 0 bytes
  410. ['video_files/10. Height of a Tree.mp4'] 0 bytes
  411. ['video_files/10. Height of a Tree.mp4_thumb.jpg'] 0 bytes
  412. ['video_files/10. Inbuilt vs User Defined Methods.mp4'] 0 bytes
  413. ['video_files/10. Inbuilt vs User Defined Methods.mp4_thumb.jpg'] 0 bytes
  414. ['video_files/10. Inheritance.mp4'] 0 bytes
  415. ['video_files/10. Inheritance.mp4_thumb.jpg'] 0 bytes
  416. ['video_files/10. Iterative Search.mp4'] 0 bytes
  417. ['video_files/10. Iterative Search.mp4_thumb.jpg'] 0 bytes
  418. ['video_files/10. Job Sequencing Problem.mp4'] 0 bytes
  419. ['video_files/10. Job Sequencing Problem.mp4_thumb.jpg'] 0 bytes
  420. ['video_files/10. Last Occurrence.mp4'] 0 bytes
  421. ['video_files/10. Last Occurrence.mp4_thumb.jpg'] 0 bytes
  422. ['video_files/10. Longest Word with all Prefixes.mp4'] 0 bytes
  423. ['video_files/10. Longest Word with all Prefixes.mp4_thumb.jpg'] 0 bytes
  424. ['video_files/10. Majority Element.mp4'] 0 bytes
  425. ['video_files/10. Majority Element.mp4_thumb.jpg'] 0 bytes
  426. ['video_files/10. N Queens - count ways.mp4'] 0 bytes
  427. ['video_files/10. N Queens - count ways.mp4_thumb.jpg'] 0 bytes
  428. ['video_files/10. Nearby Cars.mp4'] 0 bytes
  429. ['video_files/10. Nearby Cars.mp4_thumb.jpg'] 0 bytes
  430. ['video_files/10. Nested Loop 2 Analysis.mp4'] 0 bytes
  431. ['video_files/10. Nested Loop 2 Analysis.mp4_thumb.jpg'] 0 bytes
  432. ['video_files/10. Next greater element Code.mp4'] 0 bytes
  433. ['video_files/10. Next greater element Code.mp4_thumb.jpg'] 0 bytes
  434. ['video_files/10. Pairs In Array.mp4'] 0 bytes
  435. ['video_files/10. Pairs In Array.mp4_thumb.jpg'] 0 bytes
  436. ['video_files/10. Queue Reversal.mp4'] 0 bytes
  437. ['video_files/10. Queue Reversal.mp4_thumb.jpg'] 0 bytes
  438. ['video_files/10. Search In Sorted Matrix Code.mp4'] 0 bytes
  439. ['video_files/10. Search In Sorted Matrix Code.mp4_thumb.jpg'] 0 bytes
  440. ['video_files/10. Sum Of a&b (Input From User).mp4'] 0 bytes
  441. ['video_files/10. Sum Of a&b (Input From User).mp4_thumb.jpg'] 0 bytes
  442. ['video_files/10. Zig Zag Linked List.mp4'] 0 bytes
  443. ['video_files/10. Zig Zag Linked List.mp4_thumb.jpg'] 0 bytes
  444. ['video_files/10.Print Largest String.mp4'] 0 bytes
  445. ['video_files/10.Print Largest String.mp4_thumb.jpg'] 0 bytes
  446. ['video_files/11 - Get ith Bit.mp4'] 0 bytes
  447. ['video_files/11 - Get ith Bit.mp4_thumb.jpg'] 0 bytes
  448. ['video_files/11. Print x to the power n.mp4'] 0 bytes
  449. ['video_files/11. Print x to the power n.mp4_thumb.jpg'] 0 bytes
  450. ['video_files/11. Single level Inheritance .mp4'] 0 bytes
  451. ['video_files/11. Single level Inheritance .mp4_thumb.jpg'] 0 bytes
  452. ['video_files/11. Break Statement.mp4'] 0 bytes
  453. ['video_files/11. Break Statement.mp4_thumb.jpg'] 0 bytes
  454. ['video_files/11. Chocola Problem.mp4'] 0 bytes
  455. ['video_files/11. Chocola Problem.mp4_thumb.jpg'] 0 bytes
  456. ['video_files/11. Connect N Ropes with Minimum Cost.mp4'] 0 bytes
  457. ['video_files/11. Connect N Ropes with Minimum Cost.mp4_thumb.jpg'] 0 bytes
  458. ['video_files/11. Container with Most Water (2 Pointer Approach).mp4'] 0 bytes
  459. ['video_files/11. Container with Most Water (2 Pointer Approach).mp4_thumb.jpg'] 0 bytes
  460. ['video_files/11. Count Nodes of a Tree.mp4'] 0 bytes
  461. ['video_files/11. Count Nodes of a Tree.mp4_thumb.jpg'] 0 bytes
  462. ['video_files/11. Deque (Double Ended Queue).mp4'] 0 bytes
  463. ['video_files/11. Deque (Double Ended Queue).mp4_thumb.jpg'] 0 bytes
  464. ['video_files/11. Function Overloading.mp4'] 0 bytes
  465. ['video_files/11. Function Overloading.mp4_thumb.jpg'] 0 bytes
  466. ['video_files/11. N Queens - print one solution.mp4'] 0 bytes
  467. ['video_files/11. N Queens - print one solution.mp4_thumb.jpg'] 0 bytes
  468. ['video_files/11. Nested Loop 3 Analysis.mp4'] 0 bytes
  469. ['video_files/11. Nested Loop 3 Analysis.mp4_thumb.jpg'] 0 bytes
  470. ['video_files/11. PRODUCTS OF A & B.mp4'] 0 bytes
  471. ['video_files/11. PRODUCTS OF A & B.mp4_thumb.jpg'] 0 bytes
  472. ['video_files/11. Print Subarrays.mp4'] 0 bytes
  473. ['video_files/11. Print Subarrays.mp4_thumb.jpg'] 0 bytes
  474. ['video_files/11. Recursive Search.mp4'] 0 bytes
  475. ['video_files/11. Recursive Search.mp4_thumb.jpg'] 0 bytes
  476. ['video_files/11. Valid Anagram.mp4'] 0 bytes
  477. ['video_files/11. Valid Anagram.mp4_thumb.jpg'] 0 bytes
  478. ['video_files/11. Valid Parentheses.mp4'] 0 bytes
  479. ['video_files/11. Valid Parentheses.mp4_thumb.jpg'] 0 bytes
  480. ['video_files/11. Why Strings Are Immutable.mp4'] 0 bytes
  481. ['video_files/11. Why Strings Are Immutable.mp4_thumb.jpg'] 0 bytes
  482. ['video_files/11. Zig Zag LL Code.mp4'] 0 bytes
  483. ['video_files/11. Zig Zag LL Code.mp4_thumb.jpg'] 0 bytes
  484. ['video_files/12 - Set ith Bit.mp4'] 0 bytes
  485. ['video_files/12 - Set ith Bit.mp4_thumb.jpg'] 0 bytes
  486. ['video_files/12. Area Of Circle.mp4'] 0 bytes
  487. ['video_files/12. Area Of Circle.mp4_thumb.jpg'] 0 bytes
  488. ['video_files/12. Bubble Sort Analysis.mp4'] 0 bytes
  489. ['video_files/12. Bubble Sort Analysis.mp4_thumb.jpg'] 0 bytes
  490. ['video_files/12. Chocola Problem Code.mp4'] 0 bytes
  491. ['video_files/12. Chocola Problem Code.mp4_thumb.jpg'] 0 bytes
  492. ['video_files/12. Container wMW vs. Trapping Rainwater.mp4'] 0 bytes
  493. ['video_files/12. Container wMW vs. Trapping Rainwater.mp4_thumb.jpg'] 0 bytes
  494. ['video_files/12. Deque in JCF.mp4'] 0 bytes
  495. ['video_files/12. Deque in JCF.mp4_thumb.jpg'] 0 bytes
  496. ['video_files/12. Doubly LL.mp4'] 0 bytes
  497. ['video_files/12. Doubly LL.mp4_thumb.jpg'] 0 bytes
  498. ['video_files/12. Grid Ways.mp4'] 0 bytes
  499. ['video_files/12. Grid Ways.mp4_thumb.jpg'] 0 bytes
  500. ['video_files/12. HashSet.mp4'] 0 bytes
  501. ['video_files/12. HashSet.mp4_thumb.jpg'] 0 bytes
  502. ['video_files/12. Max-Subarray Sum - I (Brute Force).mp4'] 0 bytes
  503. ['video_files/12. Max-Subarray Sum - I (Brute Force).mp4_thumb.jpg'] 0 bytes
  504. ['video_files/12. Multi Level Inheritance.mp4'] 0 bytes
  505. ['video_files/12. Multi Level Inheritance.mp4_thumb.jpg'] 0 bytes
  506. ['video_files/12. Overloading Using Parameters.mp4'] 0 bytes
  507. ['video_files/12. Overloading Using Parameters.mp4_thumb.jpg'] 0 bytes
  508. ['video_files/12. Print x to the power n (Optimized) .mp4'] 0 bytes
  509. ['video_files/12. Print x to the power n (Optimized) .mp4_thumb.jpg'] 0 bytes
  510. ['video_files/12. Question - Break Statement.mp4'] 0 bytes
  511. ['video_files/12. Question - Break Statement.mp4_thumb.jpg'] 0 bytes
  512. ['video_files/12. Reverse a LL.mp4'] 0 bytes
  513. ['video_files/12. Reverse a LL.mp4_thumb.jpg'] 0 bytes
  514. ['video_files/12. String Builder.mp4'] 0 bytes
  515. ['video_files/12. String Builder.mp4_thumb.jpg'] 0 bytes
  516. ['video_files/12. Sum of Nodes.mp4'] 0 bytes
  517. ['video_files/12. Sum of Nodes.mp4_thumb.jpg'] 0 bytes
  518. ['video_files/12. Valid Parentheses Code.mp4'] 0 bytes
  519. ['video_files/12. Valid Parentheses Code.mp4_thumb.jpg'] 0 bytes
  520. ['video_files/12. Weakest Soldier.mp4'] 0 bytes
  521. ['video_files/12. Weakest Soldier.mp4_thumb.jpg'] 0 bytes
  522. ['video_files/13 - Clear ith Bit.mp4'] 0 bytes
  523. ['video_files/13 - Clear ith Bit.mp4_thumb.jpg'] 0 bytes
  524. ['video_files/13. Tiling Problem .mp4'] 0 bytes
  525. ['video_files/13. Tiling Problem .mp4_thumb.jpg'] 0 bytes
  526. ['video_files/13. Binary Search Analysis.mp4'] 0 bytes
  527. ['video_files/13. Binary Search Analysis.mp4_thumb.jpg'] 0 bytes
  528. ['video_files/13. Continue Statement.mp4'] 0 bytes
  529. ['video_files/13. Continue Statement.mp4_thumb.jpg'] 0 bytes
  530. ['video_files/13. Convert Letters To Uppercase.mp4'] 0 bytes
  531. ['video_files/13. Convert Letters To Uppercase.mp4_thumb.jpg'] 0 bytes
  532. ['video_files/13. Diameter of a Tree (Approach1).mp4'] 0 bytes
  533. ['video_files/13. Diameter of a Tree (Approach1).mp4_thumb.jpg'] 0 bytes
  534. ['video_files/13. Duplicate Parentheses.mp4'] 0 bytes
  535. ['video_files/13. Duplicate Parentheses.mp4_thumb.jpg'] 0 bytes
  536. ['video_files/13. Find and Remove Nth Node from End.mp4'] 0 bytes
  537. ['video_files/13. Find and Remove Nth Node from End.mp4_thumb.jpg'] 0 bytes
  538. ['video_files/13. Grid Ways Code.mp4'] 0 bytes
  539. ['video_files/13. Grid Ways Code.mp4_thumb.jpg'] 0 bytes
  540. ['video_files/13. Hierarchial Inheritance.mp4'] 0 bytes
  541. ['video_files/13. Hierarchial Inheritance.mp4_thumb.jpg'] 0 bytes
  542. ['video_files/13. Implement Stack using Deque.mp4'] 0 bytes
  543. ['video_files/13. Implement Stack using Deque.mp4_thumb.jpg'] 0 bytes
  544. ['video_files/13. Iteration on HashSets.mp4'] 0 bytes
  545. ['video_files/13. Iteration on HashSets.mp4_thumb.jpg'] 0 bytes
  546. ['video_files/13. Max-Subarray Sum - II (Prifix Sum).mp4'] 0 bytes
  547. ['video_files/13. Max-Subarray Sum - II (Prifix Sum).mp4_thumb.jpg'] 0 bytes
  548. ['video_files/13. Overloading Using Data Types - Copy.mp4'] 0 bytes
  549. ['video_files/13. Overloading Using Data Types - Copy.mp4_thumb.jpg'] 0 bytes
  550. ['video_files/13. Pair Sum-1 (Brute Force).mp4'] 0 bytes
  551. ['video_files/13. Pair Sum-1 (Brute Force).mp4_thumb.jpg'] 0 bytes
  552. ['video_files/13. Reverse a Doubly LL.mp4'] 0 bytes
  553. ['video_files/13. Reverse a Doubly LL.mp4_thumb.jpg'] 0 bytes
  554. ['video_files/13. Sliding Window Maximum.mp4'] 0 bytes
  555. ['video_files/13. Sliding Window Maximum.mp4_thumb.jpg'] 0 bytes
  556. ['video_files/13. Type Conversion.mp4'] 0 bytes
  557. ['video_files/13. Type Conversion.mp4_thumb.jpg'] 0 bytes
  558. ['video_files/14 - Update ith Bit.mp4'] 0 bytes
  559. ['video_files/14 - Update ith Bit.mp4_thumb.jpg'] 0 bytes
  560. ['video_files/14. Check If Number Is Prime Or Not.mp4'] 0 bytes
  561. ['video_files/14. Check If Number Is Prime Or Not.mp4_thumb.jpg'] 0 bytes
  562. ['video_files/14. Check if LL is Palindrome.mp4'] 0 bytes
  563. ['video_files/14. Check if LL is Palindrome.mp4_thumb.jpg'] 0 bytes
  564. ['video_files/14. Circular LL (Approach).mp4'] 0 bytes
  565. ['video_files/14. Circular LL (Approach).mp4_thumb.jpg'] 0 bytes
  566. ['video_files/14. Diameter of a Tree (Approach2) .mp4'] 0 bytes
  567. ['video_files/14. Diameter of a Tree (Approach2) .mp4_thumb.jpg'] 0 bytes
  568. ['video_files/14. Duplicate Parentheses Code.mp4'] 0 bytes
  569. ['video_files/14. Duplicate Parentheses Code.mp4_thumb.jpg'] 0 bytes
  570. ['video_files/14. Grid Ways Trick.mp4'] 0 bytes
  571. ['video_files/14. Grid Ways Trick.mp4_thumb.jpg'] 0 bytes
  572. ['video_files/14. Hybrid Inheritance.mp4'] 0 bytes
  573. ['video_files/14. Hybrid Inheritance.mp4_thumb.jpg'] 0 bytes
  574. ['video_files/14. Implement Queue using Deque.mp4'] 0 bytes
  575. ['video_files/14. Implement Queue using Deque.mp4_thumb.jpg'] 0 bytes
  576. ['video_files/14. Linked HashSet.mp4'] 0 bytes
  577. ['video_files/14. Linked HashSet.mp4_thumb.jpg'] 0 bytes
  578. ["video_files/14. Max-Subarray Sum - III (Kadane's Algorithm).mp4"] 0 bytes
  579. ["video_files/14. Max-Subarray Sum - III (Kadane's Algorithm).mp4_thumb.jpg"] 0 bytes
  580. ['video_files/14. Pair Sum-1 (2 Pointer Approach).mp4'] 0 bytes
  581. ['video_files/14. Pair Sum-1 (2 Pointer Approach).mp4_thumb.jpg'] 0 bytes
  582. ['video_files/14. Question - Continue Keyword.mp4'] 0 bytes
  583. ['video_files/14. Question - Continue Keyword.mp4_thumb.jpg'] 0 bytes
  584. ['video_files/14. Recursive Complexity Analysis (Factorial).mp4'] 0 bytes
  585. ['video_files/14. Recursive Complexity Analysis (Factorial).mp4_thumb.jpg'] 0 bytes
  586. ['video_files/14. Srring Compression.mp4'] 0 bytes
  587. ['video_files/14. Srring Compression.mp4_thumb.jpg'] 0 bytes
  588. ['video_files/14. Tiling Problem Code.mp4'] 0 bytes
  589. ['video_files/14. Tiling Problem Code.mp4_thumb.jpg'] 0 bytes
  590. ['video_files/14. Type Casting.mp4'] 0 bytes
  591. ['video_files/14. Type Casting.mp4_thumb.jpg'] 0 bytes
  592. ['video_files/15 - Clear Last i Bits.mp4'] 0 bytes
  593. ['video_files/15 - Clear Last i Bits.mp4_thumb.jpg'] 0 bytes
  594. ['video_files/15. Check If A Number Is Prime Or Not.mp4'] 0 bytes
  595. ['video_files/15. Check If A Number Is Prime Or Not.mp4_thumb.jpg'] 0 bytes
  596. ['video_files/15. Check Prime (Optmised).mp4'] 0 bytes
  597. ['video_files/15. Check Prime (Optmised).mp4_thumb.jpg'] 0 bytes
  598. ['video_files/15. Check if LL is Palindrome (Code).mp4'] 0 bytes
  599. ['video_files/15. Check if LL is Palindrome (Code).mp4_thumb.jpg'] 0 bytes
  600. ['video_files/15. Maximum Rectangular Area in Histogram.mp4'] 0 bytes
  601. ['video_files/15. Maximum Rectangular Area in Histogram.mp4_thumb.jpg'] 0 bytes
  602. ['video_files/15. Pair Sum-2.mp4'] 0 bytes
  603. ['video_files/15. Pair Sum-2.mp4_thumb.jpg'] 0 bytes
  604. ['video_files/15. Polymorphism.mp4'] 0 bytes
  605. ['video_files/15. Polymorphism.mp4_thumb.jpg'] 0 bytes
  606. ['video_files/15. Remove Duplicates in a String.mp4'] 0 bytes
  607. ['video_files/15. Remove Duplicates in a String.mp4_thumb.jpg'] 0 bytes
  608. ['video_files/15. Sudoku.mp4'] 0 bytes
  609. ['video_files/15. Sudoku.mp4_thumb.jpg'] 0 bytes
  610. ['video_files/15. Sum of N Numbers Analysis.mp4'] 0 bytes
  611. ['video_files/15. Sum of N Numbers Analysis.mp4_thumb.jpg'] 0 bytes
  612. ['video_files/15. Trapping Rainwater.mp4'] 0 bytes
  613. ['video_files/15. Trapping Rainwater.mp4_thumb.jpg'] 0 bytes
  614. ['video_files/15. TreeSet.mp4'] 0 bytes
  615. ['video_files/15. TreeSet.mp4_thumb.jpg'] 0 bytes
  616. ['video_files/15. Type Promotion Expression.mp4'] 0 bytes
  617. ['video_files/15. Type Promotion Expression.mp4_thumb.jpg'] 0 bytes
  618. ['video_files/16 -Clear Range Of Bits.mp4'] 0 bytes
  619. ['video_files/16 -Clear Range Of Bits.mp4_thumb.jpg'] 0 bytes
  620. ['video_files/16. Count Distinct Elements.mp4'] 0 bytes
  621. ['video_files/16. Count Distinct Elements.mp4_thumb.jpg'] 0 bytes
  622. ['video_files/16. Fibonacci Analysis.mp4'] 0 bytes
  623. ['video_files/16. Fibonacci Analysis.mp4_thumb.jpg'] 0 bytes
  624. ['video_files/16. Friends Pairing Problem.mp4'] 0 bytes
  625. ['video_files/16. Friends Pairing Problem.mp4_thumb.jpg'] 0 bytes
  626. ['video_files/16. How Does Java Code Run.mp4'] 0 bytes
  627. ['video_files/16. How Does Java Code Run.mp4_thumb.jpg'] 0 bytes
  628. ['video_files/16. Max Reactangular Area in Histogram (Code).mp4'] 0 bytes
  629. ['video_files/16. Max Reactangular Area in Histogram (Code).mp4_thumb.jpg'] 0 bytes
  630. ['video_files/16. Method Overloading.mp4'] 0 bytes
  631. ['video_files/16. Method Overloading.mp4_thumb.jpg'] 0 bytes
  632. ['video_files/16. Pair Sum-2 (Code).mp4'] 0 bytes
  633. ['video_files/16. Pair Sum-2 (Code).mp4_thumb.jpg'] 0 bytes
  634. ['video_files/16. Prime In Range.mp4'] 0 bytes
  635. ['video_files/16. Prime In Range.mp4_thumb.jpg'] 0 bytes
  636. ['video_files/16. Sudoku Code.mp4'] 0 bytes
  637. ['video_files/16. Sudoku Code.mp4_thumb.jpg'] 0 bytes
  638. ['video_files/16. Trapping Rainwater - Code.mp4'] 0 bytes
  639. ['video_files/16. Trapping Rainwater - Code.mp4_thumb.jpg'] 0 bytes
  640. ['video_files/17 - Check If A Number Is Power Of 2 Or Not.mp4'] 0 bytes
  641. ['video_files/17 - Check If A Number Is Power Of 2 Or Not.mp4_thumb.jpg'] 0 bytes
  642. ['video_files/17. Method Overriding.mp4'] 0 bytes
  643. ['video_files/17. Method Overriding.mp4_thumb.jpg'] 0 bytes
  644. ['video_files/17. Best Time To Buy & Sell Stocks.mp4'] 0 bytes
  645. ['video_files/17. Best Time To Buy & Sell Stocks.mp4_thumb.jpg'] 0 bytes
  646. ['video_files/17. Binary Strings Problem.mp4'] 0 bytes
  647. ['video_files/17. Binary Strings Problem.mp4_thumb.jpg'] 0 bytes
  648. ['video_files/17. Binary To Decimal.mp4'] 0 bytes
  649. ['video_files/17. Binary To Decimal.mp4_thumb.jpg'] 0 bytes
  650. ['video_files/17. Merge Sort Analysis.mp4'] 0 bytes
  651. ['video_files/17. Merge Sort Analysis.mp4_thumb.jpg'] 0 bytes
  652. ['video_files/17. Union & Intersection.mp4'] 0 bytes
  653. ['video_files/17. Union & Intersection.mp4_thumb.jpg'] 0 bytes
  654. ['video_files/18. Binary Strings Problem Code.mp4'] 0 bytes
  655. ['video_files/18. Binary Strings Problem Code.mp4_thumb.jpg'] 0 bytes
  656. ['video_files/18. Code - Binary To Decimal.mp4'] 0 bytes
  657. ['video_files/18. Code - Binary To Decimal.mp4_thumb.jpg'] 0 bytes
  658. ['video_files/18. Count Set Bits In Number.mp4'] 0 bytes
  659. ['video_files/18. Count Set Bits In Number.mp4_thumb.jpg'] 0 bytes
  660. ['video_files/18. Find Itinerary for Tickets.mp4'] 0 bytes
  661. ['video_files/18. Find Itinerary for Tickets.mp4_thumb.jpg'] 0 bytes
  662. ['video_files/18. Packages in Java.mp4'] 0 bytes
  663. ['video_files/18. Packages in Java.mp4_thumb.jpg'] 0 bytes
  664. ['video_files/18. Recurrence Relation - Merge Sort.mp4'] 0 bytes
  665. ['video_files/18. Recurrence Relation - Merge Sort.mp4_thumb.jpg'] 0 bytes
  666. ['video_files/19. Abstraction.mp4'] 0 bytes
  667. ['video_files/19. Abstraction.mp4_thumb.jpg'] 0 bytes
  668. ['video_files/19. Decimal To Binary.mp4'] 0 bytes
  669. ['video_files/19. Decimal To Binary.mp4_thumb.jpg'] 0 bytes
  670. ['video_files/19. Fast Exponetiation.mp4'] 0 bytes
  671. ['video_files/19. Fast Exponetiation.mp4_thumb.jpg'] 0 bytes
  672. ['video_files/19. Largest Subarray with Sum 0.mp4'] 0 bytes
  673. ['video_files/19. Largest Subarray with Sum 0.mp4_thumb.jpg'] 0 bytes
  674. ['video_files/19. Power Function I - Analysis.mp4'] 0 bytes
  675. ['video_files/19. Power Function I - Analysis.mp4_thumb.jpg'] 0 bytes
  676. ['video_files/19. Stack Analysis - Binary Strings.mp4'] 0 bytes
  677. ['video_files/19. Stack Analysis - Binary Strings.mp4_thumb.jpg'] 0 bytes
  678. ['video_files/2 Merge sort (basic + space Optimized) .mp4'] 0 bytes
  679. ['video_files/2 Merge sort (basic + space Optimized) .mp4_thumb.jpg'] 0 bytes
  680. ['video_files/2. 0-1 Knapsack (Recursion).mp4'] 0 bytes
  681. ['video_files/2. 0-1 Knapsack (Recursion).mp4_thumb.jpg'] 0 bytes
  682. ['video_files/2. Access Modifiers.mp4'] 0 bytes
  683. ['video_files/2. Access Modifiers.mp4_thumb.jpg'] 0 bytes
  684. ['video_files/2. Activity Selection.mp4'] 0 bytes
  685. ['video_files/2. Activity Selection.mp4_thumb.jpg'] 0 bytes
  686. ['video_files/2. Alpha Community Update.mp4'] 0 bytes
  687. ['video_files/2. Alpha Community Update.mp4_thumb.jpg'] 0 bytes
  688. ['video_files/2. Arithmetic Operators.mp4'] 0 bytes
  689. ['video_files/2. Arithmetic Operators.mp4_thumb.jpg'] 0 bytes
  690. ['video_files/2. Arrays-Creation.mp4'] 0 bytes
  691. ['video_files/2. Arrays-Creation.mp4_thumb.jpg'] 0 bytes
  692. ['video_files/2. Bellman Ford (Code).mp4'] 0 bytes
  693. ['video_files/2. Bellman Ford (Code).mp4_thumb.jpg'] 0 bytes
  694. ['video_files/2. Binary Number System.mp4'] 0 bytes
  695. ['video_files/2. Binary Number System.mp4_thumb.jpg'] 0 bytes
  696. ['video_files/2. Boilerplate Code.mp4'] 0 bytes
  697. ['video_files/2. Boilerplate Code.mp4_thumb.jpg'] 0 bytes
  698. ['video_files/2. Bonus Live Session with Aman Bhaiya.mp4'] 0 bytes
  699. ['video_files/2. Bonus Live Session with Aman Bhaiya.mp4_thumb.jpg'] 0 bytes
  700. ["video_files/2. Bridge in Graph (Tarjan's Algorithm).mp4"] 0 bytes
  701. ["video_files/2. Bridge in Graph (Tarjan's Algorithm).mp4_thumb.jpg"] 0 bytes
  702. ['video_files/2. Bubble Sort.mp4'] 0 bytes
  703. ['video_files/2. Bubble Sort.mp4_thumb.jpg'] 0 bytes
  704. ['video_files/2. Cheapest Flights within K Stops (Code).mp4'] 0 bytes
  705. ['video_files/2. Cheapest Flights within K Stops (Code).mp4_thumb.jpg'] 0 bytes
  706. ['video_files/2. Concept of Search in BST.mp4'] 0 bytes
  707. ['video_files/2. Concept of Search in BST.mp4_thumb.jpg'] 0 bytes
  708. ['video_files/2. Convert BST to Balanced BST.mp4'] 0 bytes
  709. ['video_files/2. Convert BST to Balanced BST.mp4_thumb.jpg'] 0 bytes
  710. ['video_files/2. Count & Meaning of Nodes.mp4'] 0 bytes
  711. ['video_files/2. Count & Meaning of Nodes.mp4_thumb.jpg'] 0 bytes
  712. ['video_files/2. Cycle in Graphs.mp4'] 0 bytes
  713. ['video_files/2. Cycle in Graphs.mp4_thumb.jpg'] 0 bytes
  714. ['video_files/2. Detecting Cycle Code.mp4'] 0 bytes
  715. ['video_files/2. Detecting Cycle Code.mp4_thumb.jpg'] 0 bytes
  716. ['video_files/2. Diameter of a Tree (Approach2).mp4'] 0 bytes
  717. ['video_files/2. Diameter of a Tree (Approach2).mp4_thumb.jpg'] 0 bytes
  718. ['video_files/2. Dry run- How Rectangle Pattern.mp4'] 0 bytes
  719. ['video_files/2. Dry run- How Rectangle Pattern.mp4_thumb.jpg'] 0 bytes
  720. ['video_files/2. Flowchart Components.mp4'] 0 bytes
  721. ['video_files/2. Flowchart Components.mp4_thumb.jpg'] 0 bytes
  722. ['video_files/2. HashMap.mp4'] 0 bytes
  723. ['video_files/2. HashMap.mp4_thumb.jpg'] 0 bytes
  724. ['video_files/2. Head & Tail in LL.mp4'] 0 bytes
  725. ['video_files/2. Head & Tail in LL.mp4_thumb.jpg'] 0 bytes
  726. ['video_files/2. InputOutput.mp4'] 0 bytes
  727. ['video_files/2. InputOutput.mp4_thumb.jpg'] 0 bytes
  728. ['video_files/2. Levels & Sub-trees in a Tree .mp4'] 0 bytes
  729. ['video_files/2. Levels & Sub-trees in a Tree .mp4_thumb.jpg'] 0 bytes
  730. ['video_files/2. Longest Increasing Subsequence.mp4'] 0 bytes
  731. ['video_files/2. Longest Increasing Subsequence.mp4_thumb.jpg'] 0 bytes
  732. ['video_files/2. Lowest Common Ancestor (Approach1).mp4'] 0 bytes
  733. ['video_files/2. Lowest Common Ancestor (Approach1).mp4_thumb.jpg'] 0 bytes
  734. ['video_files/2. Matrix Chain Multiplication (Recursion).mp4'] 0 bytes
  735. ['video_files/2. Matrix Chain Multiplication (Recursion).mp4_thumb.jpg'] 0 bytes
  736. ['video_files/2. Operations on ArrayList.mp4'] 0 bytes
  737. ['video_files/2. Operations on ArrayList.mp4_thumb.jpg'] 0 bytes
  738. ['video_files/2. PQ in JCF.mp4'] 0 bytes
  739. ['video_files/2. PQ in JCF.mp4_thumb.jpg'] 0 bytes
  740. ['video_files/2. Print Inverted Star Pattern.mp4.mp4'] 0 bytes
  741. ['video_files/2. Print Inverted Star Pattern.mp4.mp4_thumb.jpg'] 0 bytes
  742. ['video_files/2. Print The Largest Of 2 Numbers.mp4'] 0 bytes
  743. ['video_files/2. Print The Largest Of 2 Numbers.mp4_thumb.jpg'] 0 bytes
  744. ['video_files/2. Print numbers in decreasing order.mp4'] 0 bytes
  745. ['video_files/2. Print numbers in decreasing order.mp4_thumb.jpg'] 0 bytes
  746. ['video_files/2. Queues using Arrays.mp4'] 0 bytes
  747. ['video_files/2. Queues using Arrays.mp4_thumb.jpg'] 0 bytes
  748. ['video_files/2. Real Life Examples.mp4'] 0 bytes
  749. ['video_files/2. Real Life Examples.mp4_thumb.jpg'] 0 bytes
  750. ['video_files/2. Rod Cutting.mp4'] 0 bytes
  751. ['video_files/2. Rod Cutting.mp4_thumb.jpg'] 0 bytes
  752. ['video_files/2. Stack using ArrayList.mp4'] 0 bytes
  753. ['video_files/2. Stack using ArrayList.mp4_thumb.jpg'] 0 bytes
  754. ['video_files/2. Syntax-Function Code Demo.mp4'] 0 bytes
  755. ['video_files/2. Syntax-Function Code Demo.mp4_thumb.jpg'] 0 bytes
  756. ['video_files/2. Topological Sort using BFS (Code).mp4'] 0 bytes
  757. ['video_files/2. Topological Sort using BFS (Code).mp4_thumb.jpg'] 0 bytes
  758. ['video_files/2. Types of Backtracking.mp4'] 0 bytes
  759. ['video_files/2. Types of Backtracking.mp4_thumb.jpg'] 0 bytes
  760. ['video_files/2. Types of Graphs (Based on Edge).mp4'] 0 bytes
  761. ['video_files/2. Types of Graphs (Based on Edge).mp4_thumb.jpg'] 0 bytes
  762. ['video_files/2. What is DP (Definition).mp4'] 0 bytes
  763. ['video_files/2. What is DP (Definition).mp4_thumb.jpg'] 0 bytes
  764. ['video_files/2. What is Time Complexity.mp4'] 0 bytes
  765. ['video_files/2. What is Time Complexity.mp4_thumb.jpg'] 0 bytes
  766. ['video_files/2. What is a Trie.mp4'] 0 bytes
  767. ['video_files/2. What is a Trie.mp4_thumb.jpg'] 0 bytes
  768. ['video_files/2. What will you learn_1.mp4'] 0 bytes
  769. ['video_files/2. What will you learn_1.mp4_thumb.jpg'] 0 bytes
  770. ['video_files/2. While Loop.mp4'] 0 bytes
  771. ['video_files/2. While Loop.mp4_thumb.jpg'] 0 bytes
  772. ['video_files/2. Wildcard Matching (Code).mp4'] 0 bytes
  773. ['video_files/2. Wildcard Matching (Code).mp4_thumb.jpg'] 0 bytes
  774. ['video_files/20. Abstract Classes.mp4'] 0 bytes
  775. ['video_files/20. Abstract Classes.mp4_thumb.jpg'] 0 bytes
  776. ['video_files/20. Code - Decimal To Binary.mp4'] 0 bytes
  777. ['video_files/20. Code - Decimal To Binary.mp4_thumb.jpg'] 0 bytes
  778. ['video_files/20. Fast Exponentiation Code.mp4'] 0 bytes
  779. ['video_files/20. Fast Exponentiation Code.mp4_thumb.jpg'] 0 bytes
  780. ['video_files/20. Power Function II - Analysis.mp4'] 0 bytes
  781. ['video_files/20. Power Function II - Analysis.mp4_thumb.jpg'] 0 bytes
  782. ['video_files/20. Subarray Sum Equal to K.mp4'] 0 bytes
  783. ['video_files/20. Subarray Sum Equal to K.mp4_thumb.jpg'] 0 bytes
  784. ['video_files/21. Block Scope.mp4'] 0 bytes
  785. ['video_files/21. Block Scope.mp4_thumb.jpg'] 0 bytes
  786. ['video_files/21. Interfaces.mp4'] 0 bytes
  787. ['video_files/21. Interfaces.mp4_thumb.jpg'] 0 bytes
  788. ['video_files/21. Power Function III - Analysis.mp4'] 0 bytes
  789. ['video_files/21. Power Function III - Analysis.mp4_thumb.jpg'] 0 bytes
  790. ['video_files/22. How to approach Coding Questions.mp4'] 0 bytes
  791. ['video_files/22. How to approach Coding Questions.mp4_thumb.jpg'] 0 bytes
  792. ['video_files/22. Method Scope.mp4'] 0 bytes
  793. ['video_files/22. Method Scope.mp4_thumb.jpg'] 0 bytes
  794. ['video_files/22. Static keyword.mp4'] 0 bytes
  795. ['video_files/22. Static keyword.mp4_thumb.jpg'] 0 bytes
  796. ['video_files/23. Super keyword.mp4'] 0 bytes
  797. ['video_files/23. Super keyword.mp4_thumb.jpg'] 0 bytes
  798. ['video_files/24. Solved Questions Practice.mp4'] 0 bytes
  799. ['video_files/24. Solved Questions Practice.mp4_thumb.jpg'] 0 bytes
  800. ['video_files/3. 0-1 Knapsack (Memoization).mp4'] 0 bytes
  801. ['video_files/3. 0-1 Knapsack (Memoization).mp4_thumb.jpg'] 0 bytes
  802. ['video_files/3. Activity Selection Code.mp4'] 0 bytes
  803. ['video_files/3. Activity Selection Code.mp4_thumb.jpg'] 0 bytes
  804. ['video_files/3. Add First in LL.mp4'] 0 bytes
  805. ['video_files/3. Add First in LL.mp4_thumb.jpg'] 0 bytes
  806. ['video_files/3. All Paths from Source to Target.mp4'] 0 bytes
  807. ['video_files/3. All Paths from Source to Target.mp4_thumb.jpg'] 0 bytes
  808. ['video_files/3. Arrays-Input,Output & Updates.mp4'] 0 bytes
  809. ['video_files/3. Arrays-Input,Output & Updates.mp4_thumb.jpg'] 0 bytes
  810. ["video_files/3. Articulation Point (Tarjan's Algorithm).mp4"] 0 bytes
  811. ["video_files/3. Articulation Point (Tarjan's Algorithm).mp4_thumb.jpg"] 0 bytes
  812. ['video_files/3. Backtracking on Arrays.mp4'] 0 bytes
  813. ['video_files/3. Backtracking on Arrays.mp4_thumb.jpg'] 0 bytes
  814. ['video_files/3. Bitwise Operators.mp4'] 0 bytes
  815. ['video_files/3. Bitwise Operators.mp4_thumb.jpg'] 0 bytes
  816. ['video_files/3. Bubble Sort Code.mp4'] 0 bytes
  817. ['video_files/3. Bubble Sort Code.mp4_thumb.jpg'] 0 bytes
  818. ['video_files/3. Build a BST.mp4'] 0 bytes
  819. ['video_files/3. Build a BST.mp4_thumb.jpg'] 0 bytes
  820. ["video_files/3. Catalan's Number (Recursion + Memoization).mp4"] 0 bytes
  821. ["video_files/3. Catalan's Number (Recursion + Memoization).mp4_thumb.jpg"] 0 bytes
  822. ['video_files/3. Circular Queue using Arrays.mp4'] 0 bytes
  823. ['video_files/3. Circular Queue using Arrays.mp4_thumb.jpg'] 0 bytes
  824. ['video_files/3. Connecting Cities.mp4'] 0 bytes
  825. ['video_files/3. Connecting Cities.mp4_thumb.jpg'] 0 bytes
  826. ['video_files/3. Constant Time Complexity.mp4'] 0 bytes
  827. ['video_files/3. Constant Time Complexity.mp4_thumb.jpg'] 0 bytes
  828. ['video_files/3. Creating a Trie.mp4'] 0 bytes
  829. ['video_files/3. Creating a Trie.mp4_thumb.jpg'] 0 bytes
  830. ['video_files/3. Creation of ST.mp4'] 0 bytes
  831. ['video_files/3. Creation of ST.mp4_thumb.jpg'] 0 bytes
  832. ['video_files/3. Cycle Detection (Undirected graphs) - DFS.mp4'] 0 bytes
  833. ['video_files/3. Cycle Detection (Undirected graphs) - DFS.mp4_thumb.jpg'] 0 bytes
  834. ['video_files/3. Edit Distance (Explanation).mp4'] 0 bytes
  835. ['video_files/3. Edit Distance (Explanation).mp4_thumb.jpg'] 0 bytes
  836. ['video_files/3. Getters & Setters.mp4'] 0 bytes
  837. ['video_files/3. Getters & Setters.mp4_thumb.jpg'] 0 bytes
  838. ['video_files/3. Graph Representations.mp4'] 0 bytes
  839. ['video_files/3. Graph Representations.mp4_thumb.jpg'] 0 bytes
  840. ['video_files/3. HashMap Operations.mp4'] 0 bytes
  841. ['video_files/3. HashMap Operations.mp4_thumb.jpg'] 0 bytes
  842. ['video_files/3. Inverted And Rotated Half Pyramid.mp4'] 0 bytes
  843. ['video_files/3. Inverted And Rotated Half Pyramid.mp4_thumb.jpg'] 0 bytes
  844. ['video_files/3. Live Mentorship Session - 1 (with Shradha Didi).mp4'] 0 bytes
  845. ['video_files/3. Live Mentorship Session - 1 (with Shradha Didi).mp4_thumb.jpg'] 0 bytes
  846. ['video_files/3. Longest Common Subsequence (Recursion).mp4'] 0 bytes
  847. ['video_files/3. Longest Common Subsequence (Recursion).mp4_thumb.jpg'] 0 bytes
  848. ['video_files/3. Lowest Common Ancestor (Approach2).mp4'] 0 bytes
  849. ['video_files/3. Lowest Common Ancestor (Approach2).mp4_thumb.jpg'] 0 bytes
  850. ['video_files/3. MCM (Memoization).mp4'] 0 bytes
  851. ['video_files/3. MCM (Memoization).mp4_thumb.jpg'] 0 bytes
  852. ['video_files/3. Merge Sort Code.mp4'] 0 bytes
  853. ['video_files/3. Merge Sort Code.mp4_thumb.jpg'] 0 bytes
  854. ['video_files/3. Output In Java.mp4'] 0 bytes
  855. ['video_files/3. Output In Java.mp4_thumb.jpg'] 0 bytes
  856. ['video_files/3. PQ for Objects.mp4'] 0 bytes
  857. ['video_files/3. PQ for Objects.mp4_thumb.jpg'] 0 bytes
  858. ['video_files/3. Pop Quiz.mp4'] 0 bytes
  859. ['video_files/3. Pop Quiz.mp4_thumb.jpg'] 0 bytes
  860. ['video_files/3. Prerequisites_1.mp4'] 0 bytes
  861. ['video_files/3. Prerequisites_1.mp4_thumb.jpg'] 0 bytes
  862. ['video_files/3. Print Half-Pyramid Pattern.mp4'] 0 bytes
  863. ['video_files/3. Print Half-Pyramid Pattern.mp4_thumb.jpg'] 0 bytes
  864. ['video_files/3. Print If Number Is Odd Or Even.mp4'] 0 bytes
  865. ['video_files/3. Print If Number Is Odd Or Even.mp4_thumb.jpg'] 0 bytes
  866. ['video_files/3. Print Number From 1 To 10.mp4'] 0 bytes
  867. ['video_files/3. Print Number From 1 To 10.mp4_thumb.jpg'] 0 bytes
  868. ['video_files/3. Removing Cycle in LL.mp4'] 0 bytes
  869. ['video_files/3. Removing Cycle in LL.mp4_thumb.jpg'] 0 bytes
  870. ['video_files/3. Representation Of 2D Arrays.mp4'] 0 bytes
  871. ['video_files/3. Representation Of 2D Arrays.mp4_thumb.jpg'] 0 bytes
  872. ['video_files/3. Size of ArrayList.mp4'] 0 bytes
  873. ['video_files/3. Size of ArrayList.mp4_thumb.jpg'] 0 bytes
  874. ['video_files/3. Size of Largest BST in BT.mp4'] 0 bytes
  875. ['video_files/3. Size of Largest BST in BT.mp4_thumb.jpg'] 0 bytes
  876. ['video_files/3. Stack overflow video.mp4'] 0 bytes
  877. ['video_files/3. Stack overflow video.mp4_thumb.jpg'] 0 bytes
  878. ['video_files/3. Stack using Linked List.mp4'] 0 bytes
  879. ['video_files/3. Stack using Linked List.mp4_thumb.jpg'] 0 bytes
  880. ['video_files/3. String Length.mp4'] 0 bytes
  881. ['video_files/3. String Length.mp4_thumb.jpg'] 0 bytes
  882. ['video_files/3. Subtree of another tree.mp4'] 0 bytes
  883. ['video_files/3. Subtree of another tree.mp4_thumb.jpg'] 0 bytes
  884. ['video_files/3. Sum of 2 Numbers.mp4'] 0 bytes
  885. ['video_files/3. Sum of 2 Numbers.mp4_thumb.jpg'] 0 bytes
  886. ['video_files/3. Syntax With Parameters.mp4'] 0 bytes
  887. ['video_files/3. Syntax With Parameters.mp4_thumb.jpg'] 0 bytes
  888. ['video_files/3. Unary Operators.mp4'] 0 bytes
  889. ['video_files/3. Unary Operators.mp4_thumb.jpg'] 0 bytes
  890. ['video_files/3. Ways of DP.mp4'] 0 bytes
  891. ['video_files/3. Ways of DP.mp4_thumb.jpg'] 0 bytes
  892. ['video_files/3. What is MST.mp4'] 0 bytes
  893. ['video_files/3. What is MST.mp4_thumb.jpg'] 0 bytes
  894. ['video_files/4. 0-1 Knapsack (Tabulation).mp4'] 0 bytes
  895. ['video_files/4. 0-1 Knapsack (Tabulation).mp4_thumb.jpg'] 0 bytes
  896. ['video_files/4. 7 Important Concepts.mp4'] 0 bytes
  897. ['video_files/4. 7 Important Concepts.mp4_thumb.jpg'] 0 bytes
  898. ['video_files/4. Activity Selection Explanation.mp4'] 0 bytes
  899. ['video_files/4. Activity Selection Explanation.mp4_thumb.jpg'] 0 bytes
  900. ['video_files/4. Add Last in LL.mp4'] 0 bytes
  901. ['video_files/4. Add Last in LL.mp4_thumb.jpg'] 0 bytes
  902. ['video_files/4. Arrays as Function Arguments.mp4'] 0 bytes
  903. ['video_files/4. Arrays as Function Arguments.mp4_thumb.jpg'] 0 bytes
  904. ['video_files/4. Big O Notation.mp4'] 0 bytes
  905. ['video_files/4. Big O Notation.mp4_thumb.jpg'] 0 bytes
  906. ['video_files/4. Binary AND.mp4'] 0 bytes
  907. ['video_files/4. Binary AND.mp4_thumb.jpg'] 0 bytes
  908. ['video_files/4. Bipartite Graph.mp4'] 0 bytes
  909. ['video_files/4. Bipartite Graph.mp4_thumb.jpg'] 0 bytes
  910. ['video_files/4. Build Tree Preorder.mp4'] 0 bytes
  911. ['video_files/4. Build Tree Preorder.mp4_thumb.jpg'] 0 bytes
  912. ['video_files/4. Calculate Simple Interest.mp4'] 0 bytes
  913. ['video_files/4. Calculate Simple Interest.mp4_thumb.jpg'] 0 bytes
  914. ["video_files/4. Catalan's Number (Tabulation).mp4"] 0 bytes
  915. ["video_files/4. Catalan's Number (Tabulation).mp4_thumb.jpg"] 0 bytes
  916. ['video_files/4. Connecting Cities (Code).mp4'] 0 bytes
  917. ['video_files/4. Connecting Cities (Code).mp4_thumb.jpg'] 0 bytes
  918. ['video_files/4. Creation Of 2D Arrays.mp4'] 0 bytes
  919. ['video_files/4. Creation Of 2D Arrays.mp4_thumb.jpg'] 0 bytes
  920. ["video_files/4. Dijkstra's Algorithm.mp4"] 0 bytes
  921. ["video_files/4. Dijkstra's Algorithm.mp4_thumb.jpg"] 0 bytes
  922. ['video_files/4. Edit Distance (Code).mp4'] 0 bytes
  923. ['video_files/4. Edit Distance (Code).mp4_thumb.jpg'] 0 bytes
  924. ['video_files/4. Else If.mp4'] 0 bytes
  925. ['video_files/4. Else If.mp4_thumb.jpg'] 0 bytes
  926. ['video_files/4. Encapsulation.mp4'] 0 bytes
  927. ['video_files/4. Encapsulation.mp4_thumb.jpg'] 0 bytes
  928. ['video_files/4. Find Subsets.mp4'] 0 bytes
  929. ['video_files/4. Find Subsets.mp4_thumb.jpg'] 0 bytes
  930. ['video_files/4. Graph Applications.mp4'] 0 bytes
  931. ['video_files/4. Graph Applications.mp4_thumb.jpg'] 0 bytes
  932. ['video_files/4. Insertion.mp4'] 0 bytes
  933. ['video_files/4. Insertion.mp4_thumb.jpg'] 0 bytes
  934. ['video_files/4. Introduction to Heaps.mp4'] 0 bytes
  935. ['video_files/4. Introduction to Heaps.mp4_thumb.jpg'] 0 bytes
  936. ['video_files/4. Inverted Half Pyramid Pattern with Numbers.mp4'] 0 bytes
  937. ['video_files/4. Inverted Half Pyramid Pattern with Numbers.mp4_thumb.jpg'] 0 bytes
  938. ['video_files/4. Iteration on HashMaps.mp4'] 0 bytes
  939. ['video_files/4. Iteration on HashMaps.mp4_thumb.jpg'] 0 bytes
  940. ['video_files/4. LCS (Memoization).mp4'] 0 bytes
  941. ['video_files/4. LCS (Memoization).mp4_thumb.jpg'] 0 bytes
  942. ['video_files/4. Live Mentorship Session - 2 (with Shradha Didi).mp4'] 0 bytes
  943. ['video_files/4. Live Mentorship Session - 2 (with Shradha Didi).mp4_thumb.jpg'] 0 bytes
  944. ['video_files/4. MCM (Tabulation).mp4'] 0 bytes
  945. ['video_files/4. MCM (Tabulation).mp4_thumb.jpg'] 0 bytes
  946. ['video_files/4. Minimum Distance between 2 Nodes.mp4'] 0 bytes
  947. ['video_files/4. Minimum Distance between 2 Nodes.mp4_thumb.jpg'] 0 bytes
  948. ['video_files/4. Parameters vs Arguments.mp4'] 0 bytes
  949. ['video_files/4. Parameters vs Arguments.mp4_thumb.jpg'] 0 bytes
  950. ["video_files/4. Prim's Algorithm.mp4"] 0 bytes
  951. ["video_files/4. Prim's Algorithm.mp4_thumb.jpg"] 0 bytes
  952. ['video_files/4. Print A Pattern.mp4'] 0 bytes
  953. ['video_files/4. Print A Pattern.mp4_thumb.jpg'] 0 bytes
  954. ['video_files/4. Print Character Pattern.mp4'] 0 bytes
  955. ['video_files/4. Print Character Pattern.mp4_thumb.jpg'] 0 bytes
  956. ['video_files/4. Print Number From 1 to n.mp4'] 0 bytes
  957. ['video_files/4. Print Number From 1 to n.mp4_thumb.jpg'] 0 bytes
  958. ['video_files/4. Print Reverse of an ArrayList.mp4'] 0 bytes
  959. ['video_files/4. Print Reverse of an ArrayList.mp4_thumb.jpg'] 0 bytes
  960. ['video_files/4. Print numbers in increasing order.mp4'] 0 bytes
  961. ['video_files/4. Print numbers in increasing order.mp4_thumb.jpg'] 0 bytes
  962. ['video_files/4. Queries on ST.mp4'] 0 bytes
  963. ['video_files/4. Queries on ST.mp4_thumb.jpg'] 0 bytes
  964. ['video_files/4. Queue using LL.mp4'] 0 bytes
  965. ['video_files/4. Queue using LL.mp4_thumb.jpg'] 0 bytes
  966. ['video_files/4. Quick Sort.mp4'] 0 bytes
  967. ['video_files/4. Quick Sort.mp4_thumb.jpg'] 0 bytes
  968. ['video_files/4. Relational Operators.mp4'] 0 bytes
  969. ['video_files/4. Relational Operators.mp4_thumb.jpg'] 0 bytes
  970. ['video_files/4. Removing Cycle Code.mp4'] 0 bytes
  971. ['video_files/4. Removing Cycle Code.mp4_thumb.jpg'] 0 bytes
  972. ['video_files/4. Search in a BST.mp4'] 0 bytes
  973. ['video_files/4. Search in a BST.mp4_thumb.jpg'] 0 bytes
  974. ['video_files/4. Selection Sort.mp4'] 0 bytes
  975. ['video_files/4. Selection Sort.mp4_thumb.jpg'] 0 bytes
  976. ['video_files/4. Size of Largest BST in BT (Code).mp4'] 0 bytes
  977. ['video_files/4. Size of Largest BST in BT (Code).mp4_thumb.jpg'] 0 bytes
  978. ['video_files/4. Stack using Collections Framework.mp4'] 0 bytes
  979. ['video_files/4. Stack using Collections Framework.mp4_thumb.jpg'] 0 bytes
  980. ['video_files/4. String Concatenation.mp4'] 0 bytes
  981. ['video_files/4. String Concatenation.mp4_thumb.jpg'] 0 bytes
  982. ['video_files/4. Subtree of another tree Code.mp4'] 0 bytes
  983. ['video_files/4. Subtree of another tree Code.mp4_thumb.jpg'] 0 bytes
  984. ['video_files/5. 2D Array In Memory.mp4'] 0 bytes
  985. ['video_files/5. 2D Array In Memory.mp4_thumb.jpg'] 0 bytes
  986. ['video_files/5. Big Omega & Theta Notation.mp4'] 0 bytes
  987. ['video_files/5. Big Omega & Theta Notation.mp4_thumb.jpg'] 0 bytes
  988. ['video_files/5. Binary OR.mp4'] 0 bytes
  989. ['video_files/5. Binary OR.mp4_thumb.jpg'] 0 bytes
  990. ['video_files/5. Build Tree Preorder Code.mp4'] 0 bytes
  991. ['video_files/5. Build Tree Preorder Code.mp4_thumb.jpg'] 0 bytes
  992. ['video_files/5. Climbing Stairs (Recursion).mp4'] 0 bytes
  993. ['video_files/5. Climbing Stairs (Recursion).mp4_thumb.jpg'] 0 bytes
  994. ['video_files/5. Constructors.mp4'] 0 bytes
  995. ['video_files/5. Constructors.mp4_thumb.jpg'] 0 bytes
  996. ['video_files/5. Count BSTs.mp4'] 0 bytes
  997. ['video_files/5. Count BSTs.mp4_thumb.jpg'] 0 bytes
  998. ['video_files/5. Creating a Graph (Adjacency List).mp4'] 0 bytes
  999. ['video_files/5. Creating a Graph (Adjacency List).mp4_thumb.jpg'] 0 bytes
  1000. ['video_files/5. Cycle Detection (Directed graph) - DFS.mp4'] 0 bytes
  1001. ['video_files/5. Cycle Detection (Directed graph) - DFS.mp4_thumb.jpg'] 0 bytes
  1002. ['video_files/5. Delete a Node.mp4'] 0 bytes
  1003. ['video_files/5. Delete a Node.mp4_thumb.jpg'] 0 bytes
  1004. ["video_files/5. Dijkstra's Algorithm (Code).mp4"] 0 bytes
  1005. ["video_files/5. Dijkstra's Algorithm (Code).mp4_thumb.jpg"] 0 bytes
  1006. ['video_files/5. Disjoint Set Union.mp4'] 0 bytes
  1007. ['video_files/5. Disjoint Set Union.mp4_thumb.jpg'] 0 bytes
  1008. ['video_files/5. Find Factorial of N.mp4'] 0 bytes
  1009. ['video_files/5. Find Factorial of N.mp4_thumb.jpg'] 0 bytes
  1010. ['video_files/5. Find Maximum in an ArrayList.mp4'] 0 bytes
  1011. ['video_files/5. Find Maximum in an ArrayList.mp4_thumb.jpg'] 0 bytes
  1012. ['video_files/5. Find Subsets Code.mp4'] 0 bytes
  1013. ['video_files/5. Find Subsets Code.mp4_thumb.jpg'] 0 bytes
  1014. ["video_files/5. Floyd's Triangle Pattern.mp4"] 0 bytes
  1015. ["video_files/5. Floyd's Triangle Pattern.mp4_thumb.jpg"] 0 bytes
  1016. ['video_files/5. Fractional Knapsack.mp4'] 0 bytes
  1017. ['video_files/5. Fractional Knapsack.mp4_thumb.jpg'] 0 bytes
  1018. ['video_files/5. HashMap Implementation.mp4'] 0 bytes
  1019. ['video_files/5. HashMap Implementation.mp4_thumb.jpg'] 0 bytes
  1020. ['video_files/5. Heap Implementation (using CBT).mp4'] 0 bytes
  1021. ['video_files/5. Heap Implementation (using CBT).mp4_thumb.jpg'] 0 bytes
  1022. ['video_files/5. Income Tax Calculator.mp4'] 0 bytes
  1023. ['video_files/5. Income Tax Calculator.mp4_thumb.jpg'] 0 bytes
  1024. ['video_files/5. Kth ancestor of Node.mp4'] 0 bytes
  1025. ['video_files/5. Kth ancestor of Node.mp4_thumb.jpg'] 0 bytes
  1026. ['video_files/5. LCS (Tabulation).mp4'] 0 bytes
  1027. ['video_files/5. LCS (Tabulation).mp4_thumb.jpg'] 0 bytes
  1028. ['video_files/5. Linear Search.mp4'] 0 bytes
  1029. ['video_files/5. Linear Search.mp4_thumb.jpg'] 0 bytes
  1030. ['video_files/5. Live Mentorship Session - 3 (Resume).mp4'] 0 bytes
  1031. ['video_files/5. Live Mentorship Session - 3 (Resume).mp4_thumb.jpg'] 0 bytes
  1032. ['video_files/5. Logical Operators.mp4'] 0 bytes
  1033. ['video_files/5. Logical Operators.mp4_thumb.jpg'] 0 bytes
  1034. ['video_files/5. Max of 3 Numbers.mp4'] 0 bytes
  1035. ['video_files/5. Max of 3 Numbers.mp4_thumb.jpg'] 0 bytes
  1036. ['video_files/5. Merge 2 BSTs.mp4'] 0 bytes
  1037. ['video_files/5. Merge 2 BSTs.mp4_thumb.jpg'] 0 bytes
  1038. ['video_files/5. Minimum Partitioning.mp4'] 0 bytes
  1039. ['video_files/5. Minimum Partitioning.mp4_thumb.jpg'] 0 bytes
  1040. ["video_files/5. Prim's Code.mp4"] 0 bytes
  1041. ["video_files/5. Prim's Code.mp4_thumb.jpg"] 0 bytes
  1042. ['video_files/5. Print a LL.mp4'] 0 bytes
  1043. ['video_files/5. Print a LL.mp4_thumb.jpg'] 0 bytes
  1044. ['video_files/5. Push at Bottom of Stack.mp4'] 0 bytes
  1045. ['video_files/5. Push at Bottom of Stack.mp4_thumb.jpg'] 0 bytes
  1046. ['video_files/5. Queue using JCF.mp4'] 0 bytes
  1047. ['video_files/5. Queue using JCF.mp4_thumb.jpg'] 0 bytes
  1048. ['video_files/5. Quick Sort Code.mp4'] 0 bytes
  1049. ['video_files/5. Quick Sort Code.mp4_thumb.jpg'] 0 bytes
  1050. ['video_files/5. Removing Cycle Explanation (Math).mp4'] 0 bytes
  1051. ['video_files/5. Removing Cycle Explanation (Math).mp4_thumb.jpg'] 0 bytes
  1052. ['video_files/5. Searching.mp4'] 0 bytes
  1053. ['video_files/5. Searching.mp4_thumb.jpg'] 0 bytes
  1054. ['video_files/5. Selection Sort Code.mp4'] 0 bytes
  1055. ['video_files/5. Selection Sort Code.mp4_thumb.jpg'] 0 bytes
  1056. ['video_files/5. String Conversion.mp4'] 0 bytes
  1057. ['video_files/5. String Conversion.mp4_thumb.jpg'] 0 bytes
  1058. ['video_files/5. String char At Method.mp4'] 0 bytes
  1059. ['video_files/5. String char At Method.mp4_thumb.jpg'] 0 bytes
  1060. ['video_files/5. Sum Of First n Natural Numbers.mp4'] 0 bytes
  1061. ['video_files/5. Sum Of First n Natural Numbers.mp4_thumb.jpg'] 0 bytes
  1062. ['video_files/5. Target Sum Subset (Tabulation).mp4'] 0 bytes
  1063. ['video_files/5. Target Sum Subset (Tabulation).mp4_thumb.jpg'] 0 bytes
  1064. ['video_files/5. Top View of a Tree (Basics).mp4'] 0 bytes
  1065. ['video_files/5. Top View of a Tree (Basics).mp4_thumb.jpg'] 0 bytes
  1066. ['video_files/5. Update on ST.mp4'] 0 bytes
  1067. ['video_files/5. Update on ST.mp4_thumb.jpg'] 0 bytes
  1068. ['video_files/5. Variables In Java.mp4'] 0 bytes
  1069. ['video_files/5. Variables In Java.mp4_thumb.jpg'] 0 bytes
  1070. ['video_files/5. What Happens In Memory.mp4'] 0 bytes
  1071. ['video_files/5. What Happens In Memory.mp4_thumb.jpg'] 0 bytes
  1072. ['video_files/6. (0-1) Triangle Pattern.mp4'] 0 bytes
  1073. ['video_files/6. (0-1) Triangle Pattern.mp4_thumb.jpg'] 0 bytes
  1074. ['video_files/6. AVL Tress.mp4'] 0 bytes
  1075. ['video_files/6. AVL Tress.mp4_thumb.jpg'] 0 bytes
  1076. ['video_files/6. Add in the Middle of LL.mp4'] 0 bytes
  1077. ['video_files/6. Add in the Middle of LL.mp4_thumb.jpg'] 0 bytes
  1078. ['video_files/6. Assignment Operator.mp4'] 0 bytes
  1079. ['video_files/6. Assignment Operator.mp4_thumb.jpg'] 0 bytes
  1080. ['video_files/6. BFS (Breadth First Search).mp4'] 0 bytes
  1081. ['video_files/6. BFS (Breadth First Search).mp4_thumb.jpg'] 0 bytes
  1082. ['video_files/6. Binary XOR.mp4'] 0 bytes
  1083. ['video_files/6. Binary XOR.mp4_thumb.jpg'] 0 bytes
  1084. ['video_files/6. Call By Value.mp4'] 0 bytes
  1085. ['video_files/6. Call By Value.mp4_thumb.jpg'] 0 bytes
  1086. ['video_files/6. Check If String Is Palindrome.mp4'] 0 bytes
  1087. ['video_files/6. Check If String Is Palindrome.mp4_thumb.jpg'] 0 bytes
  1088. ['video_files/6. Climbing Stairs (Memoization DP).mp4'] 0 bytes
  1089. ['video_files/6. Climbing Stairs (Memoization DP).mp4_thumb.jpg'] 0 bytes
  1090. ['video_files/6. Common Complexities.mp4'] 0 bytes
  1091. ['video_files/6. Common Complexities.mp4_thumb.jpg'] 0 bytes
  1092. ['video_files/6. Data Types In Java.mp4'] 0 bytes
  1093. ['video_files/6. Data Types In Java.mp4_thumb.jpg'] 0 bytes
  1094. ['video_files/6. Extra Read.mp4'] 0 bytes
  1095. ['video_files/6. Extra Read.mp4_thumb.jpg'] 0 bytes
  1096. ['video_files/6. Find Permutations.mp4'] 0 bytes
  1097. ['video_files/6. Find Permutations.mp4_thumb.jpg'] 0 bytes
  1098. ['video_files/6. Find if a Number is Prime or not.mp4'] 0 bytes
  1099. ['video_files/6. Find if a Number is Prime or not.mp4_thumb.jpg'] 0 bytes
  1100. ['video_files/6. For Loops.mp4'] 0 bytes
  1101. ['video_files/6. For Loops.mp4_thumb.jpg'] 0 bytes
  1102. ['video_files/6. Fractional Knapsack Code.mp4'] 0 bytes
  1103. ['video_files/6. Fractional Knapsack Code.mp4_thumb.jpg'] 0 bytes
  1104. ['video_files/6. HashMap Implementation Code.mp4'] 0 bytes
  1105. ['video_files/6. HashMap Implementation Code.mp4_thumb.jpg'] 0 bytes
  1106. ['video_files/6. Insert in Heap.mp4'] 0 bytes
  1107. ['video_files/6. Insert in Heap.mp4_thumb.jpg'] 0 bytes
  1108. ['video_files/6. Insertion Sort.mp4'] 0 bytes
  1109. ['video_files/6. Insertion Sort.mp4_thumb.jpg'] 0 bytes
  1110. ['video_files/6. Java Collections Framework.mp4'] 0 bytes
  1111. ['video_files/6. Java Collections Framework.mp4_thumb.jpg'] 0 bytes
  1112. ["video_files/6. Kruskal's Algorithm.mp4"] 0 bytes
  1113. ["video_files/6. Kruskal's Algorithm.mp4_thumb.jpg"] 0 bytes
  1114. ['video_files/6. Largest in array.mp4'] 0 bytes
  1115. ['video_files/6. Largest in array.mp4_thumb.jpg'] 0 bytes
  1116. ['video_files/6. Live Mentorships Session - 4 (Theory Topics).mp4'] 0 bytes
  1117. ['video_files/6. Live Mentorships Session - 4 (Theory Topics).mp4_thumb.jpg'] 0 bytes
  1118. ['video_files/6. Max-Min Segment Tree (Creation).mp4'] 0 bytes
  1119. ['video_files/6. Max-Min Segment Tree (Creation).mp4_thumb.jpg'] 0 bytes
  1120. ['video_files/6. Minimum Array Jumps (Explanation).mp4'] 0 bytes
  1121. ['video_files/6. Minimum Array Jumps (Explanation).mp4_thumb.jpg'] 0 bytes
  1122. ['video_files/6. Mountain Ranges.mp4'] 0 bytes
  1123. ['video_files/6. Mountain Ranges.mp4_thumb.jpg'] 0 bytes
  1124. ['video_files/6. Preorder Traversal.mp4'] 0 bytes
  1125. ['video_files/6. Preorder Traversal.mp4_thumb.jpg'] 0 bytes
  1126. ['video_files/6. Print The Largest Of 3 Numbers.mp4'] 0 bytes
  1127. ['video_files/6. Print The Largest Of 3 Numbers.mp4_thumb.jpg'] 0 bytes
  1128. ['video_files/6. Print in Range.mp4'] 0 bytes
  1129. ['video_files/6. Print in Range.mp4_thumb.jpg'] 0 bytes
  1130. ['video_files/6. Print sum of N natural numbers.mp4'] 0 bytes
  1131. ['video_files/6. Print sum of N natural numbers.mp4_thumb.jpg'] 0 bytes
  1132. ['video_files/6. Queue using Two Stacks.mp4'] 0 bytes
  1133. ['video_files/6. Queue using Two Stacks.mp4_thumb.jpg'] 0 bytes
  1134. ['video_files/6. Reverse a String using a Stack.mp4'] 0 bytes
  1135. ['video_files/6. Reverse a String using a Stack.mp4_thumb.jpg'] 0 bytes
  1136. ['video_files/6. Special Note.mp4'] 0 bytes
  1137. ['video_files/6. Special Note.mp4_thumb.jpg'] 0 bytes
  1138. ['video_files/6. Spiral Matrix.mp4'] 0 bytes
  1139. ['video_files/6. Spiral Matrix.mp4_thumb.jpg'] 0 bytes
  1140. ['video_files/6. Swap 2 Numbers.mp4'] 0 bytes
  1141. ['video_files/6. Swap 2 Numbers.mp4_thumb.jpg'] 0 bytes
  1142. ['video_files/6. Target Sum Subset (Code).mp4'] 0 bytes
  1143. ['video_files/6. Target Sum Subset (Code).mp4_thumb.jpg'] 0 bytes
  1144. ['video_files/6. Top View of a Tree (Approach).mp4'] 0 bytes
  1145. ['video_files/6. Top View of a Tree (Approach).mp4_thumb.jpg'] 0 bytes
  1146. ['video_files/6. Transform to Sum Tree.mp4'] 0 bytes
  1147. ['video_files/6. Transform to Sum Tree.mp4_thumb.jpg'] 0 bytes
  1148. ['video_files/6. Type of Constructors .mp4'] 0 bytes
  1149. ['video_files/6. Type of Constructors .mp4_thumb.jpg'] 0 bytes
  1150. ['video_files/6. Word Break Problem.mp4'] 0 bytes
  1151. ['video_files/6. Word Break Problem.mp4_thumb.jpg'] 0 bytes
  1152. ['video_files/6. Worst Case in Quick Sort.mp4'] 0 bytes
  1153. ['video_files/6. Worst Case in Quick Sort.mp4_thumb.jpg'] 0 bytes
  1154. ['video_files/7. Binary Search.mp4'] 0 bytes
  1155. ['video_files/7. Binary Search.mp4_thumb.jpg'] 0 bytes
  1156. ['video_files/7. Butterfly Patter.mp4'] 0 bytes
  1157. ['video_files/7. Butterfly Patter.mp4_thumb.jpg'] 0 bytes
  1158. ['video_files/7. Climbing Stairs Variation.mp4'] 0 bytes
  1159. ['video_files/7. Climbing Stairs Variation.mp4_thumb.jpg'] 0 bytes
  1160. ['video_files/7. Copy Constructor .mp4'] 0 bytes
  1161. ['video_files/7. Copy Constructor .mp4_thumb.jpg'] 0 bytes
  1162. ['video_files/7. DFS (Depth First Search).mp4'] 0 bytes
  1163. ['video_files/7. DFS (Depth First Search).mp4_thumb.jpg'] 0 bytes
  1164. ['video_files/7. Find Permutations Code.mp4'] 0 bytes
  1165. ['video_files/7. Find Permutations Code.mp4_thumb.jpg'] 0 bytes
  1166. ['video_files/7. Flood Fill Algorithm.mp4'] 0 bytes
  1167. ['video_files/7. Flood Fill Algorithm.mp4_thumb.jpg'] 0 bytes
  1168. ['video_files/7. Inorder Traversal.mp4'] 0 bytes
  1169. ['video_files/7. Inorder Traversal.mp4_thumb.jpg'] 0 bytes
  1170. ['video_files/7. Insertion Sort Code.mp4'] 0 bytes
  1171. ['video_files/7. Insertion Sort Code.mp4_thumb.jpg'] 0 bytes
  1172. ['video_files/7. LL in Collections Framework.mp4'] 0 bytes
  1173. ['video_files/7. LL in Collections Framework.mp4_thumb.jpg'] 0 bytes
  1174. ['video_files/7. Live Mentorship Session - 5 (Off-campus Placements).mp4'] 0 bytes
  1175. ['video_files/7. Live Mentorship Session - 5 (Off-campus Placements).mp4_thumb.jpg'] 0 bytes
  1176. ['video_files/7. Max-Min Segment Tree (Query-Update).mp4'] 0 bytes
  1177. ['video_files/7. Max-Min Segment Tree (Query-Update).mp4_thumb.jpg'] 0 bytes
  1178. ['video_files/7. Minimum Array Jumps (Code).mp4'] 0 bytes
  1179. ['video_files/7. Minimum Array Jumps (Code).mp4_thumb.jpg'] 0 bytes
  1180. ['video_files/7. Minimum Sum absolute difference pairs.mp4'] 0 bytes
  1181. ['video_files/7. Minimum Sum absolute difference pairs.mp4_thumb.jpg'] 0 bytes
  1182. ['video_files/7. Peek From Heap.mp4'] 0 bytes
  1183. ['video_files/7. Peek From Heap.mp4_thumb.jpg'] 0 bytes
  1184. ['video_files/7. Prefix Problem.mp4'] 0 bytes
  1185. ['video_files/7. Prefix Problem.mp4_thumb.jpg'] 0 bytes
  1186. ['video_files/7. Print Square Pattern.mp4'] 0 bytes
  1187. ['video_files/7. Print Square Pattern.mp4_thumb.jpg'] 0 bytes
  1188. ['video_files/7. Product Of a & b_.mp4'] 0 bytes
  1189. ['video_files/7. Product Of a & b_.mp4_thumb.jpg'] 0 bytes
  1190. ['video_files/7. Question - Shortest Path.mp4'] 0 bytes
  1191. ['video_files/7. Question - Shortest Path.mp4_thumb.jpg'] 0 bytes
  1192. ['video_files/7. Reverse a Stack.mp4'] 0 bytes
  1193. ['video_files/7. Reverse a Stack.mp4_thumb.jpg'] 0 bytes
  1194. ['video_files/7. Root to Leaf Path.mp4'] 0 bytes
  1195. ['video_files/7. Root to Leaf Path.mp4_thumb.jpg'] 0 bytes
  1196. ['video_files/7. Size of a LL.mp4'] 0 bytes
  1197. ['video_files/7. Size of a LL.mp4_thumb.jpg'] 0 bytes
  1198. ['video_files/7. Sorted & Rotated Array Search.mp4'] 0 bytes
  1199. ['video_files/7. Sorted & Rotated Array Search.mp4_thumb.jpg'] 0 bytes
  1200. ['video_files/7. Sorting an ArrayList.mp4'] 0 bytes
  1201. ['video_files/7. Sorting an ArrayList.mp4_thumb.jpg'] 0 bytes
  1202. ['video_files/7. Space Complexity.mp4'] 0 bytes
  1203. ['video_files/7. Space Complexity.mp4_thumb.jpg'] 0 bytes
  1204. ['video_files/7. Special Note.mp4'] 0 bytes
  1205. ['video_files/7. Special Note.mp4_thumb.jpg'] 0 bytes
  1206. ['video_files/7. Spiral Matrix Code.mp4'] 0 bytes
  1207. ['video_files/7. Spiral Matrix Code.mp4_thumb.jpg'] 0 bytes
  1208. ['video_files/7. Stack using 2 Queues.mp4'] 0 bytes
  1209. ['video_files/7. Stack using 2 Queues.mp4_thumb.jpg'] 0 bytes
  1210. ['video_files/7. Sum of first N natural numbers.mp4'] 0 bytes
  1211. ['video_files/7. Sum of first N natural numbers.mp4_thumb.jpg'] 0 bytes
  1212. ['video_files/7. Sun Of a & b.mp4'] 0 bytes
  1213. ['video_files/7. Sun Of a & b.mp4_thumb.jpg'] 0 bytes
  1214. ['video_files/7. Ternary Operators.mp4'] 0 bytes
  1215. ['video_files/7. Ternary Operators.mp4_thumb.jpg'] 0 bytes
  1216. ['video_files/7. Top View of a Tree (Code).mp4'] 0 bytes
  1217. ['video_files/7. Top View of a Tree (Code).mp4_thumb.jpg'] 0 bytes
  1218. ['video_files/7. Topological Sorting (using DFS).mp4'] 0 bytes
  1219. ['video_files/7. Topological Sorting (using DFS).mp4_thumb.jpg'] 0 bytes
  1220. ['video_files/7. Unbounded Knapsack (Tabulation).mp4'] 0 bytes
  1221. ['video_files/7. Unbounded Knapsack (Tabulation).mp4_thumb.jpg'] 0 bytes
  1222. ["video_files/7.. Binary 1's Complement.mp4"] 0 bytes
  1223. ["video_files/7.. Binary 1's Complement.mp4_thumb.jpg"] 0 bytes
  1224. ['video_files/7.Print Nth Fibonacci number.mp4'] 0 bytes
  1225. ['video_files/7.Print Nth Fibonacci number.mp4_thumb.jpg'] 0 bytes
  1226. ['video_files/8. ArrayList (Implementation in Java).mp4'] 0 bytes
  1227. ['video_files/8. ArrayList (Implementation in Java).mp4_thumb.jpg'] 0 bytes
  1228. ['video_files/8. Binary Left Shift.mp4'] 0 bytes
  1229. ['video_files/8. Binary Left Shift.mp4_thumb.jpg'] 0 bytes
  1230. ['video_files/8. Binary Search Code.mp4'] 0 bytes
  1231. ['video_files/8. Binary Search Code.mp4_thumb.jpg'] 0 bytes
  1232. ['video_files/8. COMMENTS IN JAVA.mp4'] 0 bytes
  1233. ['video_files/8. COMMENTS IN JAVA.mp4_thumb.jpg'] 0 bytes
  1234. ['video_files/8. Check If A Student Is Pass Or Fail.mp4'] 0 bytes
  1235. ['video_files/8. Check If A Student Is Pass Or Fail.mp4_thumb.jpg'] 0 bytes
  1236. ['video_files/8. Climbing Stairs (Tabulation DP).mp4'] 0 bytes
  1237. ['video_files/8. Climbing Stairs (Tabulation DP).mp4_thumb.jpg'] 0 bytes
  1238. ['video_files/8. Copy Constructor.mp4'] 0 bytes
  1239. ['video_files/8. Copy Constructor.mp4_thumb.jpg'] 0 bytes
  1240. ['video_files/8. Diagonal Sum.mp4'] 0 bytes
  1241. ['video_files/8. Find Factorial.mp4'] 0 bytes
  1242. ['video_files/8. Find Factorial.mp4_thumb.jpg'] 0 bytes
  1243. ['video_files/8. First Non-Repeating Letter.mp4'] 0 bytes
  1244. ['video_files/8. First Non-Repeating Letter.mp4_thumb.jpg'] 0 bytes
  1245. ['video_files/8. Has Path (Using DFS).mp4'] 0 bytes
  1246. ['video_files/8. Has Path (Using DFS).mp4_thumb.jpg'] 0 bytes
  1247. ['video_files/8. Inbuilt sort.mp4'] 0 bytes
  1248. ['video_files/8. Inbuilt sort.mp4_thumb.jpg'] 0 bytes
  1249. ['video_files/8. Linked HashMap.mp4'] 0 bytes
  1250. ['video_files/8. Linked HashMap.mp4_thumb.jpg'] 0 bytes
  1251. ['video_files/8. Live Mentorship Session (on Linkedin).mp4'] 0 bytes
  1252. ['video_files/8. Live Mentorship Session (on Linkedin).mp4_thumb.jpg'] 0 bytes
  1253. ['video_files/8. Maximum length chain of pairs.mp4'] 0 bytes
  1254. ['video_files/8. Maximum length chain of pairs.mp4_thumb.jpg'] 0 bytes
  1255. ['video_files/8. Merge Sort on LL.mp4'] 0 bytes
  1256. ['video_files/8. Merge Sort on LL.mp4_thumb.jpg'] 0 bytes
  1257. ['video_files/8. N Queens - all ways.mp4'] 0 bytes
  1258. ['video_files/8. N Queens - all ways.mp4_thumb.jpg'] 0 bytes
  1259. ['video_files/8. Postorder Traversal.mp4'] 0 bytes
  1260. ['video_files/8. Postorder Traversal.mp4_thumb.jpg'] 0 bytes
  1261. ['video_files/8. Print Reverse Of A Number.mp4'] 0 bytes
  1262. ['video_files/8. Print Reverse Of A Number.mp4_thumb.jpg'] 0 bytes
  1263. ['video_files/8. Remove First in LL.mp4'] 0 bytes
  1264. ['video_files/8. Remove First in LL.mp4_thumb.jpg'] 0 bytes
  1265. ['video_files/8. Remove from Heap.mp4'] 0 bytes
  1266. ['video_files/8. Remove from Heap.mp4_thumb.jpg'] 0 bytes
  1267. ['video_files/8. Simple Loop Analysis.mp4'] 0 bytes
  1268. ['video_files/8. Simple Loop Analysis.mp4_thumb.jpg'] 0 bytes
  1269. ['video_files/8. Solid Rhombus Pattern.mp4'] 0 bytes
  1270. ['video_files/8. Solid Rhombus Pattern.mp4_thumb.jpg'] 0 bytes
  1271. ['video_files/8. Sorted & Rotated Array Code.mp4'] 0 bytes
  1272. ['video_files/8. Sorted & Rotated Array Code.mp4_thumb.jpg'] 0 bytes
  1273. ['video_files/8. Starts With Problem.mp4'] 0 bytes
  1274. ['video_files/8. Starts With Problem.mp4_thumb.jpg'] 0 bytes
  1275. ['video_files/8. Stock Span Problem.mp4'] 0 bytes
  1276. ['video_files/8. Stock Span Problem.mp4_thumb.jpg'] 0 bytes
  1277. ['video_files/8. String Function - Compare.mp4'] 0 bytes
  1278. ['video_files/8. String Function - Compare.mp4_thumb.jpg'] 0 bytes
  1279. ['video_files/8. Validate BST.mp4'] 0 bytes
  1280. ['video_files/8. Validate BST.mp4_thumb.jpg'] 0 bytes
  1281. ['video_files/8.Check if array is sorted or not.mp4'] 0 bytes
  1282. ['video_files/8.Check if array is sorted or not.mp4_thumb.jpg'] 0 bytes
  1283. ['video_files/9 - Binary Right Shift.mp4'] 0 bytes
  1284. ['video_files/9 - Binary Right Shift.mp4_thumb.jpg'] 0 bytes
  1285. ['video_files/9. Counting Sort.mp4'] 0 bytes
  1286. ['video_files/9. Counting Sort.mp4_thumb.jpg'] 0 bytes
  1287. ['video_files/9. Destructors.mp4'] 0 bytes
  1288. ['video_files/9. Destructors.mp4_thumb.jpg'] 0 bytes
  1289. ['video_files/9. Find Binomial Coefficent.mp4'] 0 bytes
  1290. ['video_files/9. Find Binomial Coefficent.mp4_thumb.jpg'] 0 bytes
  1291. ['video_files/9. Heap Sort.mp4'] 0 bytes
  1292. ['video_files/9. Heap Sort.mp4_thumb.jpg'] 0 bytes
  1293. ['video_files/9. Hollow Rhombus Pattern.mp4'] 0 bytes
  1294. ['video_files/9. Hollow Rhombus Pattern.mp4_thumb.jpg'] 0 bytes
  1295. ['video_files/9. Indian Coins.mp4'] 0 bytes
  1296. ['video_files/9. Indian Coins.mp4_thumb.jpg'] 0 bytes
  1297. ['video_files/9. Input In Java.mp4'] 0 bytes
  1298. ['video_files/9. Input In Java.mp4_thumb.jpg'] 0 bytes
  1299. ['video_files/9. Interleave two halves of a Queue.mp4'] 0 bytes
  1300. ['video_files/9. Interleave two halves of a Queue.mp4_thumb.jpg'] 0 bytes
  1301. ['video_files/9. Level order Traversal.mp4'] 0 bytes
  1302. ['video_files/9. Level order Traversal.mp4_thumb.jpg'] 0 bytes
  1303. ['video_files/9. Live Mentorship Session - 7 (Interview Prep).mp4'] 0 bytes
  1304. ['video_files/9. Live Mentorship Session - 7 (Interview Prep).mp4_thumb.jpg'] 0 bytes
  1305. ['video_files/9. Merge Sort on LL (Code).mp4'] 0 bytes
  1306. ['video_files/9. Merge Sort on LL (Code).mp4_thumb.jpg'] 0 bytes
  1307. ['video_files/9. Mirror a BST.mp4'] 0 bytes
  1308. ['video_files/9. Mirror a BST.mp4_thumb.jpg'] 0 bytes
  1309. ['video_files/9. Multi-dimensional ArrayLists.mp4'] 0 bytes
  1310. ['video_files/9. Multi-dimensional ArrayLists.mp4_thumb.jpg'] 0 bytes
  1311. ['video_files/9. N Queens - Time Complexity.mp4'] 0 bytes
  1312. ['video_files/9. N Queens - Time Complexity.mp4_thumb.jpg'] 0 bytes
  1313. ['video_files/9. Nested Loop 1 Analysis.mp4'] 0 bytes
  1314. ['video_files/9. Nested Loop 1 Analysis.mp4_thumb.jpg'] 0 bytes
  1315. ['video_files/9. Next greater element.mp4'] 0 bytes
  1316. ['video_files/9. Next greater element.mp4_thumb.jpg'] 0 bytes
  1317. ['video_files/9. Remove Last in LL.mp4'] 0 bytes
  1318. ['video_files/9. Remove Last in LL.mp4_thumb.jpg'] 0 bytes
  1319. ['video_files/9. Reverse In Array.mp4'] 0 bytes
  1320. ['video_files/9. Reverse In Array.mp4_thumb.jpg'] 0 bytes
  1321. ['video_files/9. Reverse The Given Number.mp4'] 0 bytes
  1322. ['video_files/9. Reverse The Given Number.mp4_thumb.jpg'] 0 bytes
  1323. ['video_files/9. Search In Sorted Matrix.mp4'] 0 bytes
  1324. ['video_files/9. Search In Sorted Matrix.mp4_thumb.jpg'] 0 bytes
  1325. ['video_files/9. Switch Statement.mp4'] 0 bytes
  1326. ['video_files/9. Switch Statement.mp4_thumb.jpg'] 0 bytes
  1327. ['video_files/9. TreeMap.mp4'] 0 bytes
  1328. ['video_files/9. TreeMap.mp4_thumb.jpg'] 0 bytes
  1329. ['video_files/9. Unique Substrings.mp4'] 0 bytes
  1330. ['video_files/9. Unique Substrings.mp4_thumb.jpg'] 0 bytes
  1331. ['video_files/9.First Occurrence.mp4'] 0 bytes
  1332. ['video_files/9.First Occurrence.mp4_thumb.jpg'] 0 bytes
  1333. ['video_files/9.String Function - Substring .mp4'] 0 bytes
  1334. ['video_files/9.String Function - Substring .mp4_thumb.jpg'] 0 bytes
  1335. ['video_files/Bonus LIVE Class.mp4'] 0 bytes
  1336. ['video_files/Bonus LIVE Class.mp4_thumb.jpg'] 0 bytes
  1337. ['Curriculum Easy Navigation.html'] 0 bytes
  1338. ['favicon.webp'] 0 bytes
  1339. ['logo.png'] 0 bytes

Discussion