d8:announce33:http://0d.kebhana.mx:443/announce13:announce-listll33:http://0d.kebhana.mx:443/announceel38:udp://tw.opentracker.ga:36920/announceel40:udp://temp1.opentracker.gq:6969/announceel40:udp://temp2.opentracker.gq:6969/announceel41:udp://tracker.torrent.eu.org:451/announceel34:http://torrent.nwps.ws:80/announceel32:udp://explodie.org:6969/announceel36:https://opentracker.xyz:443/announceel30:https://t.quic.ws:443/announceel45:https://tracker.fastdownload.xyz:443/announceel42:udp://tracker.opentrackr.org:1337/announceel39:udp://ipv4.tracker.harry.lu:80/announceel43:udp://tracker.coppersurfer.tk:6969/announceel39:udp://tracker.justseed.it:1337/announceel35:udp://open.demonii.si:1337/announceee10:created by37:ruTorrent (PHP Class - Adrien Gibrat)13:creation datei1548164903e4:infod5:filesld6:lengthi152965744e4:pathl15:1. Introduction29:1. Curriculum Walkthrough.mp4eed6:lengthi11618e4:pathl15:1. Introduction29:1. Curriculum Walkthrough.vtteed6:lengthi56026473e4:pathl15:1. Introduction37:2. What Order Should You Watch In.mp4eed6:lengthi4110e4:pathl15:1. Introduction37:2. What Order Should You Watch In.vtteed6:lengthi59004230e4:pathl15:1. Introduction30:3. How I'm Running My Code.mp4eed6:lengthi4939e4:pathl15:1. Introduction30:3. How I'm Running My Code.vtteed6:lengthi220e4:pathl24:10. Searching Algorithms21:1. PREREQUISITES.htmleed6:lengthi114940231e4:pathl24:10. Searching Algorithms30:10. Binary Search Solution.mp4eed6:lengthi21834e4:pathl24:10. Searching Algorithms30:10. Binary Search Solution.vtteed6:lengthi886e4:pathl24:10. Searching Algorithms24:10.1 binary_search.js.jseed6:lengthi30807337e4:pathl24:10. Searching Algorithms27:11. Binary Search BIG O.mp4eed6:lengthi8419e4:pathl24:10. Searching Algorithms27:11. Binary Search BIG O.vtteed6:lengthi16648015e4:pathl24:10. Searching Algorithms27:12. Naive String Search.mp4eed6:lengthi16655620e4:pathl24:10. Searching Algorithms27:12. Naive String Search.vtteed6:lengthi80510099e4:pathl24:10. Searching Algorithms42:13. Naive String Search Implementation.mp4eed6:lengthi15777e4:pathl24:10. Searching Algorithms42:13. Naive String Search Implementation.vtteed6:lengthi305e4:pathl24:10. Searching Algorithms24:13.1 string_search.js.jseed6:lengthi90e4:pathl24:10. Searching Algorithms24:14. KNP COMING SOON.htmleed6:lengthi34205315e4:pathl24:10. Searching Algorithms25:2. Intro to Searching.mp4eed6:lengthi5900e4:pathl24:10. Searching Algorithms25:2. Intro to Searching.vtteed6:lengthi103e4:pathl24:10. Searching Algorithms15:2.1 Slides.htmleed6:lengthi48897816e4:pathl24:10. Searching Algorithms29:3. Intro to Linear Search.mp4eed6:lengthi6981e4:pathl24:10. Searching Algorithms29:3. Intro to Linear Search.vtteed6:lengthi151e4:pathl24:10. Searching Algorithms30:4. Linear Search Exercise.htmleed6:lengthi36402620e4:pathl24:10. Searching Algorithms29:5. Linear Search Solution.mp4eed6:lengthi7112e4:pathl24:10. Searching Algorithms29:5. Linear Search Solution.vtteed6:lengthi177e4:pathl24:10. Searching Algorithms23:5.1 linear_search.js.jseed6:lengthi4793776e4:pathl24:10. Searching Algorithms26:6. Linear Search BIG O.mp4eed6:lengthi2935e4:pathl24:10. Searching Algorithms26:6. Linear Search BIG O.vtteed6:lengthi37993519e4:pathl24:10. Searching Algorithms29:7. Intro to Binary Search.mp4eed6:lengthi8654e4:pathl24:10. Searching Algorithms29:7. Intro to Binary Search.vtteed6:lengthi11156444e4:pathl24:10. Searching Algorithms31:8. Binary Search PseudoCode.mp4eed6:lengthi3996e4:pathl24:10. Searching Algorithms31:8. Binary Search PseudoCode.vtteed6:lengthi151e4:pathl24:10. Searching Algorithms30:9. Binary Search Exercise.htmleed6:lengthi220e4:pathl15:11. Bubble Sort21:1. PREREQUISITES.htmleed6:lengthi47439593e4:pathl15:11. Bubble Sort41:2. Introduction to Sorting Algorithms.mp4eed6:lengthi12442e4:pathl15:11. Bubble Sort41:2. Introduction to Sorting Algorithms.vtteed6:lengthi124e4:pathl15:11. Bubble Sort23:2.1 Sorting Slides.htmleed6:lengthi113e4:pathl15:11. Bubble Sort35:2.2 Sorting Animations Website.htmleed6:lengthi32877521e4:pathl15:11. Bubble Sort34:3. Built-In JavaScript Sorting.mp4eed6:lengthi6635e4:pathl15:11. Bubble Sort34:3. Built-In JavaScript Sorting.vtteed6:lengthi152e4:pathl15:11. Bubble Sort39:3.1 Built-In JS Sort Documentation.htmleed6:lengthi25629961e4:pathl15:11. Bubble Sort27:4. Bubble Sort Overview.mp4eed6:lengthi10510e4:pathl15:11. Bubble Sort27:4. Bubble Sort Overview.vtteed6:lengthi92e4:pathl15:11. Bubble Sort45:4.1 Visualgo Sorting (Click Bubble Sort).htmleed6:lengthi67000252e4:pathl15:11. Bubble Sort33:5. Bubble Sort Implementation.mp4eed6:lengthi13146e4:pathl15:11. Bubble Sort33:5. Bubble Sort Implementation.vtteed6:lengthi681e4:pathl15:11. Bubble Sort28:5.1 bubble_unoptimized.js.jseed6:lengthi33505662e4:pathl15:11. Bubble Sort31:6. Bubble Sort Optimization.mp4eed6:lengthi5780e4:pathl15:11. Bubble Sort31:6. Bubble Sort Optimization.vtteed6:lengthi403e4:pathl15:11. Bubble Sort26:6.1 optimized_bubble.js.jseed6:lengthi13120271e4:pathl15:11. Bubble Sort35:7. Bubble Sort BIG O Complexity.mp4eed6:lengthi2064e4:pathl15:11. Bubble Sort35:7. Bubble Sort BIG O Complexity.vtteed6:lengthi405e4:pathl18:12. Selection Sort21:1. PREREQUISITES.htmleed6:lengthi24474622e4:pathl18:12. Selection Sort34:2. Selection Sort Introduction.mp4eed6:lengthi9331e4:pathl18:12. Selection Sort34:2. Selection Sort Introduction.vtteed6:lengthi124e4:pathl18:12. Selection Sort23:2.1 Sorting Slides.htmleed6:lengthi92e4:pathl18:12. Selection Sort48:2.2 Visualgo Sorting (Click Selection Sort).htmleed6:lengthi72134198e4:pathl18:12. Selection Sort36:3. Selection Sort Implementation.mp4eed6:lengthi13978e4:pathl18:12. Selection Sort36:3. Selection Sort Implementation.vtteed6:lengthi867e4:pathl18:12. Selection Sort24:3.1 selection_sort.js.jseed6:lengthi9112808e4:pathl18:12. Selection Sort38:4. Selection Sort Big O Complexity.mp4eed6:lengthi2476e4:pathl18:12. Selection Sort38:4. Selection Sort Big O Complexity.vtteed6:lengthi466e4:pathl18:13. Insertion Sort21:1. PREREQUISITES.htmleed6:lengthi9516865e4:pathl18:13. Insertion Sort34:2. Insertion Sort Introduction.mp4eed6:lengthi4721e4:pathl18:13. Insertion Sort34:2. Insertion Sort Introduction.vtteed6:lengthi92e4:pathl18:13. Insertion Sort48:2.1 Visualgo Sorting (Click Insertion Sort).htmleed6:lengthi124e4:pathl18:13. Insertion Sort23:2.2 Sorting Slides.htmleed6:lengthi51173814e4:pathl18:13. Insertion Sort36:3. Insertion Sort Implementation.mp4eed6:lengthi14332e4:pathl18:13. Insertion Sort36:3. Insertion Sort Implementation.vtteed6:lengthi304e4:pathl18:13. Insertion Sort24:3.1 insertion_sort.js.jseed6:lengthi15842686e4:pathl18:13. Insertion Sort38:4. Insertion Sort BIG O Complexity.mp4eed6:lengthi3623e4:pathl18:13. Insertion Sort38:4. Insertion Sort BIG O Complexity.vtteed6:lengthi23354917e4:pathl51:14. Comparing Bubble, Selection, and Insertion Sort54:1. Comparing Bubble, Selection, and Insertion Sort.mp4eed6:lengthi8385e4:pathl51:14. Comparing Bubble, Selection, and Insertion Sort54:1. Comparing Bubble, Selection, and Insertion Sort.vtteed6:lengthi113e4:pathl51:14. Comparing Bubble, Selection, and Insertion Sort35:1.1 Sorting Animations Website.htmleed6:lengthi579e4:pathl14:15. Merge Sort21:1. PREREQUISITES.htmleed6:lengthi35986544e4:pathl14:15. Merge Sort33:2. Intro to the Crazier Sorts.mp4eed6:lengthi8878e4:pathl14:15. Merge Sort33:2. Intro to the Crazier Sorts.vtteed6:lengthi126e4:pathl14:15. Merge Sort15:2.1 Slides.htmleed6:lengthi23946251e4:pathl14:15. Merge Sort30:3. Merge Sort Introduction.mp4eed6:lengthi7570e4:pathl14:15. Merge Sort30:3. Merge Sort Introduction.vtteed6:lengthi92e4:pathl14:15. Merge Sort48:3.1 Visualgo Sorting (click the merge tab).htmleed6:lengthi23317854e4:pathl14:15. Merge Sort27:4. Merging Arrays Intro.mp4eed6:lengthi7640e4:pathl14:15. Merge Sort27:4. Merging Arrays Intro.vtteed6:lengthi40737147e4:pathl14:15. Merge Sort36:5. Merging Arrays Implementation.mp4eed6:lengthi8897e4:pathl14:15. Merge Sort36:5. Merging Arrays Implementation.vtteed6:lengthi558e4:pathl14:15. Merge Sort21:5.1 mergeArrays.js.jseed6:lengthi7779747e4:pathl14:15. Merge Sort32:6. Writing Merge Sort Part 1.mp4eed6:lengthi3608e4:pathl14:15. Merge Sort32:6. Writing Merge Sort Part 1.vtteed6:lengthi87060249e4:pathl14:15. Merge Sort32:7. Writing Merge Sort Part 2.mp4eed6:lengthi15085e4:pathl14:15. Merge Sort32:7. Writing Merge Sort Part 2.vtteed6:lengthi776e4:pathl14:15. Merge Sort19:7.1 mergeSort.js.jseed6:lengthi31132780e4:pathl14:15. Merge Sort34:8. Merge Sort BIG O Complexity.mp4eed6:lengthi8721e4:pathl14:15. Merge Sort34:8. Merge Sort BIG O Complexity.vtteed6:lengthi87e4:pathl14:15. Merge Sort26:8.1 Big O Cheat Sheet.htmleed6:lengthi636e4:pathl14:16. Quick Sort21:1. PREREQUISITES.htmleed6:lengthi23509434e4:pathl14:16. Quick Sort33:2. Introduction to Quick Sort.mp4eed6:lengthi13447e4:pathl14:16. Quick Sort33:2. Introduction to Quick Sort.vtteed6:lengthi126e4:pathl14:16. Quick Sort15:2.1 Slides.htmleed6:lengthi92e4:pathl14:16. Quick Sort44:2.2 Visualgo Sorting (Click Quick Sort).htmleed6:lengthi30334633e4:pathl14:16. Quick Sort32:3. Pivot Helper Introduction.mp4eed6:lengthi12085e4:pathl14:16. Quick Sort32:3. Pivot Helper Introduction.vtteed6:lengthi50695922e4:pathl14:16. Quick Sort34:4. Pivot Helper Implementation.mp4eed6:lengthi10998e4:pathl14:16. Quick Sort34:4. Pivot Helper Implementation.vtteed6:lengthi938e4:pathl14:16. Quick Sort15:4.1 pivot.js.jseed6:lengthi48941156e4:pathl14:16. Quick Sort32:5. Quick Sort Implementation.mp4eed6:lengthi11775e4:pathl14:16. Quick Sort32:5. Quick Sort Implementation.vtteed6:lengthi942e4:pathl14:16. Quick Sort19:5.1 quicksort.js.jseed6:lengthi42723861e4:pathl14:16. Quick Sort40:6. Quick Sort Call Stack Walkthrough.mp4eed6:lengthi5442e4:pathl14:16. Quick Sort40:6. Quick Sort Call Stack Walkthrough.vtteed6:lengthi13458989e4:pathl14:16. Quick Sort34:7. Quick Sort Big O Complexity.mp4eed6:lengthi5629e4:pathl14:16. Quick Sort34:7. Quick Sort Big O Complexity.vtteed6:lengthi639e4:pathl14:17. Radix Sort21:1. PREREQUISITES.htmleed6:lengthi45870438e4:pathl14:17. Radix Sort30:2. Radix Sort Introduction.mp4eed6:lengthi13185e4:pathl14:17. Radix Sort30:2. Radix Sort Introduction.vtteed6:lengthi92e4:pathl14:17. Radix Sort44:2.1 Visualgo Sorting (Click Radix Sort).htmleed6:lengthi126e4:pathl14:17. Radix Sort15:2.2 Slides.htmleed6:lengthi63085309e4:pathl14:17. Radix Sort32:3. Radix Sort Helper Methods.mp4eed6:lengthi14863e4:pathl14:17. Radix Sort32:3. Radix Sort Helper Methods.vtteed6:lengthi421e4:pathl14:17. Radix Sort23:3.1 radix_helpers.js.jseed6:lengthi20406691e4:pathl14:17. Radix Sort28:4. Radix Sort Pseudocode.mp4eed6:lengthi5918e4:pathl14:17. Radix Sort28:4. Radix Sort Pseudocode.vtteed6:lengthi78386882e4:pathl14:17. Radix Sort32:5. Radix Sort Implementation.mp4eed6:lengthi12548e4:pathl14:17. Radix Sort32:5. Radix Sort Implementation.vtteed6:lengthi813e4:pathl14:17. Radix Sort20:5.1 radix_sort.js.jseed6:lengthi35677064e4:pathl14:17. Radix Sort34:6. Radix Sort BIG O Complexity.mp4eed6:lengthi4981e4:pathl14:17. Radix Sort34:6. Radix Sort BIG O Complexity.vtteed6:lengthi57675381e4:pathl32:18. Data Structures Introduction39:1. Which Data Structure Is The Best.mp4eed6:lengthi19057e4:pathl32:18. Data Structures Introduction39:1. Which Data Structure Is The Best.vtteed6:lengthi114e4:pathl32:18. Data Structures Introduction15:1.1 SLIDES.htmleed6:lengthi29127806e4:pathl32:18. Data Structures Introduction35:2. ES2015 Class Syntax Overview.mp4eed6:lengthi8047e4:pathl32:18. Data Structures Introduction35:2. ES2015 Class Syntax Overview.vtteed6:lengthi114e4:pathl32:18. Data Structures Introduction15:2.1 SLIDES.htmleed6:lengthi134e4:pathl32:18. Data Structures Introduction27:2.2 MDN JS Class Guide.htmleed6:lengthi35585199e4:pathl32:18. Data Structures Introduction40:3. Data Structures The Class Keyword.mp4eed6:lengthi9253e4:pathl32:18. Data Structures Introduction40:3. Data Structures The Class Keyword.vtteed6:lengthi273e4:pathl32:18. Data Structures Introduction23:3.1 class_keyword.js.jseed6:lengthi73059177e4:pathl32:18. Data Structures Introduction46:4. Data Structures Adding Instance Methods.mp4eed6:lengthi12994e4:pathl32:18. Data Structures Introduction46:4. Data Structures Adding Instance Methods.vtteed6:lengthi863e4:pathl32:18. Data Structures Introduction26:4.1 instance_methods.js.jseed6:lengthi43923347e4:pathl32:18. Data Structures Introduction43:5. Data Structures Adding Class Methods.mp4eed6:lengthi9964e4:pathl32:18. Data Structures Introduction43:5. Data Structures Adding Class Methods.vtteed6:lengthi307e4:pathl32:18. Data Structures Introduction21:5.1 point_class.js.jseed6:lengthi938e4:pathl32:18. Data Structures Introduction23:5.2 student_class.js.jseed6:lengthi288e4:pathl23:19. Singly Linked Lists21:1. PREREQUISITES.htmleed6:lengthi42956793e4:pathl23:19. Singly Linked Lists43:10. Singly Linked List Unshift Solution.mp4eed6:lengthi7631e4:pathl23:19. Singly Linked Lists43:10. Singly Linked List Unshift Solution.vtteed6:lengthi1594e4:pathl23:19. Singly Linked Lists37:10.1 Singly_Linked_List_Unshift.js.jseed6:lengthi7768643e4:pathl23:19. Singly Linked Lists36:11. Singly Linked List Get Intro.mp4eed6:lengthi3772e4:pathl23:19. Singly Linked Lists36:11. Singly Linked List Get Intro.vtteed6:lengthi18738266e4:pathl23:19. Singly Linked Lists39:12. Singly Linked List Get Solution.mp4eed6:lengthi4512e4:pathl23:19. Singly Linked Lists39:12. Singly Linked List Get Solution.vtteed6:lengthi1873e4:pathl23:19. Singly Linked Lists33:12.1 Singly_Linked_List_Get.js.jseed6:lengthi4935481e4:pathl23:19. Singly Linked Lists36:13. Singly Linked List Set Intro.mp4eed6:lengthi1773e4:pathl23:19. Singly Linked Lists36:13. Singly Linked List Set Intro.vtteed6:lengthi13079705e4:pathl23:19. Singly Linked Lists39:14. Singly Linked List Set Solution.mp4eed6:lengthi2731e4:pathl23:19. Singly Linked Lists39:14. Singly Linked List Set Solution.vtteed6:lengthi2054e4:pathl23:19. Singly Linked Lists33:14.1 Singly_Linked_List_Set.js.jseed6:lengthi20022905e4:pathl23:19. Singly Linked Lists39:15. Singly Linked List Insert Intro.mp4eed6:lengthi5785e4:pathl23:19. Singly Linked Lists39:15. Singly Linked List Insert Intro.vtteed6:lengthi50954525e4:pathl23:19. Singly Linked Lists42:16. Singly Linked List Insert Solution.mp4eed6:lengthi9578e4:pathl23:19. Singly Linked Lists42:16. Singly Linked List Insert Solution.vtteed6:lengthi2440e4:pathl23:19. Singly Linked Lists36:16.1 Singly_Linked_List_Insert.js.jseed6:lengthi7901107e4:pathl23:19. Singly Linked Lists39:17. Singly Linked List Remove Intro.mp4eed6:lengthi2751e4:pathl23:19. Singly Linked Lists39:17. Singly Linked List Remove Intro.vtteed6:lengthi22411754e4:pathl23:19. Singly Linked Lists42:18. Singly Linked List Remove Solution.mp4eed6:lengthi3944e4:pathl23:19. Singly Linked Lists42:18. Singly Linked List Remove Solution.vtteed6:lengthi2814e4:pathl23:19. Singly Linked Lists36:18.1 Singly_Linked_List_Remove.js.jseed6:lengthi18194771e4:pathl23:19. Singly Linked Lists40:19. Singly Linked List Reverse Intro.mp4eed6:lengthi6286e4:pathl23:19. Singly Linked Lists40:19. Singly Linked List Reverse Intro.vtteed6:lengthi28982550e4:pathl23:19. Singly Linked Lists35:2. Intro to Singly Linked Lists.mp4eed6:lengthi12169e4:pathl23:19. Singly Linked Lists35:2. Intro to Singly Linked Lists.vtteed6:lengthi89e4:pathl23:19. Singly Linked Lists32:2.1 Visualgo - Linked Lists.htmleed6:lengthi114e4:pathl23:19. Singly Linked Lists15:2.2 SLIDES.htmleed6:lengthi64933839e4:pathl23:19. Singly Linked Lists43:20. Singly Linked List Reverse Solution.mp4eed6:lengthi11819e4:pathl23:19. Singly Linked Lists43:20. Singly Linked List Reverse Solution.vtteed6:lengthi3338e4:pathl23:19. Singly Linked Lists37:20.1 Singly_Linked_List_Reverse.js.jseed6:lengthi23039750e4:pathl23:19. Singly Linked Lists43:21. Singly Linked List BIG O Complexity.mp4eed6:lengthi8173e4:pathl23:19. Singly Linked Lists43:21. Singly Linked List BIG O Complexity.vtteed6:lengthi34960651e4:pathl23:19. Singly Linked Lists34:3. Starter Code and Push Intro.mp4eed6:lengthi10067e4:pathl23:19. Singly Linked Lists34:3. Starter Code and Push Intro.vtteed6:lengthi575e4:pathl23:19. Singly Linked Lists38:3.1 Singly_Linked_List_Structure.js.jseed6:lengthi29483792e4:pathl23:19. Singly Linked Lists39:4. Singly Linked List Push Solution.mp4eed6:lengthi6170e4:pathl23:19. Singly Linked Lists39:4. Singly Linked List Push Solution.vtteed6:lengthi593e4:pathl23:19. Singly Linked Lists33:4.1 Singly_Linked_List_Push.js.jseed6:lengthi27997353e4:pathl23:19. Singly Linked Lists35:5. Singly Linked List Pop Intro.mp4eed6:lengthi9461e4:pathl23:19. Singly Linked Lists35:5. Singly Linked List Pop Intro.vtteed6:lengthi48057007e4:pathl23:19. Singly Linked Lists38:6. Singly Linked List Pop Solution.mp4eed6:lengthi10779e4:pathl23:19. Singly Linked Lists38:6. Singly Linked List Pop Solution.vtteed6:lengthi1042e4:pathl23:19. Singly Linked Lists32:6.1 Singly_Linked_List_Pop.js.jseed6:lengthi5764688e4:pathl23:19. Singly Linked Lists37:7. Singly Linked List Shift Intro.mp4eed6:lengthi2176e4:pathl23:19. Singly Linked Lists37:7. Singly Linked List Shift Intro.vtteed6:lengthi23820732e4:pathl23:19. Singly Linked Lists40:8. Singly Linked List Shift Solution.mp4eed6:lengthi3790e4:pathl23:19. Singly Linked Lists40:8. Singly Linked List Shift Solution.vtteed6:lengthi1299e4:pathl23:19. Singly Linked Lists34:8.1 Singly_Linked_List_Shift.js.jseed6:lengthi6809095e4:pathl23:19. Singly Linked Lists39:9. Singly Linked List Unshift Intro.mp4eed6:lengthi2238e4:pathl23:19. Singly Linked Lists39:9. Singly Linked List Unshift Intro.vtteed6:lengthi31926234e4:pathl17:2. Big O Notation21:1. Intro to Big O.mp4eed6:lengthi11079e4:pathl17:2. Big O Notation21:1. Intro to Big O.vtteed6:lengthi109e4:pathl17:2. Big O Notation21:1.1 BIG O Slides.htmleed6:lengthi152e4:pathl17:2. Big O Notation36:10. Big O Space Complexity Quiz.htmleed6:lengthi32760582e4:pathl17:2. Big O Notation30:11. Logs and Section Recap.mp4eed6:lengthi11958e4:pathl17:2. Big O Notation30:11. Logs and Section Recap.vtteed6:lengthi48677375e4:pathl17:2. Big O Notation22:2. Timing Our Code.mp4eed6:lengthi14531e4:pathl17:2. Big O Notation22:2. Timing Our Code.vtteed6:lengthi197e4:pathl17:2. Big O Notation26:2.1 add_up_to_faster.js.jseed6:lengthi245e4:pathl17:2. Big O Notation26:2.2 add_up_to_slower.js.jseed6:lengthi21470606e4:pathl17:2. Big O Notation26:3. Counting Operations.mp4eed6:lengthi5941e4:pathl17:2. Big O Notation26:3. Counting Operations.vtteed6:lengthi25330982e4:pathl17:2. Big O Notation36:4. Visualizing Time Complexities.mp4eed6:lengthi5830e4:pathl17:2. Big O Notation36:4. Visualizing Time Complexities.vtteed6:lengthi111e4:pathl17:2. Big O Notation33:4.1 Performance Tracker Tool.htmleed6:lengthi54168542e4:pathl17:2. Big O Notation30:5. Official Intro to Big O.mp4eed6:lengthi12898e4:pathl17:2. Big O Notation30:5. Official Intro to Big O.vtteed6:lengthi37786899e4:pathl17:2. Big O Notation36:6. Simplifying Big O Expressions.mp4eed6:lengthi12183e4:pathl17:2. Big O Notation36:6. Simplifying Big O Expressions.vtteed6:lengthi152e4:pathl17:2. Big O Notation34:7. Big O Time Complexity Quiz.htmleed6:lengthi152e4:pathl17:2. Big O Notation36:8. Big O Time Complexity Quiz 2.htmleed6:lengthi26963977e4:pathl17:2. Big O Notation23:9. Space Complexity.mp4eed6:lengthi8998e4:pathl17:2. Big O Notation23:9. Space Complexity.vtteed6:lengthi355e4:pathl23:20. Doubly Linked Lists21:1. PREREQUISITES.htmleed6:lengthi7005379e4:pathl23:20. Doubly Linked Lists15:10. Unshift.mp4eed6:lengthi2411e4:pathl23:20. Doubly Linked Lists15:10. Unshift.vtteed6:lengthi19072653e4:pathl23:20. Doubly Linked Lists24:11. Unshift Solution.mp4eed6:lengthi2868e4:pathl23:20. Doubly Linked Lists24:11. Unshift Solution.vtteed6:lengthi1759e4:pathl23:20. Doubly Linked Lists22:11.1 DLL_Unshift.js.jseed6:lengthi12654013e4:pathl23:20. Doubly Linked Lists11:12. Get.mp4eed6:lengthi5964e4:pathl23:20. Doubly Linked Lists11:12. Get.vtteed6:lengthi51502674e4:pathl23:20. Doubly Linked Lists20:13. Get Solution.mp4eed6:lengthi8974e4:pathl23:20. Doubly Linked Lists20:13. Get Solution.vtteed6:lengthi2312e4:pathl23:20. Doubly Linked Lists18:13.1 DLL_Get.js.jseed6:lengthi4909649e4:pathl23:20. Doubly Linked Lists11:14. Set.mp4eed6:lengthi1770e4:pathl23:20. Doubly Linked Lists11:14. Set.vtteed6:lengthi16163516e4:pathl23:20. Doubly Linked Lists20:15. Set Solution.mp4eed6:lengthi12497020e4:pathl23:20. Doubly Linked Lists20:15. Set Solution.vtteed6:lengthi2501e4:pathl23:20. Doubly Linked Lists18:15.1 DLL_Set.js.jseed6:lengthi10678119e4:pathl23:20. Doubly Linked Lists14:16. Insert.mp4eed6:lengthi3839e4:pathl23:20. Doubly Linked Lists14:16. Insert.vtteed6:lengthi51442376e4:pathl23:20. Doubly Linked Lists23:17. Insert Solution.mp4eed6:lengthi8122e4:pathl23:20. Doubly Linked Lists23:17. Insert Solution.vtteed6:lengthi2999e4:pathl23:20. Doubly Linked Lists21:17.1 DLL_Insert.js.jseed6:lengthi10425639e4:pathl23:20. Doubly Linked Lists14:18. Remove.mp4eed6:lengthi3121e4:pathl23:20. Doubly Linked Lists14:18. Remove.vtteed6:lengthi60845396e4:pathl23:20. Doubly Linked Lists23:19. Remove Solution.mp4eed6:lengthi7423e4:pathl23:20. Doubly Linked Lists23:19. Remove Solution.vtteed6:lengthi2999e4:pathl23:20. Doubly Linked Lists21:19.1 DLL_Insert.js.jseed6:lengthi18235671e4:pathl23:20. Doubly Linked Lists39:2. Doubly Linked Lists Introduction.mp4eed6:lengthi6935e4:pathl23:20. Doubly Linked Lists39:2. Doubly Linked Lists Introduction.vtteed6:lengthi89e4:pathl23:20. Doubly Linked Lists36:2.1 Visualgo (Click DLL In Nav).htmleed6:lengthi114e4:pathl23:20. Doubly Linked Lists15:2.2 SLIDES.htmleed6:lengthi17677174e4:pathl23:20. Doubly Linked Lists48:20. Comparing Singly and Doubly Linked Lists.mp4eed6:lengthi6884e4:pathl23:20. Doubly Linked Lists48:20. Comparing Singly and Doubly Linked Lists.vtteed6:lengthi151e4:pathl23:20. Doubly Linked Lists28:21. DLL push - Exercise.htmleed6:lengthi152e4:pathl23:20. Doubly Linked Lists32:22. DLL unshift - Exercise.htmleed6:lengthi151e4:pathl23:20. Doubly Linked Lists29:23. DLL shift - Exercise.htmleed6:lengthi151e4:pathl23:20. Doubly Linked Lists27:24. DLL set - Exercise.htmleed6:lengthi152e4:pathl23:20. Doubly Linked Lists29:25. DLL- remove Exercise.htmleed6:lengthi152e4:pathl23:20. Doubly Linked Lists27:26. DLL pop - Exercise.htmleed6:lengthi152e4:pathl23:20. Doubly Linked Lists27:27. DLL get - Exercise.htmleed6:lengthi151e4:pathl23:20. Doubly Linked Lists54:28. Doubly Linked Lists insert remove - Exercise.htmleed6:lengthi151e4:pathl23:20. Doubly Linked Lists31:29. DLL reverse - Exercise.htmleed6:lengthi13906742e4:pathl23:20. Doubly Linked Lists32:3. Setting Up Our Node Class.mp4eed6:lengthi3789e4:pathl23:20. Doubly Linked Lists32:3. Setting Up Our Node Class.vtteed6:lengthi248e4:pathl23:20. Doubly Linked Lists21:3.1 DLL_Classes.js.jseed6:lengthi9224998e4:pathl23:20. Doubly Linked Lists11:4. Push.mp4eed6:lengthi2943e4:pathl23:20. Doubly Linked Lists11:4. Push.vtteed6:lengthi25406043e4:pathl23:20. Doubly Linked Lists20:5. Push Solution.mp4eed6:lengthi5150e4:pathl23:20. Doubly Linked Lists20:5. Push Solution.vtteed6:lengthi592e4:pathl23:20. Doubly Linked Lists18:5.1 DLL_Push.js.jseed6:lengthi12145046e4:pathl23:20. Doubly Linked Lists10:6. Pop.mp4eed6:lengthi4767e4:pathl23:20. Doubly Linked Lists10:6. Pop.vtteed6:lengthi47859157e4:pathl23:20. Doubly Linked Lists19:7. Pop Solution.mp4eed6:lengthi8212e4:pathl23:20. Doubly Linked Lists19:7. Pop Solution.vtteed6:lengthi959e4:pathl23:20. Doubly Linked Lists17:7.1 DLL_Pop.js.jseed6:lengthi11610102e4:pathl23:20. Doubly Linked Lists12:8. Shift.mp4eed6:lengthi3781e4:pathl23:20. Doubly Linked Lists12:8. Shift.vtteed6:lengthi31587859e4:pathl23:20. Doubly Linked Lists21:9. Shift Solution.mp4eed6:lengthi5473e4:pathl23:20. Doubly Linked Lists21:9. Shift Solution.vtteed6:lengthi1420e4:pathl23:20. Doubly Linked Lists19:9.1 DLL_Shift.js.jseed6:lengthi560e4:pathl19:21. Stacks + Queues21:1. PREREQUISITES.htmleed6:lengthi31763042e4:pathl19:21. Stacks + Queues22:2. Intro to Stacks.mp4eed6:lengthi9192e4:pathl19:21. Stacks + Queues22:2. Intro to Stacks.vtteed6:lengthi101e4:pathl19:21. Stacks + Queues22:2.1 Stacks Slides.htmleed6:lengthi31660743e4:pathl19:21. Stacks + Queues37:3. Creating a Stack with an Array.mp4eed6:lengthi9810e4:pathl19:21. Stacks + Queues37:3. Creating a Stack with an Array.vtteed6:lengthi71733082e4:pathl19:21. Stacks + Queues41:4. Writing Our Own Stack From Scratch.mp4eed6:lengthi15500e4:pathl19:21. Stacks + Queues41:4. Writing Our Own Stack From Scratch.vtteed6:lengthi775e4:pathl19:21. Stacks + Queues15:4.1 Stack.js.jseed6:lengthi11366540e4:pathl19:21. Stacks + Queues22:5. BIG O of Stacks.mp4eed6:lengthi3040e4:pathl19:21. Stacks + Queues22:5. BIG O of Stacks.vtteed6:lengthi19690778e4:pathl19:21. Stacks + Queues22:6. Intro to Queues.mp4eed6:lengthi5935e4:pathl19:21. Stacks + Queues22:6. Intro to Queues.vtteed6:lengthi101e4:pathl19:21. Stacks + Queues22:6.1 Queues Slides.htmleed6:lengthi15483661e4:pathl19:21. Stacks + Queues35:7. Creating Queues Using Arrays.mp4eed6:lengthi4457e4:pathl19:21. Stacks + Queues35:7. Creating Queues Using Arrays.vtteed6:lengthi56984538e4:pathl19:21. Stacks + Queues41:8. Writing Our Own Queue From Scratch.mp4eed6:lengthi13175e4:pathl19:21. Stacks + Queues41:8. Writing Our Own Queue From Scratch.vtteed6:lengthi751e4:pathl19:21. Stacks + Queues15:8.1 Queue.js.jseed6:lengthi8457500e4:pathl19:21. Stacks + Queues22:9. BIG O of Queues.mp4eed6:lengthi3484e4:pathl19:21. Stacks + Queues22:9. BIG O of Queues.vtteed6:lengthi625e4:pathl23:22. Binary Search Trees21:1. PREREQUISITES.htmleed6:lengthi22995195e4:pathl23:22. Binary Search Trees16:10. BST Find.mp4eed6:lengthi7006e4:pathl23:22. Binary Search Trees16:10. BST Find.vtteed6:lengthi35955943e4:pathl23:22. Binary Search Trees25:11. BST Find Solution.mp4eed6:lengthi7211e4:pathl23:22. Binary Search Trees25:11. BST Find Solution.vtteed6:lengthi2009e4:pathl23:22. Binary Search Trees19:11.1 BST_Find.js.jseed6:lengthi30479737e4:pathl23:22. Binary Search Trees36:12. Big O of Binary Search Trees.mp4eed6:lengthi8267e4:pathl23:22. Binary Search Trees36:12. Big O of Binary Search Trees.vtteed6:lengthi32203638e4:pathl23:22. Binary Search Trees28:2. Introduction to Trees.mp4eed6:lengthi10110e4:pathl23:22. Binary Search Trees28:2. Introduction to Trees.vtteed6:lengthi100e4:pathl23:22. Binary Search Trees21:2.1 Trees Slides.htmleed6:lengthi57141042e4:pathl23:22. Binary Search Trees21:3. Uses For Trees.mp4eed6:lengthi9510e4:pathl23:22. Binary Search Trees21:3. Uses For Trees.vtteed6:lengthi30605082e4:pathl23:22. Binary Search Trees28:4. Intro to Binary Trees.mp4eed6:lengthi8123e4:pathl23:22. Binary Search Trees28:4. Intro to Binary Trees.vtteed6:lengthi88e4:pathl23:22. Binary Search Trees23:4.1 Visualgo Trees.htmleed6:lengthi4730150e4:pathl23:22. Binary Search Trees16:5. POP QUIZ!.mp4eed6:lengthi1655e4:pathl23:22. Binary Search Trees16:5. POP QUIZ!.vtteed6:lengthi16576973e4:pathl23:22. Binary Search Trees37:6. Searching A Binary Search Tree.mp4eed6:lengthi4421e4:pathl23:22. Binary Search Trees37:6. Searching A Binary Search Tree.vtteed6:lengthi11626374e4:pathl23:22. Binary Search Trees23:7. Our Tree Classes.mp4eed6:lengthi3525e4:pathl23:22. Binary Search Trees23:7. Our Tree Classes.vtteed6:lengthi364e4:pathl23:22. Binary Search Trees21:7.1 BST_Classes.js.jseed6:lengthi17224100e4:pathl23:22. Binary Search Trees17:8. BST Insert.mp4eed6:lengthi6060e4:pathl23:22. Binary Search Trees17:8. BST Insert.vtteed6:lengthi72183245e4:pathl23:22. Binary Search Trees26:9. BST Insert Solution.mp4eed6:lengthi15612e4:pathl23:22. Binary Search Trees26:9. BST Insert Solution.vtteed6:lengthi1117e4:pathl23:22. Binary Search Trees20:9.1 BST_Insert.js.jseed6:lengthi756e4:pathl18:23. Tree Traversal21:1. PREREQUISITES.htmleed6:lengthi17378327e4:pathl18:23. Tree Traversal36:10. Depth First InOrder Solution.mp4eed6:lengthi3355e4:pathl18:23. Tree Traversal36:10. Depth First InOrder Solution.vtteed6:lengthi3178e4:pathl18:23. Tree Traversal27:10.1 Depth_First_Tree.js.jseed6:lengthi35856628e4:pathl18:23. Tree Traversal31:11. When to Use BFS and DFS.mp4eed6:lengthi11260e4:pathl18:23. Tree Traversal31:11. When to Use BFS and DFS.vtteed6:lengthi17955004e4:pathl18:23. Tree Traversal30:2. Intro To Tree Traversal.mp4eed6:lengthi7224e4:pathl18:23. Tree Traversal30:2. Intro To Tree Traversal.vtteed6:lengthi109e4:pathl18:23. Tree Traversal30:2.1 Tree Traversal Slides.htmleed6:lengthi21567265e4:pathl18:23. Tree Traversal33:3. Breadth First Search Intro.mp4eed6:lengthi8576e4:pathl18:23. Tree Traversal33:3. Breadth First Search Intro.vtteed6:lengthi36406748e4:pathl18:23. Tree Traversal36:4. Breadth First Search Solution.mp4eed6:lengthi8402e4:pathl18:23. Tree Traversal36:4. Breadth First Search Solution.vtteed6:lengthi2317e4:pathl18:23. Tree Traversal28:4.1 Breadth_FIrst_Tree.js.jseed6:lengthi24224151e4:pathl18:23. Tree Traversal33:5. Depth First PreOrder Intro.mp4eed6:lengthi8018e4:pathl18:23. Tree Traversal33:5. Depth First PreOrder Intro.vtteed6:lengthi57484178e4:pathl18:23. Tree Traversal36:6. Depth First PreOrder Solution.mp4eed6:lengthi9017e4:pathl18:23. Tree Traversal36:6. Depth First PreOrder Solution.vtteed6:lengthi3178e4:pathl18:23. Tree Traversal26:6.1 Depth_First_Tree.js.jseed6:lengthi19883799e4:pathl18:23. Tree Traversal34:7. Depth First PostOrder Intro.mp4eed6:lengthi5858e4:pathl18:23. Tree Traversal34:7. Depth First PostOrder Intro.vtteed6:lengthi16757976e4:pathl18:23. Tree Traversal37:8. Depth First PostOrder Solution.mp4eed6:lengthi3086e4:pathl18:23. Tree Traversal37:8. Depth First PostOrder Solution.vtteed6:lengthi3178e4:pathl18:23. Tree Traversal26:8.1 Depth_First_Tree.js.jseed6:lengthi9408603e4:pathl18:23. Tree Traversal32:9. Depth First InOrder Intro.mp4eed6:lengthi2925e4:pathl18:23. Tree Traversal32:9. Depth First InOrder Intro.vtteed6:lengthi817e4:pathl16:24. Binary Heaps21:1. PREREQUISITES.htmleed6:lengthi70623849e4:pathl16:24. Binary Heaps31:10. Priority Queue Solution.mp4eed6:lengthi11748e4:pathl16:24. Binary Heaps31:10. Priority Queue Solution.vtteed6:lengthi2213e4:pathl16:24. Binary Heaps25:10.1 Priority_Queue.js.jseed6:lengthi39378402e4:pathl16:24. Binary Heaps29:11. BIG O of Binary Heaps.mp4eed6:lengthi12291e4:pathl16:24. Binary Heaps29:11. BIG O of Binary Heaps.vtteed6:lengthi38791521e4:pathl16:24. Binary Heaps21:2. Intro to Heaps.mp4eed6:lengthi11097e4:pathl16:24. Binary Heaps21:2. Intro to Heaps.vtteed6:lengthi100e4:pathl16:24. Binary Heaps21:2.1 Heaps Slides.htmleed6:lengthi38364732e4:pathl16:24. Binary Heaps20:3. Storing Heaps.mp4eed6:lengthi9688e4:pathl16:24. Binary Heaps20:3. Storing Heaps.vtteed6:lengthi48669925e4:pathl16:24. Binary Heaps24:4. Heap Insert Intro.mp4eed6:lengthi12911e4:pathl16:24. Binary Heaps24:4. Heap Insert Intro.vtteed6:lengthi89e4:pathl16:24. Binary Heaps29:4.1 Visualgo Binary Heap.htmleed6:lengthi73539098e4:pathl16:24. Binary Heaps27:5. Heap Insert Solution.mp4eed6:lengthi13134e4:pathl16:24. Binary Heaps27:5. Heap Insert Solution.vtteed6:lengthi714e4:pathl16:24. Binary Heaps32:5.1 Max_Binary_Heap_Insert.js.jseed6:lengthi50601039e4:pathl16:24. Binary Heaps28:6. Heap ExtractMax Intro.mp4eed6:lengthi12003e4:pathl16:24. Binary Heaps28:6. Heap ExtractMax Intro.vtteed6:lengthi126996805e4:pathl16:24. Binary Heaps31:7. Heap ExtractMax Solution.mp4eed6:lengthi22565e4:pathl16:24. Binary Heaps31:7. Heap ExtractMax Solution.vtteed6:lengthi714e4:pathl16:24. Binary Heaps32:7.1 Max_Binary_Heap_Insert.js.jseed6:lengthi61399757e4:pathl16:24. Binary Heaps27:8. Priority Queue Intro.mp4eed6:lengthi14109e4:pathl16:24. Binary Heaps27:8. Priority Queue Intro.vtteed6:lengthi15724972e4:pathl16:24. Binary Heaps32:9. Priority Queue Pseudocode.mp4eed6:lengthi5516e4:pathl16:24. Binary Heaps32:9. Priority Queue Pseudocode.vtteed6:lengthi299e4:pathl15:25. Hash Tables21:1. PREREQUISITES.htmleed6:lengthi42864573e4:pathl15:25. Hash Tables31:10. Hash Table Get Solution.mp4eed6:lengthi8384e4:pathl15:25. Hash Tables31:10. Hash Table Get Solution.vtteed6:lengthi1026e4:pathl15:25. Hash Tables33:10.1 hash_table_set_and_get.js.jseed6:lengthi5627891e4:pathl15:25. Hash Tables34:11. Hash Table Keys and Values.mp4eed6:lengthi2403e4:pathl15:25. Hash Tables34:11. Hash Table Keys and Values.vtteed6:lengthi63238441e4:pathl15:25. Hash Tables43:12. Hash Table Keys and Values Solution.mp4eed6:lengthi10905e4:pathl15:25. Hash Tables43:12. Hash Table Keys and Values Solution.vtteed6:lengthi1804e4:pathl15:25. Hash Tables37:12.1 hash_table_keys_and_values.js.jseed6:lengthi21223990e4:pathl15:25. Hash Tables35:13. Hash Table Big O Complexity.mp4eed6:lengthi8009e4:pathl15:25. Hash Tables35:13. Hash Table Big O Complexity.vtteed6:lengthi27631950e4:pathl15:25. Hash Tables27:2. Intro to Hash Tables.mp4eed6:lengthi8570e4:pathl15:25. Hash Tables27:2. Intro to Hash Tables.vtteed6:lengthi106e4:pathl15:25. Hash Tables26:2.1 Hash Table Slides.htmleed6:lengthi15158184e4:pathl15:25. Hash Tables29:3. More About Hash Tables.mp4eed6:lengthi6406e4:pathl15:25. Hash Tables29:3. More About Hash Tables.vtteed6:lengthi41993493e4:pathl15:25. Hash Tables30:4. Intro to Hash Functions.mp4eed6:lengthi9314e4:pathl15:25. Hash Tables30:4. Intro to Hash Functions.vtteed6:lengthi32196719e4:pathl15:25. Hash Tables38:5. Writing Our First Hash Function.mp4eed6:lengthi11181e4:pathl15:25. Hash Tables38:5. Writing Our First Hash Function.vtteed6:lengthi221e4:pathl15:25. Hash Tables20:5.1 basic_hash.js.jseed6:lengthi50390186e4:pathl15:25. Hash Tables34:6. Improving Our Hash Function.mp4eed6:lengthi10432e4:pathl15:25. Hash Tables34:6. Improving Our Hash Function.vtteed6:lengthi266e4:pathl15:25. Hash Tables23:6.1 improved_hash.js.jseed6:lengthi14109714e4:pathl15:25. Hash Tables26:7. Handling Collisions.mp4eed6:lengthi6238e4:pathl15:25. Hash Tables26:7. Handling Collisions.vtteed6:lengthi17710058e4:pathl15:25. Hash Tables29:8. Hash Table Set and Get.mp4eed6:lengthi5892e4:pathl15:25. Hash Tables29:8. Hash Table Set and Get.vtteed6:lengthi29700118e4:pathl15:25. Hash Tables30:9. Hash Table Set Solution.mp4eed6:lengthi6706e4:pathl15:25. Hash Tables30:9. Hash Table Set Solution.vtteed6:lengthi1026e4:pathl15:25. Hash Tables32:9.1 hash_table_set_and_get.js.jseed6:lengthi750e4:pathl10:26. Graphs21:1. PREREQUISITES.htmleed6:lengthi8866481e4:pathl10:26. Graphs22:10. Add Edge Intro.mp4eed6:lengthi3566e4:pathl10:26. Graphs22:10. Add Edge Intro.vtteed6:lengthi14405636e4:pathl10:26. Graphs25:11. Add Edge Solution.mp4eed6:lengthi2759e4:pathl10:26. Graphs25:11. Add Edge Solution.vtteed6:lengthi372e4:pathl10:26. Graphs25:11.1 graph_add_edge.js.jseed6:lengthi6460275e4:pathl10:26. Graphs25:12. Remove Edge Intro.mp4eed6:lengthi2337e4:pathl10:26. Graphs25:12. Remove Edge Intro.vtteed6:lengthi19620752e4:pathl10:26. Graphs28:13. Remove Edge Solution.mp4eed6:lengthi3105e4:pathl10:26. Graphs28:13. Remove Edge Solution.vtteed6:lengthi704e4:pathl10:26. Graphs28:13.1 graph_remove_edge.js.jseed6:lengthi11315548e4:pathl10:26. Graphs27:14. Remove Vertex Intro.mp4eed6:lengthi3637e4:pathl10:26. Graphs27:14. Remove Vertex Intro.vtteed6:lengthi40543781e4:pathl10:26. Graphs30:15. Remove Vertex Solution.mp4eed6:lengthi5875e4:pathl10:26. Graphs30:15. Remove Vertex Solution.vtteed6:lengthi1159e4:pathl10:26. Graphs30:15.1 graph_remove_vertex.js.jseed6:lengthi26564662e4:pathl10:26. Graphs22:2. Intro to Graphs.mp4eed6:lengthi5618e4:pathl10:26. Graphs22:2. Intro to Graphs.vtteed6:lengthi101e4:pathl10:26. Graphs22:2.1 Graphs Slides.htmleed6:lengthi106566425e4:pathl10:26. Graphs22:3. Uses for Graphs.mp4eed6:lengthi11095e4:pathl10:26. Graphs22:3. Uses for Graphs.vtteed6:lengthi83e4:pathl10:26. Graphs26:3.1 Music Map Website.htmleed6:lengthi50057885e4:pathl10:26. Graphs22:4. Types of Graphs.mp4eed6:lengthi12026e4:pathl10:26. Graphs22:4. Types of Graphs.vtteed6:lengthi32762363e4:pathl10:26. Graphs38:5. Storing Graphs Adjacency Matrix.mp4eed6:lengthi5402e4:pathl10:26. Graphs38:5. Storing Graphs Adjacency Matrix.vtteed6:lengthi13502842e4:pathl10:26. Graphs36:6. Storing Graphs Adjacency List.mp4eed6:lengthi3432e4:pathl10:26. Graphs36:6. Storing Graphs Adjacency List.vtteed6:lengthi46064526e4:pathl10:26. Graphs38:7. Adjacency Matrix Vs. List BIG O.mp4eed6:lengthi46074766e4:pathl10:26. Graphs38:7. Adjacency Matrix Vs. List BIG O.vtteed6:lengthi11547534e4:pathl10:26. Graphs23:8. Add Vertex Intro.mp4eed6:lengthi3009e4:pathl10:26. Graphs23:8. Add Vertex Intro.vtteed6:lengthi14439775e4:pathl10:26. Graphs26:9. Add Vertex Solution.mp4eed6:lengthi3805e4:pathl10:26. Graphs26:9. Add Vertex Solution.vtteed6:lengthi174e4:pathl10:26. Graphs26:9.1 graph_add_vertex.js.jseed6:lengthi869e4:pathl19:27. Graph Traversal21:1. PREREQUISITES.htmleed6:lengthi48421414e4:pathl19:27. Graph Traversal20:10. BFS Solution.mp4eed6:lengthi9910e4:pathl19:27. Graph Traversal20:10. BFS Solution.vtteed6:lengthi2843e4:pathl19:27. Graph Traversal20:10.1 graph_BFS.js.jseed6:lengthi38814835e4:pathl19:27. Graph Traversal31:2. Intro to Graph Traversal.mp4eed6:lengthi11904e4:pathl19:27. Graph Traversal31:2. Intro to Graph Traversal.vtteed6:lengthi105e4:pathl19:27. Graph Traversal31:2.1 Graph Traversal Slides.htmleed6:lengthi29078670e4:pathl19:27. Graph Traversal34:3. Depth First Graph Traversal.mp4eed6:lengthi11701e4:pathl19:27. Graph Traversal34:3. Depth First Graph Traversal.vtteed6:lengthi45623117e4:pathl19:27. Graph Traversal26:4. DFS Recursive Intro.mp4eed6:lengthi10819e4:pathl19:27. Graph Traversal26:4. DFS Recursive Intro.vtteed6:lengthi110862586e4:pathl19:27. Graph Traversal29:5. DFS Recursive Solution.mp4eed6:lengthi16641e4:pathl19:27. Graph Traversal29:5. DFS Recursive Solution.vtteed6:lengthi1709e4:pathl19:27. Graph Traversal29:5.1 graph_DFS_recursive.js.jseed6:lengthi23708274e4:pathl19:27. Graph Traversal26:6. DFS Iterative Intro.mp4eed6:lengthi5510e4:pathl19:27. Graph Traversal26:6. DFS Iterative Intro.vtteed6:lengthi63785107e4:pathl19:27. Graph Traversal29:7. DFS Iterative Solution.mp4eed6:lengthi11581e4:pathl19:27. Graph Traversal29:7. DFS Iterative Solution.vtteed6:lengthi2234e4:pathl19:27. Graph Traversal29:7.1 graph_DFS_iterative.js.jseed6:lengthi10815016e4:pathl19:27. Graph Traversal36:8. Breadth First Graph Traversal.mp4eed6:lengthi3777e4:pathl19:27. Graph Traversal36:8. Breadth First Graph Traversal.vtteed6:lengthi10719790e4:pathl19:27. Graph Traversal16:9. BFS Intro.mp4eed6:lengthi3609e4:pathl19:27. Graph Traversal16:9. BFS Intro.vtteed6:lengthi879e4:pathl25:28. Dijkstra's Algorithm!21:1. PREREQUISITES.htmleed6:lengthi10993178e4:pathl25:28. Dijkstra's Algorithm!44:2. Intro to Dijkstra's and Prerequisites.mp4eed6:lengthi4048e4:pathl25:28. Dijkstra's Algorithm!44:2. Intro to Dijkstra's and Prerequisites.vtteed6:lengthi105e4:pathl25:28. Dijkstra's Algorithm!15:2.1 Slides.htmleed6:lengthi48143958e4:pathl25:28. Dijkstra's Algorithm!49:3. Who was Dijkstra and what is his Algorithm.mp4eed6:lengthi12582e4:pathl25:28. Dijkstra's Algorithm!49:3. Who was Dijkstra and what is his Algorithm.vtteed6:lengthi28726372e4:pathl25:28. Dijkstra's Algorithm!31:4. Writing a Weighted Graph.mp4eed6:lengthi6683e4:pathl25:28. Dijkstra's Algorithm!31:4. Writing a Weighted Graph.vtteed6:lengthi360e4:pathl25:28. Dijkstra's Algorithm!23:4.1 weightedGraph.js.jseed6:lengthi91416802e4:pathl25:28. Dijkstra's Algorithm!36:5. Walking through the Algorithm.mp4eed6:lengthi23396e4:pathl25:28. Dijkstra's Algorithm!36:5. Walking through the Algorithm.vtteed6:lengthi26827730e4:pathl25:28. Dijkstra's Algorithm!44:6. Introducing Our Simple Priority Queue.mp4eed6:lengthi5029e4:pathl25:28. Dijkstra's Algorithm!44:6. Introducing Our Simple Priority Queue.vtteed6:lengthi278e4:pathl25:28. Dijkstra's Algorithm!29:6.1 simplePriorityQueue.js.jseed6:lengthi45145797e4:pathl25:28. Dijkstra's Algorithm!29:7. Dijkstra's Pseudo-Code.mp4eed6:lengthi6241e4:pathl25:28. Dijkstra's Algorithm!29:7. Dijkstra's Pseudo-Code.vtteed6:lengthi203304240e4:pathl25:28. Dijkstra's Algorithm!40:8. Implementing Dijkstra's Algorithm.mp4eed6:lengthi26325e4:pathl25:28. Dijkstra's Algorithm!40:8. Implementing Dijkstra's Algorithm.vtteed6:lengthi3100e4:pathl25:28. Dijkstra's Algorithm!27:8.1 dijkstra_version1.js.jseed6:lengthi25014133e4:pathl25:28. Dijkstra's Algorithm!35:9. Upgrading the Priority Queue.mp4eed6:lengthi2593e4:pathl25:28. Dijkstra's Algorithm!35:9. Upgrading the Priority Queue.vtteed6:lengthi4829e4:pathl25:28. Dijkstra's Algorithm!28:9.1 dijkstras_version2.js.jseed6:lengthi39339967e4:pathl23:29. Dynamic Programming35:1. Intro to Dynamic Programming.mp4eed6:lengthi7492e4:pathl23:29. Dynamic Programming35:1. Intro to Dynamic Programming.vtteed6:lengthi114e4:pathl23:29. Dynamic Programming15:1.1 Slides.htmleed6:lengthi31418355e4:pathl23:29. Dynamic Programming30:2. Overlapping Subproblems.mp4eed6:lengthi8917e4:pathl23:29. Dynamic Programming30:2. Overlapping Subproblems.vtteed6:lengthi26163476e4:pathl23:29. Dynamic Programming27:3. Optimal Substructure.mp4eed6:lengthi8606e4:pathl23:29. Dynamic Programming27:3. Optimal Substructure.vtteed6:lengthi25382042e4:pathl23:29. Dynamic Programming35:4. Writing A Recursive Solution.mp4eed6:lengthi9638e4:pathl23:29. Dynamic Programming35:4. Writing A Recursive Solution.vtteed6:lengthi35087829e4:pathl23:29. Dynamic Programming38:5. Time Complexity of Our Solution.mp4eed6:lengthi5830e4:pathl23:29. Dynamic Programming38:5. Time Complexity of Our Solution.vtteed6:lengthi25033383e4:pathl23:29. Dynamic Programming36:6. The Problem With Our Solution.mp4eed6:lengthi5442e4:pathl23:29. Dynamic Programming36:6. The Problem With Our Solution.vtteed6:lengthi47636290e4:pathl23:29. Dynamic Programming25:7. Enter Memoization!.mp4eed6:lengthi12574e4:pathl23:29. Dynamic Programming25:7. Enter Memoization!.vtteed6:lengthi17395096e4:pathl23:29. Dynamic Programming43:8. Time Complexity of Memoized Solution.mp4eed6:lengthi4758e4:pathl23:29. Dynamic Programming43:8. Time Complexity of Memoized Solution.vtteed6:lengthi41758489e4:pathl23:29. Dynamic Programming38:9. Tabulation A Bottom Up Approach.mp4eed6:lengthi9887e4:pathl23:29. Dynamic Programming38:9. Tabulation A Bottom Up Approach.vtteed6:lengthi220e4:pathl46:3. Analyzing Performance of Arrays and Objects21:1. PREREQUISITES.htmleed6:lengthi7969136e4:pathl46:3. Analyzing Performance of Arrays and Objects27:2. Section Introduction.mp4eed6:lengthi2836e4:pathl46:3. Analyzing Performance of Arrays and Objects27:2. Section Introduction.vtteed6:lengthi122e4:pathl46:3. Analyzing Performance of Arrays and Objects15:2.1 SLIDES.htmleed6:lengthi26320213e4:pathl46:3. Analyzing Performance of Arrays and Objects27:3. The BIG O of Objects.mp4eed6:lengthi7748e4:pathl46:3. Analyzing Performance of Arrays and Objects27:3. The BIG O of Objects.vtteed6:lengthi151e4:pathl46:3. Analyzing Performance of Arrays and Objects30:4. Object Operations Quiz.htmleed6:lengthi24673868e4:pathl46:3. Analyzing Performance of Arrays and Objects27:5. When are Arrays Slow.mp4eed6:lengthi9518e4:pathl46:3. Analyzing Performance of Arrays and Objects27:5. When are Arrays Slow.vtteed6:lengthi40131959e4:pathl46:3. Analyzing Performance of Arrays and Objects29:6. Big O of Array Methods.mp4eed6:lengthi8567e4:pathl46:3. Analyzing Performance of Arrays and Objects29:6. Big O of Array Methods.vtteed6:lengthi151e4:pathl46:3. Analyzing Performance of Arrays and Objects29:7. Array Operations Quiz.htmleed6:lengthi479e4:pathl17:30. The Wild West41:1. VERY IMPORTANT NOTE! PLEASE READ!.htmleed6:lengthi152e4:pathl17:30. The Wild West46:10. Divide and Conquer - findRotatedIndex.htmleed6:lengthi151e4:pathl17:30. The Wild West20:11. Bubble Sort.htmleed6:lengthi151e4:pathl17:30. The Wild West23:12. Selection Sort.htmleed6:lengthi152e4:pathl17:30. The Wild West30:13. SLL - remove Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West23:14. Insertion Sort.htmleed6:lengthi152e4:pathl17:30. The Wild West40:15. Sorting Exercise - merge helper.htmleed6:lengthi151e4:pathl17:30. The Wild West19:16. Merge Sort.htmleed6:lengthi152e4:pathl17:30. The Wild West40:17. Sorting Exercise - pivot helper.htmleed6:lengthi151e4:pathl17:30. The Wild West19:18. Quick Sort.htmleed6:lengthi152e4:pathl17:30. The Wild West37:19. Radix Sort Helper - getDigit.htmleed6:lengthi151e4:pathl17:30. The Wild West27:2. SLL - push Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West39:20. Radix Sort Helper - digitCount.htmleed6:lengthi152e4:pathl17:30. The Wild West39:21. Radix Sort Helper - mostDigits.htmleed6:lengthi152e4:pathl17:30. The Wild West19:22. Radix Sort.htmleed6:lengthi151e4:pathl17:30. The Wild West38:23. Singly Linked Lists - reverse.htmleed6:lengthi151e4:pathl17:30. The Wild West39:24. Singly Linked Lists - set get.htmleed6:lengthi152e4:pathl17:30. The Wild West36:25. Singly Linked Lists unshift.htmleed6:lengthi151e4:pathl17:30. The Wild West31:26. Stacks - push Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West30:27. Stacks - pop Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West28:28. Stack with 2 Queues.htmleed6:lengthi151e4:pathl17:30. The Wild West34:29. Queues - enqueue Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West26:3. SLL - pop exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West28:30. Queue with 2 stacks.htmleed6:lengthi152e4:pathl17:30. The Wild West34:31. Queues - dequeue Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West45:32. Binary Search Tree - insert Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West32:33. BinarySearchTree - find.htmleed6:lengthi151e4:pathl17:30. The Wild West42:34. Binary Search Tree - DFS Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West42:35. Binary Search Tree - BFS Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West45:36. Binary Search Tree - remove Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West60:37. Binary Search Tree Exercise - Find 2nd largest node.htmleed6:lengthi152e4:pathl17:30. The Wild West56:38. Binary Search Tree Exercise - Check if balanced.htmleed6:lengthi151e4:pathl17:30. The Wild West37:39. BinaryHeap - insert Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West26:4. SLL - get Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West41:40. BinaryHeap - extractMax Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West43:41. Binary Heaps - maxHeapify Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West27:42. Heap Sort Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West32:43. Priority Queue Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West39:44. Hash Table - set get Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West43:45. Hash Table - keys values Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West36:46. Graphs Exercise - addVertex.htmleed6:lengthi152e4:pathl17:30. The Wild West37:47. Graphs Exercise - removeEdge.htmleed6:lengthi151e4:pathl17:30. The Wild West39:48. Graphs Exercise - removeVertex.htmleed6:lengthi151e4:pathl17:30. The Wild West30:49. Graphs - DFS Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West30:5. SLL - insert Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West34:50. Graphs Exercise - addEdge.htmleed6:lengthi151e4:pathl17:30. The Wild West30:51. Graphs - BFS Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West56:52. Graphs Exercise - Determine if there is a cycle.htmleed6:lengthi151e4:pathl17:30. The Wild West35:53. Graphs - Dijkstra Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West42:54. Dynamic Programming - Coin Change.htmleed6:lengthi152e4:pathl17:30. The Wild West39:55. Coin Change - Greedy Algorithm.htmleed6:lengthi152e4:pathl17:30. The Wild West42:56. Frequency Counter - constructNote.htmleed6:lengthi152e4:pathl17:30. The Wild West46:57. Frequency Counter - findAllDuplicates.htmleed6:lengthi152e4:pathl17:30. The Wild West55:58. Frequency Counter Multiple Pointer - findPair.htmleed6:lengthi151e4:pathl17:30. The Wild West32:59. Trie Exercise - addWord.htmleed6:lengthi152e4:pathl17:30. The Wild West29:6. SLL - Rotate Exercise.htmleed6:lengthi151e4:pathl17:30. The Wild West35:60. Trie Exercise - removeWord.htmleed6:lengthi152e4:pathl17:30. The Wild West33:61. Trie Exercise - findWord.htmleed6:lengthi151e4:pathl17:30. The Wild West33:62. Trie Exercise - getWords.htmleed6:lengthi152e4:pathl17:30. The Wild West28:63. Trie - autocomplete.htmleed6:lengthi152e4:pathl17:30. The Wild West26:7. SLL - set Exercise.htmleed6:lengthi152e4:pathl17:30. The Wild West40:8. Divide and Conquer - countZeroes.htmleed6:lengthi152e4:pathl17:30. The Wild West44:9. Divide and Conquer - sortedFrequency.htmleed6:lengthi220e4:pathl27:4. Problem Solving Approach21:1. PREREQUISITES.htmleed6:lengthi34960411e4:pathl27:4. Problem Solving Approach38:2. Introduction to Problem Solving.mp4eed6:lengthi10508e4:pathl27:4. Problem Solving Approach38:2. Introduction to Problem Solving.vtteed6:lengthi119e4:pathl27:4. Problem Solving Approach15:2.1 SLIDES.htmleed6:lengthi57093038e4:pathl27:4. Problem Solving Approach36:3. Step 1 Understand The Problem.mp4eed6:lengthi12341e4:pathl27:4. Problem Solving Approach36:3. Step 1 Understand The Problem.vtteed6:lengthi29080056e4:pathl27:4. Problem Solving Approach31:4. Step 2 Concrete Examples.mp4eed6:lengthi9565e4:pathl27:4. Problem Solving Approach31:4. Step 2 Concrete Examples.vtteed6:lengthi51479050e4:pathl27:4. Problem Solving Approach27:5. Step 3 Break It Down.mp4eed6:lengthi10781e4:pathl27:4. Problem Solving Approach27:5. Step 3 Break It Down.vtteed6:lengthi74920599e4:pathl27:4. Problem Solving Approach31:6. Step 4 Solve Or Simplify.mp4eed6:lengthi14175e4:pathl27:4. Problem Solving Approach31:6. Step 4 Solve Or Simplify.vtteed6:lengthi89971262e4:pathl27:4. Problem Solving Approach36:7. Step 5 Look Back and Refactor.mp4eed6:lengthi23694e4:pathl27:4. Problem Solving Approach36:7. Step 5 Look Back and Refactor.vtteed6:lengthi15410691e4:pathl27:4. Problem Solving Approach37:8. Recap and Interview Strategies.mp4eed6:lengthi6539e4:pathl27:4. Problem Solving Approach37:8. Recap and Interview Strategies.vtteed6:lengthi290e4:pathl27:5. Problem Solving Patterns21:1. PREREQUISITES.htmleed6:lengthi29708865e4:pathl27:5. Problem Solving Patterns36:10. Count Unique Values Solution.mp4eed6:lengthi8354e4:pathl27:5. Problem Solving Patterns36:10. Count Unique Values Solution.vtteed6:lengthi272e4:pathl27:5. Problem Solving Patterns24:10.1 unique_values.js.jseed6:lengthi82274160e4:pathl27:5. Problem Solving Patterns30:11. Sliding Window Pattern.mp4eed6:lengthi18249e4:pathl27:5. Problem Solving Patterns30:11. Sliding Window Pattern.vtteed6:lengthi345e4:pathl27:5. Problem Solving Patterns24:11.1 max_sum_naive.js.jseed6:lengthi381e4:pathl27:5. Problem Solving Patterns29:11.2 max_sum_refactored.js.jseed6:lengthi29175021e4:pathl27:5. Problem Solving Patterns34:12. Divide And Conquer Pattern.mp4eed6:lengthi10475e4:pathl27:5. Problem Solving Patterns34:12. Divide And Conquer Pattern.vtteed6:lengthi12771790e4:pathl27:5. Problem Solving Patterns40:2. Intro to Problem Solving Patterns.mp4eed6:lengthi4559e4:pathl27:5. Problem Solving Patterns40:2. Intro to Problem Solving Patterns.vtteed6:lengthi119e4:pathl27:5. Problem Solving Patterns15:2.1 SLIDES.htmleed6:lengthi89786452e4:pathl27:5. Problem Solving Patterns32:3. Frequency Counter Pattern.mp4eed6:lengthi20506e4:pathl27:5. Problem Solving Patterns32:3. Frequency Counter Pattern.vtteed6:lengthi712e4:pathl27:5. Problem Solving Patterns34:3.1 same_refactored_solution.js.jseed6:lengthi375e4:pathl27:5. Problem Solving Patterns29:3.2 same_naive_solution.js.jseed6:lengthi20422460e4:pathl27:5. Problem Solving Patterns42:4. Frequency Counter Anagram Challenge.mp4eed6:lengthi3837e4:pathl27:5. Problem Solving Patterns42:4. Frequency Counter Anagram Challenge.vtteed6:lengthi152e4:pathl27:5. Problem Solving Patterns40:5. Frequency Counter - validAnagram.htmleed6:lengthi46243973e4:pathl27:5. Problem Solving Patterns33:6. Anagram Challenge Solution.mp4eed6:lengthi8619e4:pathl27:5. Problem Solving Patterns33:6. Anagram Challenge Solution.vtteed6:lengthi669e4:pathl27:5. Problem Solving Patterns17:6.1 anagram.js.jseed6:lengthi49298254e4:pathl27:5. Problem Solving Patterns32:7. Multiple Pointers Pattern.mp4eed6:lengthi14193e4:pathl27:5. Problem Solving Patterns32:7. Multiple Pointers Pattern.vtteed6:lengthi255e4:pathl27:5. Problem Solving Patterns24:7.1 sum_zero_naive.js.jseed6:lengthi24421788e4:pathl27:5. Problem Solving Patterns54:8. Multiple Pointers Count Unique Values Challenge.mp4eed6:lengthi6834e4:pathl27:5. Problem Solving Patterns54:8. Multiple Pointers Count Unique Values Challenge.vtteed6:lengthi152e4:pathl27:5. Problem Solving Patterns45:9. Multiple Pointers - countUniqueValues.htmleed6:lengthi359e4:pathl27:6. 100% OPTIONAL Challenges23:1. IMPORTANT NOTE!.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges46:10. Sliding Window - findLongestSubstring.htmleed6:lengthi1781e4:pathl27:6. 100% OPTIONAL Challenges25:11. SOLUTIONS PART 3.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges41:2. Frequency Counter - sameFrequency.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges65:3. Frequency Counter Multiple Pointers - areThereDuplicates.htmleed6:lengthi1491e4:pathl27:6. 100% OPTIONAL Challenges24:4. SOLUTIONS PART 1.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges39:5. Multiple Pointers - averagePair.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges41:6. Multiple Pointers - isSubsequence.htmleed6:lengthi955e4:pathl27:6. 100% OPTIONAL Challenges24:7. SOLUTIONS PART 2.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges39:8. Sliding Window - maxSubarraySum.htmleed6:lengthi152e4:pathl27:6. 100% OPTIONAL Challenges39:9. Sliding Window - minSubArrayLen.htmleed6:lengthi220e4:pathl12:7. Recursion21:1. PREREQUISITES.htmleed6:lengthi47756625e4:pathl12:7. Recursion33:10. Common Recursion Pitfalls.mp4eed6:lengthi6969e4:pathl12:7. Recursion33:10. Common Recursion Pitfalls.vtteed6:lengthi38300206e4:pathl12:7. Recursion31:11. Helper Method Recursion.mp4eed6:lengthi8617e4:pathl12:7. Recursion31:11. Helper Method Recursion.vtteed6:lengthi392e4:pathl12:7. Recursion34:11.1 helper_method_recursion.js.jseed6:lengthi47064785e4:pathl12:7. Recursion22:12. Pure Recursion.mp4eed6:lengthi9948e4:pathl12:7. Recursion22:12. Pure Recursion.vtteed6:lengthi530e4:pathl12:7. Recursion38:12.1 collect_odds_pure_recursion.js.jseed6:lengthi30415811e4:pathl12:7. Recursion37:2. Story Time Martin & The Dragon.mp4eed6:lengthi10356e4:pathl12:7. Recursion37:2. Story Time Martin & The Dragon.vtteed6:lengthi118e4:pathl12:7. Recursion25:2.1 Recursion Slides.htmleed6:lengthi31553126e4:pathl12:7. Recursion24:3. Why Use Recursion.mp4eed6:lengthi8927e4:pathl12:7. Recursion24:3. Why Use Recursion.vtteed6:lengthi48232390e4:pathl12:7. Recursion21:4. The Call Stack.mp4eed6:lengthi10105e4:pathl12:7. Recursion21:4. The Call Stack.vtteed6:lengthi376e4:pathl12:7. Recursion27:4.1 callstack_example.js.jseed6:lengthi28115287e4:pathl12:7. Recursion35:5. Our First Recursive Function.mp4eed6:lengthi7495e4:pathl12:7. Recursion35:5. Our First Recursive Function.vtteed6:lengthi332e4:pathl12:7. Recursion19:5.1 countdown.js.jseed6:lengthi152e4:pathl12:7. Recursion22:6. Recursion Quiz.htmleed6:lengthi45642626e4:pathl12:7. Recursion36:7. Our Second Recursive Function.mp4eed6:lengthi45642626e4:pathl12:7. Recursion36:7. Our Second Recursive Function.vtteed6:lengthi188e4:pathl12:7. Recursion18:7.1 sumrange.js.jseed6:lengthi14364316e4:pathl12:7. Recursion36:8. Writing Factorial Iteratively.mp4eed6:lengthi2875e4:pathl12:7. Recursion36:8. Writing Factorial Iteratively.vtteed6:lengthi123e4:pathl12:7. Recursion29:8.1 factorial_iterative.js.jseed6:lengthi24806737e4:pathl12:7. Recursion36:9. Writing Factorial Recursively.mp4eed6:lengthi4290e4:pathl12:7. Recursion36:9. Writing Factorial Recursively.vtteed6:lengthi89e4:pathl12:7. Recursion29:9.1 factorial_recursive.js.jseed6:lengthi354e4:pathl24:8. Recursion Problem Set19:1. START HERE!.htmleed6:lengthi151e4:pathl24:8. Recursion Problem Set13:2. power.htmleed6:lengthi151e4:pathl24:8. Recursion Problem Set17:3. factorial.htmleed6:lengthi151e4:pathl24:8. Recursion Problem Set22:4. productOfArray.htmleed6:lengthi151e4:pathl24:8. Recursion Problem Set22:5. recursiveRange.htmleed6:lengthi151e4:pathl24:8. Recursion Problem Set11:6. fib.htmleed6:lengthi896e4:pathl24:8. Recursion Problem Set34:7. SOLUTIONS FOR THIS SECTION.htmleed6:lengthi332e4:pathl39:9. Bonus CHALLENGING Recursion Problems28:1. NOTE ON THIS SECTION.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems25:10. stringifyNumbers.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems23:11. collectStrings.htmleed6:lengthi2590e4:pathl39:9. Bonus CHALLENGING Recursion Problems25:12. SOLUTIONS PART 2.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems15:2. reverse.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems20:3. isPalindrome.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems21:4. someRecursive.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems15:5. flatten.htmleed6:lengthi1125e4:pathl39:9. Bonus CHALLENGING Recursion Problems24:6. SOLUTIONS PART 1.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems23:7. capitalizeFirst.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems21:8. nestedEvenSum.htmleed6:lengthi151e4:pathl39:9. Bonus CHALLENGING Recursion Problems23:9. capitalizeWords.htmleed6:lengthi123e4:pathl20:[CourseClub.NET].urleed6:lengthi133e4:pathl15:[FCS Forum].urleed6:lengthi127e4:pathl24:[FreeCourseSite.com].urleee4:name82:[FreeCourseSite.com] Udemy - JavaScript Algorithms and Data Structures Masterclass12:piece lengthi2097152e6:pieces75300:!ƍf}kC9!J]biS&QWp#߄fSWLE*WqX~%cNme`Ԋ8JʼX"ja[D9ą9?BqBXB Y«iZMMӧPn5!ӂ秚 v,*1^sWFr;$0ʱL3<1-,6oˁT_BlB\bB:F?}GMd̙_.ByS9-F'u_e'jr,vKGJ X`iR۰A7L'%JKwTvb|j_q"o.hD,#i7CP~h0 sndS~=\0̱hL9 盄fh#e#BzC's) ek }?2Ѧ_b]`H,TxPƹM> k 'I#P*։PBU=ûNJo'if; A2mSY{oTBixcoď7_O."pyZ`Hx}^OzPQٶԵfRAf%s0j5#z%n. {k]\gd;X]Мs.=%VsG:' }qU¡8HܥVwF%Go KHtU)jfYMӐ -a@1zRYN.9$6""˅XI:d<JRe.z-3bxdxtQ(45,yFQ+V!RSV7%UcGFK݈hY隒JɍA;(NCspHY/)7(:2ctp, O,ؓ4y$pzQ|WMj^MB j hʤ-𬸊_dhZGr&[#n3لfEdU&w Jo0YO._%Rr[ tωMiNish7+q[ɟH_S0J?JqKT,kËko0e'P>!O*/sCJ`P-MZ5Hi^SˡVX9& *{z^(\*?߈1:LesݰReօZ