Other
CodingNinjas - Data Stuctures and Algorithms [C++] 2020 [CoursesGhar]
Torrent info
Torrent Files List
!! IMPORTANT Note !!.txt (Size: 8.65 GB) (Files: 580)
!! IMPORTANT Note !!.txt
!!! Please Support !!! [CoursesGhar.Com].txt
0.Course Introduction [CoursesGhar.Com]
0.Course Introduction.m4v
00. Websites You May Like
CoursesGhar.Com.url
New Internet Shortcut.url
1.Assignment Pointers [CoursesGhar.Com]
0.Pointers Output.txt
1.Pointers Output.txt
2.Pointers Output.txt
3.Characters Pointers.txt
4.Pointers Output.txt
5.Pointers Output.txt
6.Pointers Output.txt
7.Pointers Output.txt
8.Pointers Output.txt
9.Pointers Output.txt
1.Lecture 1 Pointers [CoursesGhar.Com]
0.Introduction to Pointers.m4v
1.Address of Variable(1).txt
1.Address of variable.txt
1.Pointer Declaration.txt
1.Pointers Output.txt
1.What will be the output _.txt
10.Double pointer .m4v
11.Pointers Output.txt
11.What will be the output _.txt
2.Pointer Arithmetic.m4v
3.Fill the output.txt
3.What is the output.txt
4.Arrays and Pointers .m4v
5.Fill the output.txt
5.What is the output.txt
6.Characters and pointers .m4v
7.Fill the output.txt
7.Pointers Output.txt
7.What is the output.txt
8.Pointers and functions.m4v
9.Fill the output.txt
9.Pointers Output.txt
C - Pointers.pdf
10.Assignment Linked List 1 [CoursesGhar.Com]
0.Find a Node in Linked List.txt
0.Find a Node in Linked List[HINT].m4v
1.AppendLastNToFirst.txt
1.AppendLastNToFirst[HINT].m4v
2.Eliminate duplicates from LL.txt
2.Eliminate duplicates from LL[HINT].m4v
3.Print Reverse LinkedList.txt
3.Print Reverse LinkedList[HINT].m4v
4.Palindrome LinkedList.txt
4.Palindrome LinkedList[HINT].m4v
10.Lecture 8 Linked List 1 [CoursesGhar.Com]
0.What are Data Structures.m4v
1.What is Linked List.m4v
10.Delete a Node from Linked List.txt
11.Length of LL (recursive).txt
12.Insert node recursively.m4v
13.Insert in LL recursively.txt
14.Delete node recursively.m4v
15.Delete node recursively.txt
2.Print the Linked List.m4v
3.Linked List Usecase.txt
3.What is the output.txt
4.Take Input - 1.m4v
5.Take Input - 2.m4v
6.Length of a Singly Linked List(Iterative).txt
7.Print i-th Node Data.txt
8.Insert node at ith position.m4v
9.Delete Node at ith position.m4v
11.Assignment Linked List 2 [CoursesGhar.Com]
0.Find a node in LL (recursive).txt
1.Even after Odd LinkedList.txt
1.Even after Odd LinkedList[HINT].m4v
2.Delete every N nodes.txt
2.Delete every N nodes[HINT].m4v
3.Swap two Nodes of LL.txt
3.Swap two Nodes of LL[HINT].m4v
4.kReverse.txt
4.kReverse[HINT].m4v
5.Bubble Sort (Iterative) LinkedList.txt
5.Bubble Sort (Iterative) LinkedList[HINT].m4v
11.Lecture 9 Linked List 2 [CoursesGhar.Com]
0.Midpoint of LL.m4v
1.Midpoint LinkedList.txt
10.Reverse LL (Iterative).m4v
11.Reverse LL (Iterative) .txt
12.Variations of LL.m4v
13.Circular LL.txt
13.Circular doubly LL.txt
13.Double LL.txt
13.Traversal in LL.txt
2.Merge Two Sorted Linked Lists.m4v
3.Merge Two Sorted Linked Lists.txt
4.Merge Sort.m4v
5.MergeSort Linked List.txt
6.Reverse LL (Recursive).txt
7.Reverse LL (Recursive).m4v
8.Reverse LL (Recursive) - Double Node.m4v
9.Reverse LL (Recursive) - O(n).m4v
12.Assignment Stacks and Queues [CoursesGhar.Com]
0.Reverse a Stack.txt
0.Reverse a Stack[HINT].m4v
1.Reverse Queue.txt
2.Check redundant brackets.txt
2.Check redundant brackets[HINT].m4v
3.Stock Span.txt
3.Stock Span[HINT].m4v
4.Minimum bracket Reversal.txt
4.Minimum bracket Reversal[HINT].m4v
12.Lecture 10 Stacks Queues [CoursesGhar.Com]
0.Stack Introduction.m4v
1.Stack Using Array.m4v
10.Balanced Parenthesis.m4v
11.Check if the Brackets are Balanced.txt
12.Queues Introduction.m4v
13.Queue using array - Introduction.m4v
14.Queue using array - Code.m4v
15.Dynamic Queue.m4v
16.Correct order.txt
16.Insert element.txt
16.Insert in queue.txt
16.Queue.txt
16.Worst case operation.txt
17.Queue Using LL Introduction.m4v
18.Queue using a Singly Linked List.txt
19.Queue using LL - Solution.m4v
2.Dynamic Stack.m4v
20.Inbuilt Queue.m4v
3.Correct Order.txt
3.Correct statement.txt
3.Stack implementation.txt
3.Stack.txt
3.Use recursion.txt
4.Templates.m4v
5.Stack Using Templates.m4v
6.Stack Using LL Introduction.m4v
7.Implementation Stack Using Singly Linked List.txt
8.Stack Using LL - Solution.m4v
9.Inbuilt Stack.m4v
13.Test 2 [CoursesGhar.Com]
0.Next Number.txt
1.Dequeue.txt
2.Delete alternate nodes.txt
14.Assignment Trees [CoursesGhar.Com]
0.Contains x.txt
1.Count nodes.txt
2.Node with maximum child sum.txt
2.Node with maximum child sum[HINT].m4v
3.Structurally identical.txt
4.Next larger.txt
4.Next larger[HINT].m4v
5.Second Largest Element In Tree.txt
5.Second Largest Element In Tree[HINT].m4v
6.Replace with depth.txt
6.Replace with depth[HINT].m4v
14.Lecture 11 Trees [CoursesGhar.Com]
0.Trees Introduction.m4v
1.Vectors.m4v
10.Height of generic Tree.txt
11.Depth of node.m4v
12.Count leaf nodes.m4v
13.Count leaf Nodes.txt
14.Traversals.m4v
15.Post-order Traversal.txt
16.Destructor.m4v
2.TreeNode class.m4v
3.Take input and print Recursive.m4v
4.Take input level wise.m4v
5.Print Tree level wise.txt
6.Count Nodes.m4v
7.Sum of all nodes.txt
8.Node with largest data.txt
9.Find Height.m4v
15.Assignment Binary Trees [CoursesGhar.Com]
0.Sum Of Nodes.txt
1. Balanced.txt
1. Balanced[HINT].m4v
2.Level order traversal.txt
2.Level order traversal[HINT].m4v
3.Remove Leaf nodes.txt
3.Remove Leaf nodes[HINT].m4v
4.Level wise linkedlist.txt
4.Level wise linkedlist[HINT].m4v
5.ZigZag tree.txt
5.ZigZag tree[HINT].m4v
6.Nodes without sibling.txt
15.Lecture 12 Binary Trees [CoursesGhar.Com]
0.Binary Trees Introduction.m4v
1.Take Input and print recursive.m4v
10.Postorder Binary Tree.txt
11.Construct Tree From Preorder and Inorder.m4v
12.Construct Tree from preorder inorder.txt
13.Construct Tree From Preorder and Inorder Solution.m4v
14.Construct Tree from postorder inorder.txt
15.Diameter of Binary Tree.m4v
16.Diameter of Binary Tree - Better Approach.m4v
17.Minimum and Maximum in the Binary Tree.txt
2.Take input level wise.m4v
3.Print Level Wise.txt
4.Count nodes.m4v
5.Is node present_.txt
6.Height Of Tree.txt
7.Mirror Binary tree.txt
8.Binary Tree Traversal.m4v
9.Preorder Binary Tree.txt
16.Assignment BST and Binary Tree [CoursesGhar.Com]
0.Create Insert Duplicate Node.txt
0.Create Insert Duplicate Node[HINT].m4v
1.Pair sum BInary Tree.txt
1.Pair sum BInary Tree[HINT].m4v
2.LCA of Binary Tree.txt
2.LCA of Binary Tree[HINT].m4v
3.LCA of BST.txt
4.Largest BST.txt
4.Largest BST[HINT].m4v
5.Replace with Sum of greater nodes.txt
5.Replace with Sum of greater nodes[HINT].m4v
6.Path Sum Root to Leaf.txt
6.Path Sum Root to Leaf[HINT].m4v
7.Print nodes at distance k from node.txt
7.Print nodes at distance k from node[HINT].m4v
8.Pair sum in a BST.txt
8.Pair sum in a BST[HINT].m4v
16.Lecture 13 BST [CoursesGhar.Com]
0.BST Introduction.m4v
1.Search in BST.m4v
10.Construct BST.txt
11.BST to Sorted LL.m4v
12.BST to LL.txt
13.Root to Node Path in Binary Tree.m4v
14.Find path in BST.txt
15.BST Class.m4v
16.BST Class - How to Insert and Delete node _.m4v
17.BST Class.txt
18.BST Class - Insert Delete Solution.m4v
19.Types of Balanced BSTs.m4v
2.Search in BST.txt
3.Print Elements in Range.m4v
4.Elements Between K1 and K2.txt
5.Check BST.txt
6.Check BST - 1.m4v
7.Check BST - 2.m4v
8.Check BST - 3.m4v
9.Construct BST from a Sorted Array.m4v
17.Test 3 [CoursesGhar.Com]
0.Check cousins.txt
1.Longest Leaf to root path.txt
2.Remove leaf nodes in Tree.txt
18.Assignment Hashmaps [CoursesGhar.Com]
0.Extract Unique characters.txt
1.Longest Consecutive Sequence.txt
1.Longest Consecutive Sequence[HINT].m4v
2.Pairs with difference K.txt
2.Pairs with difference K[HINT].m4v
3.Longest subset zero sum.txt
3.Longest subset zero sum[HINT].m4v
18.Lecture 14 Hashmaps [CoursesGhar.Com]
0.Introduction to Hashmaps.m4v
1.Inbuilt Hashmap.m4v
10.Hashmap Implementation - Delete and Search.m4v
11.Time complexity and Load factor.m4v
12.Rehashing.m4v
2.Remove Duplicates.m4v
3.Maximum Frequency Number.txt
4.Array Intersection.txt
5.Pair sum to 0.txt
6.Iterators.m4v
7.Bucket Array and hash function.m4v
8.Collision Handling.m4v
9.Hashmap Implementation - Insert.m4v
19.Assignment Priority Queues [CoursesGhar.Com]
0.Check Max-Heap.txt
0.Check Max-Heap[HINT].m4v
1.Kth largest element.txt
2.Merge K sorted arrays.txt
2.Merge K sorted arrays[HINT].m4v
3.Running median.txt
3.Running median[HINT].m4v
4.Buy the ticket.txt
4.Buy the ticket[HINT].m4v
19.Lecture 15 Priority Queues [CoursesGhar.Com]
0.What is Priority Queue.m4v
1.Ways to implement Priority Queues.m4v
10.Remove Min Solution and Complexity Analysis.m4v
11.Max priority queue class.txt
12.Inplace Heap Sort.m4v
13.Inplace Heap sort.txt
14.Inplace heap sort Solution.m4v
15.Inbuilt Priority Queue.m4v
16.K Sorted Array.m4v
17.K smallest Elements.m4v
18.K smallest elements.txt
19.Inbuilt Min Priority Queue.m4v
2.Heaps Introduction.m4v
20.K largest elements.txt
3.CBT and its implementaion.m4v
4.Insert and Delete in Heaps.m4v
5.Example Solution and Max heap.m4v
6.Implementation of Priority Queues - 1.m4v
7.Implementation - Insert.m4v
8.Remove Min - Explanation.m4v
9.Remove Min.txt
C - Priority Queues.pdf
2.Lecture 2 Dynamic Allocation [CoursesGhar.Com]
0.Address Typecasting.m4v
1.What is the output.txt
1.void pointer.txt
10.Fill the output.txt
10.What is the output.txt
11.Inline and Default Arguments.m4v
12.Default arguments.txt
12.Inline functions.txt
12.What is the output.txt
13.Constant Variables.m4v
14.Constants.txt
14.What is the output.txt
2.Reference and Pass By Reference.m4v
3.Reference Variable.txt
3.What is the output.txt
4.Dynamic Memory Allocation.m4v
5.Create array.txt
5.Deallocate memory.txt
5.Delete array.txt
5.Delete memory.txt
5.Dynamic memory allocation.txt
6.Dynamic Allocation of 2D Arrays.m4v
7.Create array.txt
7.Deallocate memory.txt
7.Delete array.txt
7.Delete memory.txt
7.Dynamic memory allocation.txt
8.2D arrays.txt
8.Delete 2D array.txt
8.Jagged arrays.txt
9.Macros and Global Variables.m4v
20.Assignment Tries [CoursesGhar.Com]
0.Pattern Matching.txt
0.Pattern Matching[HINT].m4v
1.Palindrome Pair.txt
2.Auto complete.txt
2.Auto complete[HINT].m4v
20.Lecture 16 Tries and Huffman Coding [CoursesGhar.Com]
0.Introduction to Tries.m4v
1.TrieNode class.m4v
2.Tries Implementation - Insert.m4v
3.Search in Tries.m4v
4.Search Words.txt
5.Tries Implement - Remove.m4v
6.Types of Tries.m4v
7.Huffman Coding.m4v
21.Lecture 17 DP - 1 [CoursesGhar.Com]
0.Fibonacci - 1.m4v
1.Fibonacci - 2.m4v
10.No. of Balanced BTs.m4v
11.Number of balanced Binary Trees.txt
12.Solution No. of Balanced BTs.m4v
13.Number of balanced Binary Trees.txt
2.Min Steps To 1.m4v
3.Min Steps to one.txt
4.Solution - Min Steps to 1.m4v
5.Min Steps to one using DP.txt
6.Solution Min Steps to 1 (Memoization).m4v
7.Staircase.txt
8.Minimum Count.m4v
9.Minimum Count.txt
22.Assignment DP [CoursesGhar.Com]
0.Loot Houses.txt
0.Loot Houses[HINT].m4v
1.Longest Increasing Subsequence.txt
1.Longest Increasing Subsequence[HINT].m4v
2.All possible ways.txt
3.Ways To Make Coin Change.txt
4.Matrix Chain Multiplication.txt
4.Matrix Chain Multiplication[HINT].m4v
5.Coin Tower.txt
5.Coin Tower[HINT].m4v
6.Maximum Square Matrix With All Zeros.txt
6.Maximum Square Matrix With All Zeros[HINT].m4v
7.Shortest Subsequence.txt
7.Shortest Subsequence[HINT].m4v
22.Lecture 18 DP - 2 [CoursesGhar.Com]
0.Min Cost Path.m4v
1.Min cost Path.txt
10.Solution Edit Distance (Brute Force).m4v
11.Edit Distance.txt
12.Solution Edit Distance (Memoization).m4v
13.Knapsack .m4v
14.Solution Edit Distance (DP).m4v
15.0 1 Knapsack.txt
16.Solution Knapsack (Brute Force).m4v
17.0 1 Knapsack.txt
2.Solution Min Cost Path (Brute Force).m4v
3.Min Cost Path - Memoization.m4v
4.Min Cost Path - DP.m4v
5.LCS.m4v
6.LCS - Memoization.m4v
7.LCS - DP.m4v
8.Edit Distance.m4v
9.Edit Distance.txt
23.Assignment Graphs [CoursesGhar.Com]
0.Islands.txt
0.Islands[HINT].m4v
1.Coding Ninjas.txt
1.Coding Ninjas[HINT].m4v
2.Connecting Dots.txt
3.Largest Piece.txt
3.Largest Piece[HINT].m4v
4.3 Cycle.txt
4.3 Cycle[HINT].m4v
23.Lecture 17 Graphs [CoursesGhar.Com]
0.Graphs Introduction.m4v
1.Graphs Terminology.m4v
10.Get Path - DFS.m4v
11.Get Path - DFS.txt
12.Get Path - BFS.m4v
13.Get Path - BFS.txt
14.Is Connected _.m4v
15.Is Connected _.txt
16.Return all connected components.m4v
17.All connected components.txt
18.Weighted Directed Graphs.m4v
2.Graphs Implementation .m4v
3.DFS - Adjacency Matrix.m4v
4.BFS Traversal.m4v
5.BFS Traversal.txt
6.Solution BFS Traversal.m4v
7.BFS DFS for disconnected graph.m4v
8.Has path .m4v
9.Has Path .txt
24.Lecture 20 Graphs 2 [CoursesGhar.Com]
0.MST Kruskals Introduction.m4v
1.Cycle Detection.m4v
10.Dijkstras Algorithm.m4v
11.Dijkstra_s Algorithm.txt
12.Solution Dijkstra_s Algorithm.m4v
2.Kruskal_s Algorithm.m4v
3.Kruskals Algorithm.txt
4.Kruskals Algorithm - Solution.m4v
5.Complexity of Kruskal_s Algorithm.m4v
6.Prim_s Algorithm.m4v
7.Prim_s Algorithm.txt
8.Solution Prim_s Algorithm.m4v
9.Complexity of Prim_s Algorithm.m4v
25.Lecture 19 OOPS 3 [CoursesGhar.Com]
0.Abstraction Encapsulation.m4v
1.Inheritance Introduction.m4v
2.Inheritance Syntax.m4v
3.Inheritance Order of ConstructorDestructor cal.m4v
4.Inheritance Types.m4v
5.Hybrid Inheritance.m4v
6.Polymorphism Compile time.m4v
7.Polymorphism Run time.m4v
8.Virtual functions Abstract classes.m4v
9.Friend Functions Classes.m4v
Exception Handling - C.pdf
3.Assignment Recursion 1a [CoursesGhar.Com]
0.Multiplication (Recursive).txt
0.Multiplication (Recursive)[HINT].m4v
1.Count Zeros.txt
1.Count Zeros[HINT].m4v
2.Geometric Sum.txt
2.Geometric Sum[HINT].m4v
3.Check Palindrome (recursive).txt
3.Check Palindrome (recursive)[HINT].m4v
4.Sum of digits (recursive).txt
3.Lecture 3 Recursion 1 [CoursesGhar.Com]
0.Introduction to Recursion.m4v
1.Recursion and PMI.m4v
10.Check number recursively.txt
11.Hint First index.m4v
12.First Index.txt
13.Hint Last Index.m4v
14.Last index of x.txt
15.Hint 1 All Indices of a number.m4v
16.Hint 2 All Indices of a number.m4v
17.All indexes of x.txt
2.x to the power n.txt
3.Print numbers.txt
4.Number of digits.txt
6.Fibonacci Number.m4v
7.What is the output.txt
8.Recursion and Arrays.m4v
9.Sum of array (recursive).txt
C - Recursion.pdf
4.Assignment Recursion 1b [CoursesGhar.Com]
0.Replace pi (recursive).txt
0.Replace pi (recursive)[HINT].m4v
1.Remove X.txt
2.String to Integer.txt
2.String to Integer[HINT].m4v
3.Pair star.txt
4.Tower of Hanoi.txt
4.Tower of Hanoi[HINT].m4v
5.Assignment Recursion 2 [CoursesGhar.Com]
0.Check AB.txt
1.Staircase.txt
1.Staircase[HINT].m4v
10. Print Permutations.txt
10. Print Permutations[HINT].m4v
2.Binary Search (Recursive).txt
3.Return subset of an array.txt
3.Return subset of an array[HINT].m4v
4.Print Subsets of Array.txt
4.Print Subsets of Array[HINT].m4v
5.Return subsets sum to K.txt
5.Return subsets sum to K[HINT].m4v
6.Print Subset Sum to K.txt
6.Print Subset Sum to K[HINT].m4v
7.Return all codes - String.txt
7.Return all codes - String[HINT].m4v
8.Print all Codes - String.txt
8.Print all Codes - String[HINT].m4v
9.Return Permutations - String.txt
9.Return Permutations - String[HINT].m4v
5.Lecture 4 Recursion 2 [CoursesGhar.Com]
0.Recursion and Strings.m4v
1.Replace character recursively.txt
10.Return Keypad Approach.m4v
11.Return Keypad - String.txt
12.Print Subsequences of a String.m4v
13.Print Keypad Combinations Approach.m4v
14.Print Keypad - String.txt
2.Remove Duplicates .txt
3.Merge Sort Algo.m4v
4.Merge Sort.txt
5.Quick Sort Algo.m4v
6.Quick Sort - Dry Run.m4v
7.Quick Sort.txt
8.Strings.m4v
9.Return Subsequences of a String.m4v
6.Assignment Arrays (Optimised) [CoursesGhar.Com]
0.Find the Unique Element.txt
0.Find the Unique Element[HINT].m4v
1.Duplicate in array.txt
1.Duplicate in array[HINT].m4v
2.Array Intersection.txt
2.Array Intersection[HINT].m4v
3.Pair sum in array.txt
3.Pair sum in array[HINT].m4v
4.Triplet sum.txt
5.Rotate array.txt
5.Rotate array[HINT].m4v
6.Check Array Rotation.txt
6.Lecture 5 Time and Space Complexity Analysis [CoursesGhar.Com]
0.Order Complexity Analysis.m4v
1.Theoretical Analysis.m4v
10.Fibonacci.txt
10.What is time complexity.txt
11.Fibonacci Time Complexity Analysis.m4v
12.Space Complexity Analysis.m4v
13.Fibonacci.txt
13.Merge Sort space.txt
14.Merge Sort Space Complexity Analysis.m4v
15.Fibonacci Space Complexity Analysis.m4v
2.InsertionSort Worst Case Time Complexity.txt
2.Linear Search Worst Case.txt
2.Linear Search.txt
2.Selection Sort.txt
3.Linear Search time complexity.m4v
4.Insertion Sort time complexity.m4v
5.Selection Sort time complexity.m4v
6. Theoretical Analysis.txt
6.Efficiency of an Algorithm.txt
6.Operations for merging.txt
6.Time Complexity of Code.txt
6.Time Complexity.txt
7.Theoretical Analysis - Recursive Algorithms.m4v
8.Merge sort.txt
8.Recurrence for Merge Sort.txt
9.Merge Sort Space Time complexity.m4v
C - Time Complexity.pdf
7.Test 1 [CoursesGhar.Com]
0.Recurrence Relation for Tower of Hanoi Problem.txt
1.Complexity of different operations in a sorted array..txt
2.Complexity of a Recurrence Relation.txt
3.Does s contain t _.txt
4.Maximum Profit on App.txt
5.Split Array.txt
8.Lecture 6 OOPS 1 [CoursesGhar.Com]
0.Introduction to OOPS.m4v
1.Creating Objects.m4v
10.Fraction Class contd..m4v
11.Complex Number Class Introduction.m4v
12.Complex Number Class.txt
2.Correct Statement.txt
2.Create object.txt
2.False statement.txt
2.What is the output.txt
3.Getters and Setters.m4v
4.Constructors and this keyword.m4v
5.What is the output.txt
6.Inbuilt Constructors and Destructor.m4v
7.Play With Constructors.m4v
8.Copy Assignment Operator.txt
8.Copy Constructor.txt
8.Find Incorrect Statement.txt
9.Fraction Class.m4v
C - OOPS 1.pdf
9.Lecture 7 OOPS 2 [CoursesGhar.Com]
0.Shallow and Deep Copy.m4v
1.What is the output.txt
10.Operator Overloading 2.m4v
11.Operator Overloading 3.m4v
12.Dynamic Array Class.m4v
13.Polynomial Class Introduction.m4v
14.Polynomial class.txt
2.Copy Constructor.m4v
3.Initialisation List.m4v
4.What is the output.txt
5.Constant Functions.m4v
6.Member function.txt
6.What is the output.txt
7.Static Members.m4v
8.Correct statement.txt
8.Fill the output.txt
8.What is the output.txt
9.Operator Overloading 1.m4v
Uploaded by [Coursesghar.com].txt
Visit coursesghar.com for more awesome tutorials.url
telegram @coursesghargate.url
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch CodingNinjas - Data Stuctures and Algorithms [C++] 2020 [CoursesGhar] Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
