# [CodingNinjas] Data Stuctures and Algorithms [C++] 2020

Posted in: Tutorials | By: AD-TEAM | 7-09-2023, 01:58 | 0 Comments
07
September
2023

[CodingNinjas] Data Stuctures and Algorithms [C++] 2020
Language: English | Size:8.65 GB
Genre:eLearning

Files Included :

0 Course Introduction.m4v (33.08 MB)
M4V
0 Introduction to Pointers.m4v (68.91 MB)
M4V
10 Double pointer.m4v (34.05 MB)
M4V
2 Pointer Arithmetic.m4v (19.86 MB)
M4V
4 Arrays and Pointers.m4v (54.23 MB)
M4V
6 Characters and pointers.m4v (17.44 MB)
M4V
8 Pointers and functions.m4v (33.92 MB)
M4V
0 Find a Node in Linked List[HINT].m4v (15.96 MB)
M4V
1 AppendLastNToFirst[HINT].m4v (13.49 MB)
M4V
2 Eliminate duplicates from LL[HINT].m4v (17.18 MB)
M4V
3 Print Reverse LinkedList[HINT].m4v (12.46 MB)
M4V
M4V
0 What are Data Structures.m4v (16.74 MB)
M4V
1 What is Linked List.m4v (63.97 MB)
M4V
12 Insert node recursively.m4v (17.26 MB)
M4V
14 Delete node recursively.m4v (9.69 MB)
M4V
2 Print the Linked List.m4v (55.82 MB)
M4V
4 Take Input - 1.m4v (80.61 MB)
M4V
5 Take Input - 2.m4v (29.41 MB)
M4V
8 Insert node at ith position.m4v (83.31 MB)
M4V
9 Delete Node at ith position.m4v (12.54 MB)
M4V
1 Even after Odd LinkedList[HINT].m4v (25.35 MB)
M4V
2 Delete every N nodes[HINT].m4v (13.98 MB)
M4V
3 Swap two Nodes of LL[HINT].m4v (23.96 MB)
M4V
4 kReverse[HINT].m4v (14.04 MB)
M4V
5 Bubble Sort (Iterative) LinkedList[HINT].m4v (42.88 MB)
M4V
0 Midpoint of LL.m4v (21.21 MB)
M4V
10 Reverse LL (Iterative).m4v (19 MB)
M4V
12 Variations of LL.m4v (35.53 MB)
M4V
2 Merge Two Sorted Linked Lists.m4v (25.9 MB)
M4V
4 Merge Sort.m4v (16.97 MB)
M4V
7 Reverse LL (Recursive).m4v (35.41 MB)
M4V
8 Reverse LL (Recursive) - Double Node.m4v (47.3 MB)
M4V
9 Reverse LL (Recursive) - O(n).m4v (15.49 MB)
M4V
0 Reverse a Stack[HINT].m4v (13.99 MB)
M4V
2 Check redundant brackets[HINT].m4v (27.8 MB)
M4V
3 Stock Span[HINT].m4v (38.38 MB)
M4V
4 Minimum bracket Reversal[HINT].m4v (33.04 MB)
M4V
0 Stack Introduction.m4v (53.77 MB)
M4V
1 Stack Using Array.m4v (89.5 MB)
M4V
10 Balanced Parenthesis.m4v (20.56 MB)
M4V
12 Queues Introduction.m4v (14.31 MB)
M4V
13 Queue using array - Introduction.m4v (42.75 MB)
M4V
14 Queue using array - Code.m4v (72.14 MB)
M4V
15 Dynamic Queue.m4v (37.53 MB)
M4V
17 Queue Using LL Introduction.m4v (26.07 MB)
M4V
19 Queue using LL - Solution.m4v (28.67 MB)
M4V
2 Dynamic Stack.m4v (28.51 MB)
M4V
20 Inbuilt Queue.m4v (17.71 MB)
M4V
4 Templates.m4v (75.67 MB)
M4V
5 Stack Using Templates.m4v (18.65 MB)
M4V
6 Stack Using LL Introduction.m4v (69.52 MB)
M4V
8 Stack Using LL - Solution.m4v (24.81 MB)
M4V
9 Inbuilt Stack.m4v (20.14 MB)
M4V
2 Node with maximum child sum[HINT].m4v (33.89 MB)
M4V
4 Next larger[HINT].m4v (15.94 MB)
M4V
5 Second Largest Element In Tree[HINT].m4v (41.27 MB)
M4V
6 Replace with depth[HINT].m4v (9.91 MB)
M4V
0 Trees Introduction.m4v (27.33 MB)
M4V
1 Vectors.m4v (46.01 MB)
M4V
11 Depth of node.m4v (12.9 MB)
M4V
12 Count leaf nodes.m4v (4.53 MB)
M4V
14 Traversals.m4v (23.24 MB)
M4V
16 Destructor.m4v (18.26 MB)
M4V
2 TreeNode class.m4v (31.22 MB)
M4V
3 Take input and print Recursive.m4v (37.3 MB)
M4V
4 Take input level wise.m4v (45.84 MB)
M4V
6 Count Nodes.m4v (8.19 MB)
M4V
9 Find Height.m4v (7.13 MB)
M4V
1 Balanced[HINT].m4v (23.48 MB)
M4V
2 Level order traversal[HINT].m4v (25.11 MB)
M4V
3 Remove Leaf nodes[HINT].m4v (9.01 MB)
M4V
4 Level wise linkedlist[HINT].m4v (20 MB)
M4V
5 ZigZag tree[HINT].m4v (15.39 MB)
M4V
0 Binary Trees Introduction.m4v (23.54 MB)
M4V
1 Take Input and print recursive.m4v (31.56 MB)
M4V
11 Construct Tree From Preorder and Inorder.m4v (17.83 MB)
M4V
13 Construct Tree From Preorder and Inorder Solution.m4v (39.44 MB)
M4V
15 Diameter of Binary Tree.m4v (44.59 MB)
M4V
16 Diameter of Binary Tree - Better Approach.m4v (36.33 MB)
M4V
2 Take input level wise.m4v (18.65 MB)
M4V
4 Count nodes.m4v (15.73 MB)
M4V
8 Binary Tree Traversal.m4v (11.09 MB)
M4V
0 Create Insert Duplicate Node[HINT].m4v (12.84 MB)
M4V
1 Pair sum BInary Tree[HINT].m4v (33.88 MB)
M4V
2 LCA of Binary Tree[HINT].m4v (15.87 MB)
M4V
4 Largest BST[HINT].m4v (31.14 MB)
M4V
5 Replace with Sum of greater nodes[HINT].m4v (29.87 MB)
M4V
6 Path Sum Root to Leaf[HINT].m4v (7.68 MB)
M4V
7 Print nodes at distance k from node[HINT].m4v (31.43 MB)
M4V
8 Pair sum in a BST[HINT].m4v (39.82 MB)
M4V
0 BST Introduction.m4v (21.47 MB)
M4V
1 Search in BST.m4v (5.04 MB)
M4V
11 BST to Sorted LL.m4v (12.03 MB)
M4V
13 Root to Node Path in Binary Tree.m4v (17.51 MB)
M4V
15 BST Class.m4v (21.35 MB)
M4V
16 BST Class - How to Insert and Delete node %3f.m4v (26.82 MB)
M4V
18 BST Class - Insert Delete Solution.m4v (51.97 MB)
M4V
19 Types of Balanced BSTs.m4v (23.31 MB)
M4V
3 Print Elements in Range.m4v (6.54 MB)
M4V
6 Check BST - 1.m4v (28.01 MB)
M4V
7 Check BST - 2.m4v (19.2 MB)
M4V
8 Check BST - 3.m4v (18.15 MB)
M4V
9 Construct BST from a Sorted Array.m4v (11.06 MB)
M4V
1 Longest Consecutive Sequence[HINT].m4v (21.02 MB)
M4V
2 Pairs with difference K[HINT].m4v (18.4 MB)
M4V
3 Longest subset zero sum[HINT].m4v (17.98 MB)
M4V
0 Introduction to Hashmaps.m4v (42.12 MB)
M4V
1 Inbuilt Hashmap.m4v (28.21 MB)
M4V
10 Hashmap Implementation - Delete and Search.m4v (22.89 MB)
M4V
11 Time complexity and Load factor.m4v (20.94 MB)
M4V
12 Rehashing.m4v (37.98 MB)
M4V
2 Remove Duplicates.m4v (21.44 MB)
M4V
6 Iterators.m4v (31.33 MB)
M4V
7 Bucket Array and hash function.m4v (41.5 MB)
M4V
8 Collision Handling.m4v (24.04 MB)
M4V
9 Hashmap Implementation - Insert.m4v (45.01 MB)
M4V
0 Check Max-Heap[HINT].m4v (10.6 MB)
M4V
2 Merge K sorted arrays[HINT].m4v (26.12 MB)
M4V
3 Running median[HINT].m4v (35.57 MB)
M4V
4 Buy the ticket[HINT].m4v (23.61 MB)
M4V
0 What is Priority Queue.m4v (33.57 MB)
M4V
1 Ways to implement Priority Queues.m4v (37.14 MB)
M4V
10 Remove Min Solution and Complexity Analysis.m4v (50.41 MB)
M4V
12 Inplace Heap Sort.m4v (43.63 MB)
M4V
14 Inplace heap sort Solution.m4v (62.83 MB)
M4V
15 Inbuilt Priority Queue.m4v (16.44 MB)
M4V
16 K Sorted Array.m4v (58 MB)
M4V
17 K smallest Elements.m4v (17.11 MB)
M4V
19 Inbuilt Min Priority Queue.m4v (11.28 MB)
M4V
2 Heaps Introduction.m4v (18.4 MB)
M4V
3 CBT and its implementaion.m4v (68.18 MB)
M4V
4 Insert and Delete in Heaps.m4v (50.97 MB)
M4V
5 Example Solution and Max heap.m4v (16.47 MB)
M4V
6 Implementation of Priority Queues - 1.m4v (17.68 MB)
M4V
7 Implementation - Insert.m4v (32.82 MB)
M4V
8 Remove Min - Explanation.m4v (15.59 MB)
M4V
M4V
11 Inline and Default Arguments.m4v (39.8 MB)
M4V
13 Constant Variables.m4v (74.43 MB)
M4V
2 Reference and Pass By Reference.m4v (50.91 MB)
M4V
4 Dynamic Memory Allocation.m4v (54.77 MB)
M4V
6 Dynamic Allocation of 2D Arrays.m4v (30.5 MB)
M4V
9 Macros and Global Variables.m4v (35.69 MB)
M4V
0 Pattern Matching[HINT].m4v (9.21 MB)
M4V
2 Auto complete[HINT].m4v (24.6 MB)
M4V
0 Introduction to Tries.m4v (50.55 MB)
M4V
1 TrieNode class.m4v (33.44 MB)
M4V
2 Tries Implementation - Insert.m4v (62.2 MB)
M4V
3 Search in Tries.m4v (10.11 MB)
M4V
5 Tries Implement - Remove.m4v (48.06 MB)
M4V
6 Types of Tries.m4v (45.99 MB)
M4V
7 Huffman Coding.m4v (67.14 MB)
M4V
0 Fibonacci - 1.m4v (75 MB)
M4V
1 Fibonacci - 2.m4v (26.12 MB)
M4V
10 No of Balanced BTs.m4v (21.08 MB)
M4V
12 Solution No of Balanced BTs.m4v (52.45 MB)
M4V
2 Min Steps To 1.m4v (23.2 MB)
M4V
4 Solution - Min Steps to 1.m4v (30.81 MB)
M4V
6 Solution Min Steps to 1 (Memoization).m4v (33.88 MB)
M4V
8 Minimum Count.m4v (17.99 MB)
M4V
0 Loot Houses[HINT].m4v (14.81 MB)
M4V
1 Longest Increasing Subsequence[HINT].m4v (42.12 MB)
M4V
4 Matrix Chain Multiplication[HINT].m4v (42.12 MB)
M4V
5 Coin Tower[HINT].m4v (24.04 MB)
M4V
6 Maximum Square Matrix With All Zeros[HINT].m4v (33.12 MB)
M4V
7 Shortest Subsequence[HINT].m4v (7.87 MB)
M4V
0 Min Cost Path.m4v (18.86 MB)
M4V
10 Solution Edit Distance (Brute Force).m4v (19 MB)
M4V
12 Solution Edit Distance (Memoization).m4v (25.2 MB)
M4V
13 Knapsack.m4v (15.67 MB)
M4V
14 Solution Edit Distance (DP).m4v (24.26 MB)
M4V
16 Solution Knapsack (Brute Force).m4v (22.12 MB)
M4V
2 Solution Min Cost Path (Brute Force).m4v (35.5 MB)
M4V
3 Min Cost Path - Memoization.m4v (34.32 MB)
M4V
4 Min Cost Path - DP.m4v (48.04 MB)
M4V
5 LCS.m4v (34.55 MB)
M4V
6 LCS - Memoization.m4v (41.19 MB)
M4V
7 LCS - DP.m4v (64.76 MB)
M4V
8 Edit Distance.m4v (26.03 MB)
M4V
0 Islands[HINT].m4v (42.03 MB)
M4V
1 Coding Ninjas[HINT].m4v (37.94 MB)
M4V
3 Largest Piece[HINT].m4v (19.69 MB)
M4V
4 3 Cycle[HINT].m4v (24.36 MB)
M4V
0 Graphs Introduction.m4v (14.64 MB)
M4V
1 Graphs Terminology.m4v (21.55 MB)
M4V
10 Get Path - DFS.m4v (12.18 MB)
M4V
12 Get Path - BFS.m4v (7.71 MB)
M4V
14 Is Connected %3f.m4v (6.06 MB)
M4V
16 Return all connected components.m4v (9.32 MB)
M4V
18 Weighted Directed Graphs.m4v (8.9 MB)
M4V
2 Graphs Implementation.m4v (17.97 MB)
M4V
3 DFS - Adjacency Matrix.m4v (51.61 MB)
M4V
4 BFS Traversal.m4v (13.93 MB)
M4V
6 Solution BFS Traversal.m4v (31.15 MB)
M4V
7 BFS DFS for disconnected graph.m4v (31.11 MB)
M4V
8 Has path.m4v (5.59 MB)
M4V
0 MST Kruskals Introduction.m4v (40.74 MB)
M4V
1 Cycle Detection.m4v (66.58 MB)
M4V
10 Dijkstras Algorithm.m4v (31.92 MB)
M4V
12 Solution Dijkstra's Algorithm.m4v (40.22 MB)
M4V
2 Kruskal's Algorithm.m4v (26.07 MB)
M4V
4 Kruskals Algorithm - Solution.m4v (43.65 MB)
M4V
5 Complexity of Kruskal's Algorithm.m4v (13.79 MB)
M4V
6 Prim's Algorithm.m4v (40.74 MB)
M4V
8 Solution Prim's Algorithm.m4v (41.42 MB)
M4V
9 Complexity of Prim's Algorithm.m4v (14.33 MB)
M4V
0 Abstraction Encapsulation.m4v (32.44 MB)
M4V
1 Inheritance Introduction.m4v (38.89 MB)
M4V
2 Inheritance Syntax.m4v (52.66 MB)
M4V
3 Inheritance Order of ConstructorDestructor cal.m4v (39.35 MB)
M4V
4 Inheritance Types.m4v (35.51 MB)
M4V
5 Hybrid Inheritance.m4v (56.03 MB)
M4V
6 Polymorphism Compile time.m4v (43.08 MB)
M4V
7 Polymorphism Run time.m4v (30.83 MB)
M4V
8 Virtual functions Abstract classes.m4v (26.26 MB)
M4V
9 Friend Functions Classes.m4v (33.45 MB)
M4V
0 Multiplication (Recursive)[HINT].m4v (10.02 MB)
M4V
1 Count Zeros[HINT].m4v (14.97 MB)
M4V
2 Geometric Sum[HINT].m4v (5.66 MB)
M4V
3 Check Palindrome (recursive)[HINT].m4v (20.77 MB)
M4V
0 Introduction to Recursion.m4v (48.33 MB)
M4V
1 Recursion and PMI.m4v (32.4 MB)
M4V
11 Hint First index.m4v (25.73 MB)
M4V
13 Hint Last Index.m4v (24.77 MB)
M4V
15 Hint 1 All Indices of a number.m4v (24.31 MB)
M4V
16 Hint 2 All Indices of a number.m4v (27.34 MB)
M4V
6 Fibonacci Number.m4v (35.24 MB)
M4V
8 Recursion and Arrays.m4v (28.7 MB)
M4V
0 Replace pi (recursive)[HINT].m4v (24.13 MB)
M4V
2 String to Integer[HINT].m4v (19.74 MB)
M4V
4 Tower of Hanoi[HINT].m4v (27.37 MB)
M4V
1 Staircase[HINT].m4v (9.79 MB)
M4V
10 Print Permutations[HINT].m4v (23.56 MB)
M4V
3 Return subset of an array[HINT].m4v (36.63 MB)
M4V
4 Print Subsets of Array[HINT].m4v (31.84 MB)
M4V
5 Return subsets sum to K[HINT].m4v (45.57 MB)
M4V
6 Print Subset Sum to K[HINT].m4v (17.54 MB)
M4V
7 Return all codes - String[HINT].m4v (31.28 MB)
M4V
8 Print all Codes - String[HINT].m4v (31.05 MB)
M4V
9 Return Permutations - String[HINT].m4v (26.34 MB)
M4V
0 Recursion and Strings.m4v (41.38 MB)
M4V
10 Return Keypad Approach.m4v (22.39 MB)
M4V
12 Print Subsequences of a String.m4v (27.64 MB)
M4V
13 Print Keypad Combinations Approach.m4v (6.88 MB)
M4V
3 Merge Sort Algo.m4v (36.44 MB)
M4V
5 Quick Sort Algo.m4v (34.68 MB)
M4V
6 Quick Sort - Dry Run.m4v (36.26 MB)
M4V
8 Strings.m4v (34.77 MB)
M4V
9 Return Subsequences of a String.m4v (47.94 MB)
M4V
0 Find the Unique Element[HINT].m4v (17.93 MB)
M4V
1 Duplicate in array[HINT].m4v (16.76 MB)
M4V
2 Array Intersection[HINT].m4v (23.24 MB)
M4V
3 Pair sum in array[HINT].m4v (27.8 MB)
M4V
5 Rotate array[HINT].m4v (23.59 MB)
M4V
0 Order Complexity Analysis.m4v (41.89 MB)
M4V
1 Theoretical Analysis.m4v (55.18 MB)
M4V
11 Fibonacci Time Complexity Analysis.m4v (29.16 MB)
M4V
12 Space Complexity Analysis.m4v (56.71 MB)
M4V
14 Merge Sort Space Complexity Analysis.m4v (15.57 MB)
M4V
15 Fibonacci Space Complexity Analysis.m4v (14.37 MB)
M4V
3 Linear Search time complexity.m4v (7.75 MB)
M4V
4 Insertion Sort time complexity.m4v (16.56 MB)
M4V
5 Selection Sort time complexity.m4v (9.03 MB)
M4V
7 Theoretical Analysis - Recursive Algorithms.m4v (37.99 MB)
M4V
9 Merge Sort Space Time complexity.m4v (23.11 MB)
M4V
0 Introduction to OOPS.m4v (40.42 MB)
M4V
1 Creating Objects.m4v (56.88 MB)
M4V
10 Fraction Class contd.m4v (37.6 MB)
M4V
11 Complex Number Class Introduction.m4v (16.68 MB)
M4V
3 Getters and Setters.m4v (33.86 MB)
M4V
4 Constructors and this keyword.m4v (82.9 MB)
M4V
6 Inbuilt Constructors and Destructor.m4v (51.21 MB)
M4V
7 Play With Constructors.m4v (17.76 MB)
M4V
9 Fraction Class.m4v (69.41 MB)
M4V
0 Shallow and Deep Copy.m4v (37.01 MB)
M4V
M4V
M4V
12 Dynamic Array Class.m4v (86.79 MB)
M4V
13 Polynomial Class Introduction.m4v (30.82 MB)
M4V
2 Copy Constructor.m4v (49.55 MB)
M4V
3 Initialisation List.m4v (52.91 MB)
M4V
5 Constant Functions.m4v (30.91 MB)
M4V
7 Static Members.m4v (47.72 MB)
M4V