| 01 - Introduction | |||
| 001 Course Orientation!.mp4 | 115.27 MB | ||
| 001 Course Orientation!_en.srt | 13.31 KB | ||
| 002 Get maximum out of this course.mp4 | 21.88 MB | ||
| 002 Get maximum out of this course_en.srt | 8.11 KB | ||
| 003 TA Hours Doubt Support.html | 3.06 KB | ||
| 02 - Code Repository | |||
| 001 C++ Code Repository.html | 233 B | ||
| 002 Java Code Repository.html | 280 B | ||
| 003 Exercise Solutions.html | 299 B | ||
| 03 - Arrays | |||
| 001 Array Introduction.mp4 | 109.2 MB | ||
| 001 Array Introduction_en.srt | 10.75 KB | ||
| 002 Arrays - Input, Ouput, Update.mp4 | 15.24 MB | ||
| 002 Arrays - Input, Ouput, Update_en.srt | 7.54 KB | ||
| 003 Arrays & Functions - Pass by Reference.mp4 | 29.15 MB | ||
| 003 Arrays & Functions - Pass by Reference_en.srt | 10.65 KB | ||
| 004 A Note about Space Time Complexity!.html | 272 B | ||
| 005 Linear Search.mp4 | 15.41 MB | ||
| 005 Linear Search_en.srt | 6.93 KB | ||
| 006 Binary Search.mp4 | 116.78 MB | ||
| 006 Binary Search_en.srt | 10.59 KB | ||
| 007 Binary Search Code.mp4 | 19.49 MB | ||
| 007 Binary Search Code_en.srt | 8.01 KB | ||
| 008 Array Reverse.mp4 | 13.57 MB | ||
| 008 Array Reverse_en.srt | 5.98 KB | ||
| 009 Printing Pairs.mp4 | 15.64 MB | ||
| 009 Printing Pairs_en.srt | 7.3 KB | ||
| 010 Printing Subarrays.mp4 | 22.73 MB | ||
| 010 Printing Subarrays_en.srt | 7.09 KB | ||
| 011 Subarray Sum - I (Brute Force).mp4 | 17.75 MB | ||
| 011 Subarray Sum - I (Brute Force)_en.srt | 1.29 KB | ||
| 011 Subarray Sum - I (Brute Force)_en.vtt | 4.85 KB | ||
| 012 Subarray Sum - II (Prefix Sums).mp4 | 24.2 MB | ||
| 012 Subarray Sum - II (Prefix Sums)_en.srt | 9.98 KB | ||
| 013 Subarray Sum - III (Kadane's Algorithm).mp4 | 18.84 MB | ||
| 013 Subarray Sum - III (Kadane's Algorithm)_en.srt | 3.77 KB | ||
| 013 Subarray Sum - III (Kadane's Algorithm)_en.vtt | 7.35 KB | ||
| 014 A Note about Coding Exercises!.html | 846 B | ||
| 015 Vectors Introduction.mp4 | 29.04 MB | ||
| 015 Vectors Introduction_en.srt | 6.11 KB | ||
| 016 Vectors (Demo).mp4 | 23.35 MB | ||
| 016 Vectors (Demo)_en.srt | 7.02 KB | ||
| 017 Online IDE.html | 391 B | ||
| 04 - Basic Sorting Algorithms | |||
| 001 Sorting Introduction.mp4 | 8.28 MB | ||
| 001 Sorting Introduction_en.srt | 2.4 KB | ||
| 002 Bubble Sort.mp4 | 22.34 MB | ||
| 002 Bubble Sort_en.srt | 12.22 KB | ||
| 003 Bubble Sort Code.mp4 | 9.89 MB | ||
| 003 Bubble Sort Code_en.srt | 4.57 KB | ||
| 004 Insertion Sort.mp4 | 10.93 MB | ||
| 004 Insertion Sort_en.srt | 7.35 KB | ||
| 005 Insertion Sort Code.mp4 | 14.54 MB | ||
| 005 Insertion Sort Code_en.srt | 7.78 KB | ||
| 006 Selection Sort.mp4 | 6.01 MB | ||
| 006 Selection Sort_en.srt | 4.02 KB | ||
| 007 Selection Sort Code.mp4 | 13.86 MB | ||
| 007 Selection Sort Code_en.srt | 7.85 KB | ||
| 008 Inbuilt Sort & Comparators.mp4 | 25.43 MB | ||
| 008 Inbuilt Sort & Comparators_en.srt | 11.94 KB | ||
| 009 Counting Sort.mp4 | 13.1 MB | ||
| 009 Counting Sort_en.srt | 6.23 KB | ||
| 010 Counting Sort Code.mp4 | 25.72 MB | ||
| 010 Counting Sort Code_en.srt | 9.61 KB | ||
| 05 - Character ArraysStrings | |||
| 001 Character Arrays Introduction.mp4 | 23.13 MB | ||
| 001 Character Arrays Introduction_en.srt | 8.79 KB | ||
| 002 Using cin.get().mp4 | 32.46 MB | ||
| 002 Using cin.get()_en.srt | 15.97 KB | ||
| 003 Digits & Spaces.mp4 | 10.61 MB | ||
| 003 Digits & Spaces_en.srt | 5.94 KB | ||
| 004 Using cin.getline().mp4 | 13.44 MB | ||
| 004 Using cin.getline()_en.srt | 6.42 KB | ||
| 005 Shortest Path.mp4 | 18.27 MB | ||
| 005 Shortest Path_en.srt | 8.46 KB | ||
| 006 String Copy, Compare, Concat!.mp4 | 11.85 MB | ||
| 006 String Copy, Compare, Concat!_en.srt | 5.68 KB | ||
| 007 Solution Largest String.mp4 | 20.87 MB | ||
| 007 Solution Largest String_en.srt | 10.4 KB | ||
| 008 Note String Class.html | 913 B | ||
| 009 String Class.mp4 | 21.32 MB | ||
| 009 String Class_en.srt | 7.11 KB | ||
| 010 Run Length Encoding.mp4 | 13.67 MB | ||
| 010 Run Length Encoding_en.srt | 7.29 KB | ||
| 06 - 2D Arrays | |||
| 001 Introduction to 2D Arrays.mp4 | 20.06 MB | ||
| 001 Introduction to 2D Arrays_en.srt | 10.24 KB | ||
| 002 2D Array Basics.mp4 | 27.77 MB | ||
| 002 2D Array Basics_en.srt | 10.63 KB | ||
| 003 2D Character Arrays.mp4 | 11.68 MB | ||
| 003 2D Character Arrays_en.srt | 5.43 KB | ||
| 004 Spiral Print.mp4 | 63.81 MB | ||
| 004 Spiral Print_en.srt | 19.66 KB | ||
| 005 Sorted Array Search.mp4 | 14.05 MB | ||
| 005 Sorted Array Search_en.srt | 6.86 KB | ||
| 006 Sorted Array Search Code.mp4 | 14.5 MB | ||
| 006 Sorted Array Search Code_en.srt | 5.71 KB | ||
| 007 Mango Trees.mp4 | 156.37 MB | ||
| 007 Mango Trees_en.srt | 20.24 KB | ||
| 07 - Pointers & Dynamic Memory | |||
| 001 Address of Operator.mp4 | 17.07 MB | ||
| 001 Address of Operator_en.srt | 6.24 KB | ||
| 002 Pointers.mp4 | 16.82 MB | ||
| 002 Pointers_en.srt | 8.61 KB | ||
| 003 Dereference Operator.mp4 | 29.12 MB | ||
| 003 Dereference Operator_en.srt | 6.29 KB | ||
| 004 Reference Variables.mp4 | 11.5 MB | ||
| 004 Reference Variables_en.srt | 5.97 KB | ||
| 005 Pass by Reference - Reference Variable.mp4 | 72.28 MB | ||
| 005 Pass by Reference - Reference Variable_en.srt | 7.22 KB | ||
| 006 Pass by Reference - Pointers.mp4 | 13.66 MB | ||
| 006 Pass by Reference - Pointers_en.srt | 6.17 KB | ||
| 007 Dynamic Memory Allocation.mp4 | 26.77 MB | ||
| 007 Dynamic Memory Allocation_en.srt | 14.12 KB | ||
| 008 Using New & Delete.mp4 | 11.05 MB | ||
| 008 Using New & Delete_en.srt | 5.01 KB | ||
| 009 2D Dynamic Array.mp4 | 28.5 MB | ||
| 009 2D Dynamic Array_en.srt | 7.04 KB | ||
| 009 2D Dynamic Array_en.vtt | 8.84 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| How you can help GetFreeCourses.Co.txt | 182 B | ||
| 08 - Vector Data Structure | |||
| 001 Vector.mp4 | 45.28 MB | ||
| 001 Vector_en.srt | 7.87 KB | ||
| 002 Vectors - How they grow.mp4 | 72 MB | ||
| 002 Vectors - How they grow_en.srt | 7.92 KB | ||
| 003 Using Vector Container.mp4 | 23.35 MB | ||
| 003 Using Vector Container_en.srt | 7.02 KB | ||
| 004 2D Vector using STL.mp4 | 7.5 MB | ||
| 004 2D Vector using STL_en.srt | 4.03 KB | ||
| 005 Vector Class - I.mp4 | 18.66 MB | ||
| 005 Vector Class - I_en.srt | 9.66 KB | ||
| 006 Vector Class - II.mp4 | 70.64 MB | ||
| 006 Vector Class - II_en.srt | 7.99 KB | ||
| 007 Vector Class - III.mp4 | 23.65 MB | ||
| 007 Vector Class - III_en.srt | 11.37 KB | ||
| 008 Header Files & Template Classes.mp4 | 22.81 MB | ||
| 008 Header Files & Template Classes_en.srt | 8.37 KB | ||
| 009 Inbuilt Searching.mp4 | 55.65 MB | ||
| 009 Inbuilt Searching_en.srt | 9.48 KB | ||
| 010 Sorting a Complex Vector!.mp4 | 19.17 MB | ||
| 010 Sorting a Complex Vector!_en.srt | 5.38 KB | ||
| 09 - Bit Manipulation | |||
| 001 Bitwise Operators.mp4 | 21.91 MB | ||
| 001 Bitwise Operators_en.srt | 13.11 KB | ||
| 002 Left Shift & Right Shift.mp4 | 9.2 MB | ||
| 002 Left Shift & Right Shift_en.srt | 5.81 KB | ||
| 003 Odd Even.mp4 | 7.32 MB | ||
| 003 Odd Even_en.srt | 4.03 KB | ||
| 004 Get ith Bit.mp4 | 10.23 MB | ||
| 004 Get ith Bit_en.srt | 5.07 KB | ||
| 005 Set ith Bit.mp4 | 10.99 MB | ||
| 005 Set ith Bit_en.srt | 3.13 KB | ||
| 006 Clear ith Bit.mp4 | 7.96 MB | ||
| 006 Clear ith Bit_en.srt | 3.38 KB | ||
| 007 Update ith Bit.mp4 | 61.06 MB | ||
| 007 Update ith Bit_en.srt | 5.77 KB | ||
| 008 Clear Last i Bits.mp4 | 11.63 MB | ||
| 008 Clear Last i Bits_en.srt | 4.52 KB | ||
| 009 Clear Range of Bits.mp4 | 71.52 MB | ||
| 009 Clear Range of Bits_en.srt | 7.26 KB | ||
| 010 Replace Bits.mp4 | 13.81 MB | ||
| 010 Replace Bits_en.srt | 5.83 KB | ||
| 011 Two Power.mp4 | 7.83 MB | ||
| 011 Two Power_en.srt | 3.28 KB | ||
| 012 Count Bits.mp4 | 14.91 MB | ||
| 012 Count Bits_en.srt | 5.63 KB | ||
| 013 Count Bits - Hack.mp4 | 11.38 MB | ||
| 013 Count Bits - Hack_en.srt | 4.68 KB | ||
| 014 Fast Exponentiation.mp4 | 22.28 MB | ||
| 014 Fast Exponentiation_en.srt | 10.8 KB | ||
| 015 Make it Binary!.mp4 | 43.76 MB | ||
| 015 Make it Binary!_en.srt | 5.41 KB | ||
| 10 - Recursion Basics | |||
| 001 Recursion Introduction.mp4 | 33.15 MB | ||
| 001 Recursion Introduction_en.srt | 14.97 KB | ||
| 002 Factorial.mp4 | 21.29 MB | ||
| 002 Factorial_en.srt | 10.58 KB | ||
| 003 Fibonacci Series.mp4 | 30.32 MB | ||
| 003 Fibonacci Series_en.srt | 15.53 KB | ||
| 004 Sorted Array Check!.mp4 | 32.47 MB | ||
| 004 Sorted Array Check!_en.srt | 13.46 KB | ||
| 005 Understanding Recursion Directions.mp4 | 18.82 MB | ||
| 005 Understanding Recursion Directions_en.srt | 10.35 KB | ||
| 006 First Occurence.mp4 | 10.54 MB | ||
| 006 First Occurence_en.srt | 7.09 KB | ||
| 007 First Occurence Code.mp4 | 14.44 MB | ||
| 007 First Occurence Code_en.srt | 7.17 KB | ||
| 008 Last Occurence.mp4 | 9.51 MB | ||
| 008 Last Occurence_en.srt | 6.1 KB | ||
| 009 Last Occurence Code.mp4 | 9.66 MB | ||
| 009 Last Occurence Code_en.srt | 5.28 KB | ||
| 010 Power Function.mp4 | 12.89 MB | ||
| 010 Power Function_en.srt | 4.84 KB | ||
| 011 Power Function Optimised.mp4 | 56.22 MB | ||
| 011 Power Function Optimised_en.srt | 6.04 KB | ||
| 012 Bubble Sort.mp4 | 42.67 MB | ||
| 012 Bubble Sort_en.srt | 13 KB | ||
| 013 Number Spell.mp4 | 20.13 MB | ||
| 013 Number Spell_en.srt | 7.89 KB | ||
| 014 Tiling Problem Solution.mp4 | 15.31 MB | ||
| 014 Tiling Problem Solution_en.srt | 9.54 KB | ||
| 015 Binary Strings Solution.mp4 | 16.6 MB | ||
| 015 Binary Strings Solution_en.srt | 9.92 KB | ||
| 016 Friend's Party Solution.mp4 | 15.47 MB | ||
| 016 Friend's Party Solution_en.srt | 8.46 KB | ||
| 11 - Divide & Conquer | |||
| 001 Merge Sort.mp4 | 9.92 MB | ||
| 001 Merge Sort_en.srt | 5.32 KB | ||
| 002 Merge Sort Code.mp4 | 39.99 MB | ||
| 002 Merge Sort Code_en.srt | 15.13 KB | ||
| 003 Quick Sort.mp4 | 25.55 MB | ||
| 003 Quick Sort_en.srt | 14.33 KB | ||
| 004 Quick Sort Code.mp4 | 16.56 MB | ||
| 004 Quick Sort Code_en.srt | 8.03 KB | ||
| 005 Rotate Array Search.mp4 | 21.86 MB | ||
| 005 Rotate Array Search_en.srt | 10.67 KB | ||
| 006 Rotated Search Code.mp4 | 12.29 MB | ||
| 006 Rotated Search Code_en.srt | 7.45 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| How you can help GetFreeCourses.Co.txt | 182 B | ||
| 12 - Backtracking | |||
| 001 Backtracking Introduction.mp4 | 9.71 MB | ||
| 001 Backtracking Introduction_en.srt | 5.75 KB | ||
| 002 Backtracking on Arrays Code.mp4 | 20.82 MB | ||
| 002 Backtracking on Arrays Code_en.srt | 11.32 KB | ||
| 003 Bactracking on Vectors Code.mp4 | 10.92 MB | ||
| 003 Bactracking on Vectors Code_en.srt | 5.19 KB | ||
| 004 Finding Subsets.mp4 | 31.21 MB | ||
| 004 Finding Subsets_en.srt | 16.96 KB | ||
| 005 Finding Subsets Code.mp4 | 81.25 MB | ||
| 005 Finding Subsets Code_en.srt | 8.87 KB | ||
| 006 Ordering Subsets.mp4 | 17.11 MB | ||
| 006 Ordering Subsets_en.srt | 7.93 KB | ||
| 007 Permutations.mp4 | 23.6 MB | ||
| 007 Permutations_en.srt | 11.83 KB | ||
| 008 N-Queen Problem.mp4 | 26.32 MB | ||
| 008 N-Queen Problem_en.srt | 16.85 KB | ||
| 009 N-Queen Code.mp4 | 37.72 MB | ||
| 009 N-Queen Code_en.srt | 19.67 KB | ||
| 010 N-Queen All Ways.mp4 | 38.68 MB | ||
| 010 N-Queen All Ways_en.srt | 20.65 KB | ||
| 011 Grid Ways.mp4 | 35.51 MB | ||
| 011 Grid Ways_en.srt | 14.11 KB | ||
| 012 Grid Ways - Math Trick!.mp4 | 9.27 MB | ||
| 012 Grid Ways - Math Trick!_en.srt | 4.26 KB | ||
| 013 Sudoku.mp4 | 27.92 MB | ||
| 013 Sudoku_en.srt | 14.96 KB | ||
| 014 Sudoku Code.mp4 | 52.88 MB | ||
| 014 Sudoku Code_en.srt | 21.55 KB | ||
| 13 - Space & Time Complexity Analysis | |||
| 001 Space Time Complexity Introduction.mp4 | 20.39 MB | ||
| 001 Space Time Complexity Introduction_en.srt | 11.03 KB | ||
| 002 Experimental Analysis.mp4 | 41.09 MB | ||
| 002 Experimental Analysis_en.srt | 11.18 KB | ||
| 003 Big O Notation.mp4 | 10.79 MB | ||
| 003 Big O Notation_en.srt | 5.71 KB | ||
| 004 Nested Loops.mp4 | 5.98 MB | ||
| 004 Nested Loops_en.srt | 3.42 KB | ||
| 005 Loops Example.mp4 | 30.14 MB | ||
| 005 Loops Example_en.srt | 547 B | ||
| 005 Loops Example_en.vtt | 2.94 KB | ||
| 006 Analysis of Bubble Sort.mp4 | 9.3 MB | ||
| 006 Analysis of Bubble Sort_en.srt | 4.84 KB | ||
| 007 Analysis of Binary Search.mp4 | 18.13 MB | ||
| 007 Analysis of Binary Search_en.srt | 9.36 KB | ||
| 008 Merge Sort Analysis.mp4 | 14.49 MB | ||
| 008 Merge Sort Analysis_en.srt | 7.1 KB | ||
| 009 Time Complexity For Recursive Problems.mp4 | 22.46 MB | ||
| 14 - Object Oriented Programming | |||
| 001 Introduction to OOPS.mp4 | 20.11 MB | ||
| 001 Introduction to OOPS_en.srt | 10.38 KB | ||
| 002 OOPS - Classes & Objects.mp4 | 15.26 MB | ||
| 002 OOPS - Classes & Objects_en.srt | 7.47 KB | ||
| 003 Code Demo.mp4 | 14.62 MB | ||
| 003 Code Demo_en.srt | 6.9 KB | ||
| 004 Getters & Setters.mp4 | 19.11 MB | ||
| 004 Getters & Setters_en.srt | 6.09 KB | ||
| 005 Constructor Object Initialiastion.mp4 | 47.19 MB | ||
| 005 Constructor Object Initialiastion_en.srt | 8.42 KB | ||
| 006 Copy Constructor.mp4 | 66.65 MB | ||
| 006 Copy Constructor_en.srt | 11.24 KB | ||
| 007 Shallow & Deep Copy.mp4 | 84.71 MB | ||
| 007 Shallow & Deep Copy_en.srt | 14.72 KB | ||
| 008 Copy Assignment Operator.mp4 | 15.9 MB | ||
| 008 Copy Assignment Operator_en.srt | 7.1 KB | ||
| 009 Destructor.mp4 | 19.29 MB | ||
| 009 Destructor_en.srt | 6.12 KB | ||
| 010 Shopping Cart using OOPS.html | 273 B | ||
| 15 - Linked List | |||
| 001 Linked List Introduction.mp4 | 19.61 MB | ||
| 001 Linked List Introduction_en.srt | 10.14 KB | ||
| 002 Push Front.mp4 | 20.51 MB | ||
| 002 Push Front_en.srt | 9.97 KB | ||
| 003 Push Back.mp4 | 5.62 MB | ||
| 003 Push Back_en.srt | 2.21 KB | ||
| 004 Print.mp4 | 22.34 MB | ||
| 004 Print_en.srt | 7.12 KB | ||
| 005 Insert.mp4 | 11.26 MB | ||
| 005 Insert_en.srt | 4.86 KB | ||
| 006 Searching.html | 420 B | ||
| 006 list.h | 1.88 KB | ||
| 007 Recursive Search.mp4 | 25.12 MB | ||
| 007 Recursive Search_en.srt | 5.37 KB | ||
| 008 Deletion.mp4 | 17.39 MB | ||
| 008 Deletion_en.srt | 6.15 KB | ||
| 009 Pop Front.mp4 | 14.89 MB | ||
| 009 Pop Front_en.srt | 6.36 KB | ||
| 010 Reverse a Linked List.mp4 | 10.6 MB | ||
| 010 Reverse a Linked List_en.srt | 5.96 KB | ||
| 011 Reverse a Linked List Code.mp4 | 18.78 MB | ||
| 011 Reverse a Linked List Code_en.srt | 9.11 KB | ||
| 16 - Stacks | |||
| 001 Stack Data Structure.mp4 | 18.14 MB | ||
| 001 Stack Data Structure_en.srt | 6.85 KB | ||
| 002 Stack Implementations.mp4 | 10.6 MB | ||
| 002 Stack Implementations_en.srt | 6 KB | ||
| 003 Stack using Linked List.mp4 | 17.39 MB | ||
| 003 Stack using Linked List_en.srt | 10.08 KB | ||
| 004 Stack using Vector.mp4 | 8.14 MB | ||
| 004 Stack using Vector_en.srt | 3.87 KB | ||
| 005 Stack STL.mp4 | 7.77 MB | ||
| 005 Stack STL_en.srt | 3.59 KB | ||
| 006 Stack Insert At Bottom Challenge!.mp4 | 24.72 MB | ||
| 006 Stack Insert At Bottom Challenge!_en.srt | 8.13 KB | ||
| 007 Recursively Reverse a Stack.mp4 | 14.2 MB | ||
| 007 Recursively Reverse a Stack_en.srt | 6.53 KB | ||
| 008 Stock Span Solution.mp4 | 36.21 MB | ||
| 008 Stock Span Solution_en.srt | 18.47 KB | ||
| 17 - Queues | |||
| 001 Queue Introduction.mp4 | 11.16 MB | ||
| 001 Queue Introduction_en.srt | 6.45 KB | ||
| 002 Queue Implementation.mp4 | 14.23 MB | ||
| 002 Queue Implementation_en.srt | 7.47 KB | ||
| 003 Queue using Circular Array.mp4 | 33.55 MB | ||
| 003 Queue using Circular Array_en.srt | 13.12 KB | ||
| 004 Queue STL.mp4 | 4.62 MB | ||
| 004 Queue STL_en.srt | 1.63 KB | ||
| 005 Stack using 2 Queues.mp4 | 10.96 MB | ||
| 005 Stack using 2 Queues_en.srt | 5.42 KB | ||
| 006 Stack using 2 Queues Code.mp4 | 20.15 MB | ||
| 006 Stack using 2 Queues Code_en.srt | 10.3 KB | ||
| 18 - Binary Tree | |||
| 001 Binary Tree Introduction.mp4 | 27.09 MB | ||
| 001 Binary Tree Introduction_en.srt | 9.15 KB | ||
| 002 Build Tree Preorder.mp4 | 20.52 MB | ||
| 002 Build Tree Preorder_en.srt | 9.89 KB | ||
| 003 Preorder Traversal.mp4 | 24.33 MB | ||
| 003 Preorder Traversal_en.srt | 9.33 KB | ||
| 004 Inorder Traversal.mp4 | 8.35 MB | ||
| 004 Inorder Traversal_en.srt | 4.68 KB | ||
| 005 Postorder Traversal.mp4 | 11.6 MB | ||
| 005 Postorder Traversal_en.srt | 5.87 KB | ||
| 006 Level Order Print.mp4 | 21.56 MB | ||
| 006 Level Order Print_en.srt | 12.67 KB | ||
| 007 Level Order Print Code.mp4 | 13.87 MB | ||
| 007 Level Order Print Code_en.srt | 7.61 KB | ||
| 008 Level Order Build.mp4 | 15.3 MB | ||
| 008 Level Order Build_en.srt | 8.56 KB | ||
| 009 Level Order Build Code.mp4 | 10.17 MB | ||
| 009 Level Order Build Code_en.srt | 6.14 KB | ||
| 010 Height of Tree.mp4 | 9.24 MB | ||
| 010 Height of Tree_en.srt | 4.95 KB | ||
| 011 Tree Diameter.mp4 | 24.47 MB | ||
| 011 Tree Diameter_en.srt | 12.06 KB | ||
| 012 Diameter Code-I.mp4 | 7.51 MB | ||
| 012 Diameter Code-I_en.srt | 3.5 KB | ||
| 013 Diameter Code-II.mp4 | 34.48 MB | ||
| 013 Diameter Code-II_en.srt | 13.99 KB | ||
| 19 - Binary Search Tree | |||
| 001 BST Introduction.mp4 | 17.75 MB | ||
| 001 BST Introduction_en.srt | 10.28 KB | ||
| 002 BST Creation.mp4 | 16.77 MB | ||
| 002 BST Creation_en.srt | 9.59 KB | ||
| 003 Note!.html | 331 B | ||
| 004 Searching.mp4 | 16.25 MB | ||
| 004 Searching_en.srt | 6.04 KB | ||
| 005 Deletion Concept.mp4 | 20.87 MB | ||
| 005 Deletion Concept_en.srt | 8.56 KB | ||
| 006 Deletion Code.mp4 | 31.45 MB | ||
| 006 Deletion Code_en.srt | 12.02 KB | ||
| 007 Challenge - Print in Range.mp4 | 18.65 MB | ||
| 007 Challenge - Print in Range_en.srt | 5.81 KB | ||
| 008 Root To Leaf Paths.mp4 | 23.56 MB | ||
| 008 Root To Leaf Paths_en.srt | 9.9 KB | ||
| GetFreeCourses.Co.url | 116 B | ||
| How you can help GetFreeCourses.Co.txt | 182 B | ||
| 20 - Heaps Priority Queue | |||
| 001 Introduction to Heap.mp4 | 84.3 MB | ||
| 001 Introduction to Heap_en.srt | 9.78 KB | ||
| 002 Heap vs other Data Structure.mp4 | 67.98 MB | ||
| 002 Heap vs other Data Structure_en.srt | 8.01 KB | ||
| 003 Heaps as CBT.mp4 | 13.06 MB | ||
| 003 Heaps as CBT_en.srt | 7.45 KB | ||
| 004 Heaps as Array.mp4 | 20.68 MB | ||
| 004 Heaps as Array_en.srt | 10.77 KB | ||
| 005 Insertion.mp4 | 76.07 MB | ||
| 005 Insertion_en.srt | 8.6 KB | ||
| 006 Insertion Code.mp4 | 21.56 MB | ||
| 006 Insertion Code_en.srt | 11.06 KB | ||
| 007 Remove Min Max.mp4 | 25.48 MB | ||
| 007 Remove Min Max_en.srt | 9.39 KB | ||
| 008 Remove Min Max Code.mp4 | 34.31 MB | ||
| 008 Remove Min Max Code_en.srt | 13.04 KB | ||
| 009 Priority Queue STL.mp4 | 18.09 MB | ||
| 009 Priority Queue STL_en.srt | 6.83 KB | ||
| 010 Nearby Cars.mp4 | 16.86 MB | ||
| 010 Nearby Cars_en.srt | 10.76 KB | ||
| 011 Nearby Cars Code.mp4 | 52.19 MB | ||
| 011 Nearby Cars Code_en.srt | 12.59 KB | ||
| 21 - Hashing | |||
| 001 Introduction to Hashing.mp4 | 105.91 MB | ||
| 001 Introduction to Hashing_en.srt | 8.48 KB | ||
| 002 Hash Functions.mp4 | 103.4 MB | ||
| 002 Hash Functions_en.srt | 12.12 KB | ||
| 003 Collision Handling.mp4 | 39.22 MB | ||
| 003 Collision Handling_en.srt | 20.29 KB | ||
| 004 Hashing Code - I (Setup).mp4 | 18.83 MB | ||
| 004 Hashing Code - I (Setup)_en.srt | 9.23 KB | ||
| 005 Hashing Code - II (Insertion).mp4 | 25.8 MB | ||
| 005 Hashing Code - II (Insertion)_en.srt | 12.12 KB | ||
| 006 Hashing Code - III (Rehashing).mp4 | 41.45 MB | ||
| 006 Hashing Code - III (Rehashing)_en.srt | 14.97 KB | ||
| 007 Testing our Hashtable.mp4 | 16.72 MB | ||
| 007 Testing our Hashtable_en.srt | 5.82 KB | ||
| 008 Hashing Code - IV (Search).mp4 | 31.76 MB | ||
| 008 Hashing Code - IV (Search)_en.srt | 6 KB | ||
| 009 Hashing Code - V (Erase).mp4 | 5.75 MB | ||
| 009 Hashing Code - V (Erase)_en.srt | 2.8 KB | ||
| 010 Hashing Code - VI (Operator [] Overloading).mp4 | 54.49 MB | ||
| 010 Hashing Code - VI (Operator [] Overloading)_en.srt | 15.65 KB | ||
| 011 [Webinar] Unordered Maps & Unordered Sets.html | 175 B | ||
| 22 - Trie Data Structure | |||
| 001 Trie Data Structure.mp4 | 37.58 MB | ||
| 001 Trie Data Structure_en.srt | 20.76 KB | ||
| 002 Trie Class.mp4 | 10.49 MB | ||
| 002 Trie Class_en.srt | 4.35 KB | ||
| 003 Trie Insertion.mp4 | 11.05 MB | ||
| 003 Trie Insertion_en.srt | 5.1 KB | ||
| 004 Trie Searching.mp4 | 7.95 MB | ||
| 004 Trie Searching_en.srt | 4.37 KB | ||
| 005 Trie Queries.mp4 | 15.5 MB | ||
| 005 Trie Queries_en.srt | 5.1 KB | ||
| 23 - Graphs Introduction | |||
| 001 Graphs Introduction.mp4 | 30.71 MB | ||
| 001 Graphs Introduction_en.srt | 16.93 KB | ||
| 002 Graph Applications.mp4 | 17.94 MB | ||
| 002 Graph Applications_en.srt | 7.97 KB | ||
| 003 Adjacency List Representation.mp4 | 16.56 MB | ||
| 003 Adjacency List Representation_en.srt | 10.14 KB | ||
| 004 Adjacency List Representation with Node Class.mp4 | 26.88 MB | ||
| 004 Adjacency List Representation with Node Class_en.srt | 10.52 KB | ||
| 005 BFS.mp4 | 15.37 MB | ||
| 005 BFS_en.srt | 8.84 KB | ||
| 006 BFS Code.mp4 | 66.16 MB | ||
| 006 BFS Code_en.srt | 8.49 KB | ||
| 007 DFS.mp4 | 9.55 MB | ||
| 007 DFS_en.srt | 5.6 KB | ||
| 008 DFS Code.mp4 | 16.85 MB | ||
| 008 DFS Code_en.srt | 6.71 KB | ||
| 009 Topological Ordering.mp4 | 18 MB | ||
| 009 Topological Ordering_en.srt | 5.73 KB | ||
| 010 Kahn's Algorithm (Modified BFS).mp4 | 11.05 MB | ||
| 010 Kahn's Algorithm (Modified BFS)_en.srt | 6.68 KB | ||
| 011 Topological Ordering using BFS Code.mp4 | 12.84 MB | ||
| 011 Topological Ordering using BFS Code_en.srt | 6.79 KB | ||
| 012 Dijkshtra's Algorithm.mp4 | 23.36 MB | ||
| 012 Dijkshtra's Algorithm_en.srt | 12.43 KB | ||
| 013 Dijkshtra's Algorithm Code.mp4 | 46.56 MB | ||
| 013 Dijkshtra's Algorithm Code_en.srt | 18.43 KB | ||
| 24 - Dynamic Programming Introduction | |||
| 001 Dynamic Programming Basics.mp4 | 42.7 MB | ||
| 001 Dynamic Programming Basics_en.srt | 21.27 KB | ||
| 002 Coin Change.mp4 | 29.32 MB | ||
| 002 Coin Change_en.srt | 14.42 KB | ||
| 003 Coin Change Code.mp4 | 17.29 MB | ||
| 003 Coin Change Code_en.srt | 7.21 KB | ||
| 004 Longest Common Subsequence (LCS).mp4 | 11.74 MB | ||
| 004 Longest Common Subsequence (LCS)_en.srt | 8.27 KB | ||
| 005 Longest Common Subsequence Code.mp4 | 5.31 MB | ||
| 005 Longest Common Subsequence Code_en.srt | 3.33 KB | ||
| 006 Knapsack Problem.mp4 | 24.11 MB | ||
| 006 Knapsack Problem_en.srt | 14.06 KB | ||
| 007 Knapsack Problem Code.mp4 | 22.16 MB | ||
| 007 Knapsack Problem Code_en.srt | 10.4 KB | ||
| 008 Wines Problem.mp4 | 11.73 MB | ||
| 008 Wines Problem_en.srt | 7.55 KB | ||
| 009 Wines Problem - II.mp4 | 24.86 MB | ||
| 009 Wines Problem - II_en.srt | 7 KB | ||
| 010 Wines - III.mp4 | 19.38 MB | ||
| 010 Wines - III_en.srt | 12.13 KB | ||
| 011 Wines - IV.mp4 | 21.31 MB | ||
| 011 Wines - IV_en.srt | 8.32 KB | ||
| 25 - Project - Shopping Cart Backend | |||
| 001 Shopping Cart Introduction.mp4 | 66.98 MB | ||
| 001 Shopping Cart Introduction_en.srt | 6.78 KB | ||
| 002 Shopping Cart Demo.mp4 | 22.41 MB | ||
| 002 Shopping Cart Demo_en.srt | 8 KB | ||
| 003 Product Class.mp4 | 10.44 MB | ||
| 003 Product Class_en.srt | 6.61 KB | ||
| 004 Item Class.mp4 | 24.28 MB | ||
| 004 Item Class_en.srt | 8.38 KB | ||
| 005 Choosing Products.mp4 | 22.96 MB | ||
| 005 Choosing Products_en.srt | 11.82 KB | ||
| 006 Cart Implementation.mp4 | 48.63 MB | ||
| 006 Cart Implementation_en.srt | 17.33 KB | ||
| 007 Checkout.mp4 | 18.13 MB | ||
| 007 Checkout_en.srt | 6.52 KB | ||
| Download Paid Udemy Courses For Free.url | 116 B | ||
| GetFreeCourses.Co.url | 116 B | ||
| How you can help GetFreeCourses.Co.txt | 182 B | ||
| ▲ 487 total files | |||
Data Structures & Algorithms Essentials using C++ (2022)
Master core computer science concepts by mastering data structures, algorithms & problem solving using C++
Udemy Link - https://www.udemy.com/course/cpp-data-structures-algorithms-prateek-narang/
Please seed as much as you can!
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
|
Udemy - Data Structures and Algorithms and LeetCode - CPP and Python Posted by
freecoursewb in Other
|
633.7 MB | freecoursewb | 2 months | 8 | 4 |
| 397.5 MB | freecoursewb | 8 months | 10 | 1 | |
| 298.9 MB | freecoursewb | 8 months | 0 | 0 | |
| 384.5 MB | freecoursewb | 8 months | 12 | 12 | |
| 2.6 GB | freecoursewb | 1 year | 5 | 0 |
All Comments