├── .gitignore ├── Binary Search ├── Lect 1 Binary Search Introduction and Identification │ └── Introduction_to_Binary_Search.txt ├── Lect 10 Find Floor of an element in a Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 11 Ceil (or Lower Bound) of an element in a Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 12 Next Alphabetical Element (or Upper Bound) │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 13 Find position of an element in an Infinite Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 14 Index of First 1 in a Binary Sorted Infinite Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 15 Minimum Difference Element in a Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 16 Binary Search on Answer Concept │ └── Binary_Search_on_Answer_Concept.txt ├── Lect 17 Peak Element │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 18 Find maximum element in Bitonic Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 19 Search An Element in Bitonic Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 2 Binary Search │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 20 Search in Row wise And Column wise Sorted Array │ └── Binary_Search.cpp ├── Lect 21 Allocate Minimum Number Of Pages │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 22 Binary Search on Answer for Integers │ └── code.cpp ├── Lect 23 Binary Search on Answer for Real Numbers │ └── code.cpp ├── Lect 3 Binary Search on Reverse Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 4 Order Not Known Binary Search │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 5 First and Last Occurrence of an Element │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 6 Count of an Element in a Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 7 Number of Times a Sorted Array is Rotated (Left or Right) │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Lect 8 Find an Element in a Rotated Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp └── Lect 9 Searching in a Nearly Sorted Array │ ├── Method_1_Binary_Search.cpp │ └── Method_2_Optimized_Binary_Search.cpp ├── Dynamic Programming ├── Code │ ├── Part 1 - Introduction to DP │ │ ├── Method_1_Recursion.cpp │ │ ├── Method_2_Memoization.cpp │ │ ├── Method_3_Tabulation.cpp │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 2 - 1D DP │ │ ├── Lect 2 - 1D DP - Climbing Stairs │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 3 - 1D DP - Frog Jump │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 4 - 1D DP - Frog Jump with K Distance │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 5 - 1D DP - Max sum of non adjacent elements │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ └── Lect 6 - 1D DP - House Robber │ │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 3 - 2D, 3D DP and DP on Grids │ │ ├── 2D DP │ │ │ └── Lect 7 - 2D DP - Ninja's Training │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── 3D DP │ │ │ └── Lect 13 - 3D DP - Ninja and his friends │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ └── DP on Grids │ │ │ ├── Lect 10 - DP on Grids - Minimum Path Sum in Grid │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ ├── Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ ├── Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ ├── Lect 8 - DP on Grids - Grid Unique Paths │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ └── Lect 9 - DP on Grids - Grid Unique Paths with Obstacles │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 4 - DP on Subsequences │ │ ├── Lect 14 - DP on Subsequences - Subset sum equal to target │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 15 - DP on Subsequences - Partition Equal Subset Sum │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 16 - DP on Subsequences - Partition A Set Into Two Subsets With Minimum Absolute Sum Difference │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 17 - DP on Subsequences - Counts Subsets with Sum K │ │ │ ├── Lect 17(A) - Array not contains 0 │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ └── Lect 17(B) - Array contains 0 │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 18 - DP on Subsequences - Count Partitions With Given Difference │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 19 - DP on Subsequences - 0 or 1 Knapsack │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 20 - DP on Subsequences - Minimum Coins │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 21 - DP on Subsequences - Target Sum │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 22 - DP on Subsequences - Coin Change 2 │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 23 - DP on Subsequences - Unbounded Knapsack │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ └── Lect 24 - DP on Subsequences - Rod Cutting Problem │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 5 - DP on Strings │ │ ├── Lect 25 - DP on Strings - Longest Common Subsequence │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 26 - DP on Strings - Print Longest Common Subsequence │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 27 - DP on Strings - Longest Common Substring │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 28 - DP on Strings - Longest Palindromic Subsequence │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 31 - DP on Strings - Shortest Common Supersequence │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 32 - DP on Strings - Distinct Subsequences │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 33 - DP on Strings - Edit Distance │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ └── Lect 34 - DP on Strings - Wildcard Matching │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 6 - DP on Stocks │ │ ├── Lect 35 - DP on Stocks - Buy and Sell Stock │ │ │ └── Method_1_Space_Optimization.cpp │ │ ├── Lect 36 - DP on Stocks - Buy and Sell Stock II │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 37 - DP on Stocks - Buy and Sell Stock III │ │ │ ├── Type 1 - 3D DP │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ │ └── Type 2 - 2D DP │ │ │ │ ├── Method_1_Recursion.cpp │ │ │ │ ├── Method_2_Memoization.cpp │ │ │ │ ├── Method_3_Tabulation.cpp │ │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 38 - DP on Stocks - Buy and Sell Stock IV │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ ├── Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ │ └── Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ ├── Method_3_Tabulation.cpp │ │ │ └── Method_4_Space_Optimization.cpp │ ├── Part 7 - DP on LIS │ │ ├── Lect 41 - DP on LIS - LIS using Memoization │ │ │ ├── Method_1_Recursion.cpp │ │ │ └── Method_2_Memoization.cpp │ │ ├── Lect 42 - DP on LIS - LIS using Tabulation │ │ │ ├── Method_3_Tabulation.cpp │ │ │ ├── Method_4_Space_Optimization.cpp │ │ │ ├── Method_5_Weird_Algorithm.cpp │ │ │ └── Method_6_Weird_Algorithm_To_Trace_LIS.cpp │ │ ├── Lect 43 - DP on LIS - LIS using Binary Search │ │ │ └── Method_1_BinarySearch.cpp │ │ ├── Lect 44 - DP on LIS - Longest Divisible Subset │ │ │ └── Method_1_Weird_Algorithm_To_Trace_LIS.cpp │ │ ├── Lect 45 - DP on LIS - Longest String Chain │ │ │ └── Method_1_Weird_Algorithm.cpp │ │ ├── Lect 46 - DP on LIS - Longest Bitonic Subsequence │ │ │ └── Method_1_Weird_Algorithm.cpp │ │ └── Lect 47 - DP on LIS - Number of LIS │ │ │ └── Method_1_Weird_Algorithm.cpp │ ├── Part 8 - Partition DP │ │ ├── Lect 48 - Partition DP - MCM using Memoization │ │ │ ├── Method_1_Recursion.cpp │ │ │ └── Method_2_Memoization.cpp │ │ ├── Lect 49 - Partition DP - MCM using Tabulation │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 50 - Partition DP - Minimum Cost to Cut the Stick │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 51 - Partition DP - Burst Balloons │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 52 - Partition DP - Evaluate Boolean Expression to True │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ ├── Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ │ └── Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition │ │ │ ├── Method_1_Recursion.cpp │ │ │ ├── Method_2_Memoization.cpp │ │ │ └── Method_3_Tabulation.cpp │ └── Part 9 - DP on Rectangles │ │ ├── Lect 51 - DP on Rectangles - Maximum Rectangle Area with all 1's │ │ └── Method_1_Tabulation.cpp │ │ └── Lect 52 - DP on Rectangles - Count Square Submatrices with All Ones │ │ └── Method_1_Tabulation.cpp └── Notes │ ├── Part_1 - Introduction_to_DP │ └── Lect_1_DP_Introduction.docx │ ├── Part_2 - 1D_DP │ ├── Lect_2_1D_DP_Climbing_Stairs.docx │ ├── Lect_3_1D_DP_Frog_Jump.docx │ ├── Lect_4_1D_DP_Frog_Jump_with_K_Distance.docx │ ├── Lect_5_1D_DP_Max_sum_of_non_adjacent_elements.docx │ └── Lect_6_1D_DP_House_Robber.docx │ └── Part_3 - 2D_or_3D_DP_and_DP_on_Grids │ ├── 2D_DP │ └── Lect_7 - 2D_DP - Ninja's_Training.docx │ ├── 3D_DP │ └── Lect_13 - 3D_DP - Ninja_and_his_friends.docx │ └── DP_on_Grids │ ├── Lect_10 - DP_on_Grids - Minimum_Path_Sum_in_Grid.docx │ ├── Lect_11 - DP_on_Grids - Minimum_Path_Sum_in_Triangular_Grid.docx │ ├── Lect_12 - DP_on_Grids - Minimum_or_Maximum_Falling_Path_Sum.docx │ ├── Lect_8 - DP_on_Grids - Grid_Unique_Paths.docx │ └── Lect_9 - DP_on_Grids - Grid_Unique_Paths_with_Obstacles.docx ├── Graph ├── Part 1 - Introduction to Graph │ ├── Lect 5 Breadth First Search (BFS) │ │ └── code.cpp │ └── Lect 6 Depth First Search (DFS) │ │ └── code.cpp ├── Part 2 - Problems on BFS (Single or Multi Source) Or DFS │ ├── Lect 11 Detect a Cycle in an Undirected Graph using BFS │ │ └── code.cpp │ ├── Lect 12 Detect a Cycle in an Undirected Graph using DFS │ │ └── code.cpp │ ├── Lect 13 Distance of nearest cell having 1 │ │ └── code.cpp │ ├── Lect 14 Surrounded Regions or Replace O's with X's │ │ └── code.cpp │ ├── Lect 15 Number of Enclaves │ │ └── code.cpp │ ├── Lect 16 Number of Distinct Islands │ │ └── code.cpp │ ├── Lect 17 Bipartite Graph using BFS │ │ └── code.cpp │ ├── Lect 18 Bipartite Graph using DFS │ │ └── code.cpp │ ├── Lect 19 Detect cycle in a directed graph using DFS │ │ ├── approach1.cpp │ │ └── approach2.cpp │ ├── Lect 20 Find Eventual Safe States using DFS │ │ ├── approach1.cpp │ │ └── approach2.cpp │ └── Lect 7 Number of Provinces │ │ └── code.cpp ├── Part 3 - Problems on Topological Sort │ ├── Lect 21 Topological Sort Algorithm using DFS │ │ └── code.cpp │ ├── Lect 22 Topological Sort Algorithm using BFS (Kahn's Algorithm) │ │ └── code.cpp │ ├── Lect 23 Detect a Cycle in Directed Graph by Topological Sort using BFS (Kahn's Algorithm) │ │ └── code.cpp │ ├── Lect 24 Course Schedule I and II │ │ ├── courseScheduleI.cpp │ │ └── courseScheduleII.cpp │ ├── Lect 25 Find Eventual Safe States using BFS by Topological Sort │ │ └── code.cpp │ └── Lect 26 Alien Dictionary │ │ └── code.cpp ├── Part 4 - Shortest Path Algorithms and Problems │ ├── Lect 27 Shortest Path in Directed Acyclic Graph │ │ └── code.cpp │ ├── Lect 28 Shortest Path in Undirected Graph with Unit Weights │ │ └── code.cpp │ ├── Lect 29 Word Ladder - I │ │ └── code.cpp │ ├── Lect 30 Word Ladder - II │ │ └── code.cpp │ ├── Lect 31 Word Ladder - II Optimised Approach for Leetcode │ │ └── code.cpp │ ├── Lect 32 Dijkstra's Algorithm - Using Priority Queue │ │ └── code.cpp │ ├── Lect 33 Dijkstra's Algorithm - Using Set │ │ └── code.cpp │ ├── Lect 34 Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation │ │ └── info.txt │ ├── Lect 35 Print Shortest Path - Dijkstra's Algorithm │ │ └── code.cpp │ ├── Lect 36 Shortest Distance in a Binary Maze │ │ └── code.cpp │ ├── Lect 37 Path With Minimum Effort │ │ └── code.cpp │ ├── Lect 38 Cheapest Flights Within K Stops │ │ └── code.cpp │ ├── Lect 39 Minimum Multiplications to Reach End │ │ └── code.cpp │ ├── Lect 40 Number of Ways to Arrive at Destination │ │ └── code.cpp │ ├── Lect 41 Bellman Ford Algorithm │ │ └── code.cpp │ ├── Lect 42 Floyd Warshall Algorithm │ │ └── code.cpp │ └── Lect 43 Find the City With the Smallest Number of Neighbours at a Threshold Distance │ │ ├── usingDijsktra.cpp │ │ └── usingFloydWarshall.cpp ├── Part 5 - Minimum Spanning Tree Or Disjoint Set │ ├── Lect 44 Minimum Spanning Tree - Theory │ │ └── info.txt │ ├── Lect 45 Prim's Algorithm - Minimum Spanning Tree │ │ ├── mst.cpp │ │ └── sumOfMST.cpp │ ├── Lect 46 Disjoint Set - Union by Rank, Union by Size, Path Compression │ │ ├── unionByRank.cpp │ │ └── unionBySize.cpp │ ├── Lect 47 Kruskal's Algorithm - Minimum Spanning Tree │ │ ├── mst.cpp │ │ └── sumOfMST.cpp │ ├── Lect 48 Number of Provinces - Disjoint Set │ │ └── code.cpp │ ├── Lect 49 Number of Operations to Make Network Connected - DSU │ │ └── code.cpp │ ├── Lect 50 Accounts Merge - DSU │ │ └── code.cpp │ ├── Lect 51 Number of Islands - II - Online Queries - DSU │ │ └── code.cpp │ ├── Lect 52 Making a Large Island - DSU │ │ └── code.cpp │ └── Lect 53 Most Stones Removed with Same Row or Column - DSU │ │ └── code.cpp └── Part 6 - Other Algorithms │ ├── Lect 54 Strongly Connected Components - Kosaraju's Algorithm │ ├── numberOfSCC.cpp │ └── printSCC.cpp │ ├── Lect 55 Bridges in Graph - Using Tarjan's Algorithm of time in and low time │ └── code.cpp │ └── Lect 56 Articulation Point in Graph │ └── code.cpp ├── Heap ├── Lect 1 Heap Introduction and Identification │ └── Introduction_to_Heap.txt ├── Lect 10 Sum of Elements between k1th smallest and k2th smallest numbers │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 2 kth Smallest Element │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 3 k Largest Elements in array │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 4 Sort a k Sorted Array Or Sort Nearly Sorted Array │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 5 k Closest Numbers │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 6 Top k Frequent Numbers │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 7 Frequency Sort │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── Lect 8 k Closest Points To Origin │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp └── Lect 9 Connect Ropes to Minimise the Cost │ ├── Method_1_Sorting_Approach.cpp │ └── Method_2_Heap_Approach.cpp ├── LICENSE ├── README.md ├── Recursion ├── L10_Subset_Sum_I.cpp ├── L11_Subset_Sum_II.cpp ├── L12_Print_all_Permutation_of_String_Or_Array_Approach_1.cpp ├── L13_Print_all_Permutation_of_String_Or_Array_Approach_2.cpp ├── L14_N-Queens_Leetcode_Hard_Backtracking.cpp ├── L15_Sudoko_Solver_Leetcode_Hard_Backtracking.cpp ├── L16_M-Coloring_Problem_Backtracking.cpp ├── L17_Palindrome_Partitioning_Leetcode_Recursion.cpp ├── L18_K-th_Permutation_Sequence_Leetcode.cpp ├── L19_Rat_in_A_Maze_Backtracking.cpp ├── L4_Check_String_Panlindrome.cpp ├── L4_Reverse_A_Array.cpp ├── L5_Fibonacci_Series.cpp ├── L7_Subsequence_with_Given_Sum.cpp ├── L8_Combination_Sum_I.cpp ├── L9_Combination_Sum_II.cpp └── Tower_of_Hanoi.cpp ├── Sliding Window ├── Lect 1 Sliding Window Introduction Identification And Types │ └── Introduction_to_Sliding_Window.txt ├── Lect 10 Longest Substring With k Unique Characters │ └── code.cpp ├── Lect 11 Longest Substring With No Repeating Characters │ └── code.cpp ├── Lect 12 Pick Toys │ └── code.cpp ├── Lect 13 Minimum Window Substring │ └── code.cpp ├── Lect 2 Sliding Window Problems │ └── Problems.txt ├── Lect 3 Maximum Sum Subarray of size k │ └── code.cpp ├── Lect 4 First Negative Number in every Window of Size k │ └── code.cpp ├── Lect 5 Count Occurrences Of Anagrams │ └── code.cpp ├── Lect 6 Maximum of all subarrays of size k │ └── code.cpp ├── Lect 7 and 8 Largest Subarray of sum k │ └── code.cpp └── Templates for Sliding Window │ ├── fixed_size_sliding_window.cpp │ └── variable_size_sliding_window.cpp ├── Stack ├── Lect 1 Stack Introduction and Identification │ └── Introduction_to_Stack.txt ├── Lect 2 NGR or Nearest Greater to right or Next Greater Element │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp ├── Lect 3 NGL or Nearest Greater to left or Previous Greater Element │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp ├── Lect 4 NSL or Nearest Smaller to left or Previous Smaller Element │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp ├── Lect 5 NSR or Nearest Smaller to right or Next Smaller Element │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp ├── Lect 6 Stock Span Problem │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp ├── Lect 7 Maximum Area Histogram │ ├── Method_1_Brute_Force_Approach.cpp │ ├── Method_2_Stack_Approach.cpp │ └── Method_3_Optimized_Stack_Approach.cpp ├── Lect 8 Max Area Rectangle in binary matrix │ ├── Method_1_Brute_Force_Approach.cpp │ └── Method_2_Stack_Approach.cpp └── Lect 9 Implement Min Stack │ ├── Method_1_With_Extra_Space.cpp │ └── Method_2_Without_Extra_Space.cpp ├── Tree ├── Lect 1 Introduction to Trees and Its Types │ └── Introduction_to_Trees_and_Its_Types.txt ├── Lect 10 Iterative Inorder Traversal in Binary Tree │ └── code.cpp ├── Lect 11 Iterative Postorder Traversal using 2 Stack │ └── code.cpp ├── Lect 12 Iterative Postorder Traversal using 1 Stack │ └── code.cpp ├── Lect 13 Preorder Inorder Postorder Traversals in One Traversal │ └── code.cpp ├── Lect 14 Maximum Depth or Height of Binary Tree │ └── code.cpp ├── Lect 15 Check for Balanced Binary Tree │ ├── bruteForce.cpp │ └── optimization.cpp ├── Lect 16 Diameter of Binary Tree │ ├── bruteForce.cpp │ └── optimization.cpp ├── Lect 17 Maximum Path Sum in Binary Tree │ ├── bruteForce.cpp │ └── optimization.cpp ├── Lect 18 Check it two trees are Identical or Not │ └── code.cpp ├── Lect 19 Zig-Zag or Spiral Traversal in Binary Tree │ └── code.cpp ├── Lect 2 Binary Tree Representation in C++ │ ├── UsingClass.cpp │ └── UsingStructure.cpp ├── Lect 20 Boundary Traversal in Binary Tree │ └── code.cpp ├── Lect 21 Vertical Order Traversal of Binary Tree │ └── code.cpp ├── Lect 22 Top View of Binary Tree │ └── code.cpp ├── Lect 23 Bottom View of Binary Tree │ └── code.cpp ├── Lect 24 Right and Left View of Binary Tree │ ├── iterativeCode.cpp │ └── recursiveCode.cpp ├── Lect 25 Check for Symmetrical Binary Trees │ └── code.cpp ├── Lect 26 Print Root to Node Path in Binary Tree │ └── code.cpp ├── Lect 27 Lowest Common Ancestor in Binary Tree │ ├── bruteForce.cpp │ └── optimization.cpp ├── Lect 28 Maximum Width of Binary Tree │ └── code.cpp ├── Lect 29 Children Sum Property in Binary Tree │ └── code.cpp ├── Lect 3 Binary Tree Representation in Java │ ├── BinaryTree.class │ ├── BinaryTree.java │ └── Node.class ├── Lect 30 Print all the Nodes at a distance of K in Binary Tree │ └── code.cpp ├── Lect 31 Minimum time taken to Burn the Binary Tree from a Node │ ├── graphBFS.cpp │ └── graphDFS.cpp ├── Lect 32 Count total Nodes in a Complete Binary Tree │ ├── bruteForce.cpp │ └── optimization.cpp ├── Lect 33 Requirements needed to construct a Unique Binary Tree │ └── notes.txt ├── Lect 34 Construct a Binary Tree from Preorder and Inorder Traversal │ └── code.cpp ├── Lect 35 Construct the Binary Tree from Postorder and Inorder Traversal │ └── code.cpp ├── Lect 36 Serialize and De-serialize Binary Tree │ └── code.cpp ├── Lect 37 Morris Traversal Preorder and Inorder │ ├── inorder.cpp │ └── preorder.cpp ├── Lect 38 Flatten a Binary Tree to Linked List │ ├── info.txt │ ├── iterativeApproach.cpp │ ├── morrisTraversalApproach.cpp │ └── recursiveApproach.cpp ├── Lect 39 Introduction to Binary Search Tree │ └── info.txt ├── Lect 40 Search in a Binary Search Tree │ └── code.cpp ├── Lect 41 Ceil in a Binary Search Tree │ └── code.cpp ├── Lect 42 Floor in a Binary Search Tree │ └── code.cpp ├── Lect 43 Insert a given Node in Binary Search Tree │ └── code.cpp ├── Lect 44 Delete a Node in Binary Search Tree │ └── code.cpp ├── Lect 45 Kth Smallest and Largest Element in BST │ └── code.cpp ├── Lect 46 Check if a tree is a BST or BT Or Validate a BST │ └── code.cpp ├── Lect 47 Lowest Common Ancestor in Binary Search Tree │ ├── iterativeCode.cpp │ └── recursiveCode.cpp ├── Lect 48 Construct a BST from a preorder traversal │ ├── bruteForce1.cpp │ ├── bruteForce2.cpp │ ├── info.txt │ └── optimization.cpp ├── Lect 49 Inorder Successor and Predecessor in BST │ ├── predecessor.cpp │ └── successor.cpp ├── Lect 5 Preorder Traversal of Binary Tree │ └── code.cpp ├── Lect 50 Binary Search Tree Iterator in O(H) Space │ ├── BSTIterator.cpp │ ├── beforeBSTIterator.cpp │ ├── info.txt │ └── nextBSTIterator.cpp ├── Lect 51 Two Sum In BST Or Check if there exists a pair with Sum K │ └── code.cpp ├── Lect 52 Recover BST Or Correct BST with two nodes swapped │ └── code.cpp ├── Lect 53 Largest BST in Binary Tree │ └── code.cpp ├── Lect 6 Inorder Traversal of Binary Tree │ └── code.cpp ├── Lect 7 Postorder Traversal of Binary Tree │ └── code.cpp ├── Lect 8 Level Order or BFS Traversal of Binary Tree │ └── code.cpp └── Lect 9 Iterative Preorder Traversal in Binary Tree │ └── code.cpp └── Trie ├── Lect 1 Implement Trie 1 - Insert, Search and StartsWith ├── usingClass.cpp └── usingStructure.cpp ├── Lect 2 Implement Trie 2 - Insert, countWordsEqualTo and countWordsStartingWith ├── usingClass.cpp └── usingStructure.cpp ├── Lect 3 Longest Word With All Prefixes - Complete String ├── usingClass.cpp └── usingStructure.cpp ├── Lect 4 Number of Distinct Substrings in a String ├── bruteForce.cpp ├── trieUsingClass.cpp └── trieUsingStructure.cpp ├── Lect 5 Bit Manipulation PreRequisites for Trie Problems └── info.txt ├── Lect 6.Maximum XOR of Two Numbers in an Array ├── usingClass.cpp └── usingStructure.cpp └── Lect 7 Maximum XOR With an Element From Array - Queries ├── bruteForce.cpp ├── trieUsingClass.cpp └── trieUsingStructure.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | *.exe 2 | *.vscode/ 3 | *.class -------------------------------------------------------------------------------- /Binary Search/Lect 1 Binary Search Introduction and Identification/Introduction_to_Binary_Search.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 1 Binary Search Introduction and Identification/Introduction_to_Binary_Search.txt -------------------------------------------------------------------------------- /Binary Search/Lect 10 Find Floor of an element in a Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 10 Find Floor of an element in a Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 10 Find Floor of an element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 10 Find Floor of an element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 11 Ceil (or Lower Bound) of an element in a Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 11 Ceil (or Lower Bound) of an element in a Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 11 Ceil (or Lower Bound) of an element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 11 Ceil (or Lower Bound) of an element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 12 Next Alphabetical Element (or Upper Bound)/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 12 Next Alphabetical Element (or Upper Bound)/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 12 Next Alphabetical Element (or Upper Bound)/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 12 Next Alphabetical Element (or Upper Bound)/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 13 Find position of an element in an Infinite Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 13 Find position of an element in an Infinite Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 13 Find position of an element in an Infinite Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 13 Find position of an element in an Infinite Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 14 Index of First 1 in a Binary Sorted Infinite Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 14 Index of First 1 in a Binary Sorted Infinite Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 14 Index of First 1 in a Binary Sorted Infinite Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 14 Index of First 1 in a Binary Sorted Infinite Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 15 Minimum Difference Element in a Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 15 Minimum Difference Element in a Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 15 Minimum Difference Element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 15 Minimum Difference Element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 16 Binary Search on Answer Concept/Binary_Search_on_Answer_Concept.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 16 Binary Search on Answer Concept/Binary_Search_on_Answer_Concept.txt -------------------------------------------------------------------------------- /Binary Search/Lect 17 Peak Element/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 17 Peak Element/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 17 Peak Element/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 17 Peak Element/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 18 Find maximum element in Bitonic Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 18 Find maximum element in Bitonic Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 18 Find maximum element in Bitonic Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 18 Find maximum element in Bitonic Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 19 Search An Element in Bitonic Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 19 Search An Element in Bitonic Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 19 Search An Element in Bitonic Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 19 Search An Element in Bitonic Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 2 Binary Search/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 2 Binary Search/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 2 Binary Search/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 2 Binary Search/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 20 Search in Row wise And Column wise Sorted Array/Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 20 Search in Row wise And Column wise Sorted Array/Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 21 Allocate Minimum Number Of Pages/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 21 Allocate Minimum Number Of Pages/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 21 Allocate Minimum Number Of Pages/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 21 Allocate Minimum Number Of Pages/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 22 Binary Search on Answer for Integers/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 22 Binary Search on Answer for Integers/code.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 23 Binary Search on Answer for Real Numbers/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 23 Binary Search on Answer for Real Numbers/code.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 3 Binary Search on Reverse Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 3 Binary Search on Reverse Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 3 Binary Search on Reverse Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 3 Binary Search on Reverse Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 4 Order Not Known Binary Search/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 4 Order Not Known Binary Search/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 4 Order Not Known Binary Search/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 4 Order Not Known Binary Search/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 5 First and Last Occurrence of an Element/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 5 First and Last Occurrence of an Element/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 5 First and Last Occurrence of an Element/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 5 First and Last Occurrence of an Element/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 6 Count of an Element in a Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 6 Count of an Element in a Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 6 Count of an Element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 6 Count of an Element in a Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 7 Number of Times a Sorted Array is Rotated (Left or Right)/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 7 Number of Times a Sorted Array is Rotated (Left or Right)/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 7 Number of Times a Sorted Array is Rotated (Left or Right)/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 7 Number of Times a Sorted Array is Rotated (Left or Right)/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 8 Find an Element in a Rotated Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 8 Find an Element in a Rotated Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 8 Find an Element in a Rotated Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 8 Find an Element in a Rotated Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 9 Searching in a Nearly Sorted Array/Method_1_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 9 Searching in a Nearly Sorted Array/Method_1_Binary_Search.cpp -------------------------------------------------------------------------------- /Binary Search/Lect 9 Searching in a Nearly Sorted Array/Method_2_Optimized_Binary_Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Binary Search/Lect 9 Searching in a Nearly Sorted Array/Method_2_Optimized_Binary_Search.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 1 - Introduction to DP/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 1 - Introduction to DP/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 1 - Introduction to DP/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 1 - Introduction to DP/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 1 - Introduction to DP/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 1 - Introduction to DP/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 1 - Introduction to DP/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 1 - Introduction to DP/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 2 - 1D DP - Climbing Stairs/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 3 - 1D DP - Frog Jump/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 4 - 1D DP - Frog Jump with K Distance/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 5 - 1D DP - Max sum of non adjacent elements/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 2 - 1D DP/Lect 6 - 1D DP - House Robber/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 2 - 1D DP/Lect 6 - 1D DP - House Robber/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/2D DP/Lect 7 - 2D DP - Ninja's Training/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/3D DP/Lect 13 - 3D DP - Ninja and his friends/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 10 - DP on Grids - Minimum Path Sum in Grid/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 11 - DP on Grids - Minimum Path Sum in Triangular Grid/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 12 - DP on Grids - Minimum or Maximum Falling Path Sum/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 8 - DP on Grids - Grid Unique Paths/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 3 - 2D, 3D DP and DP on Grids/DP on Grids/Lect 9 - DP on Grids - Grid Unique Paths with Obstacles/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 14 - DP on Subsequences - Subset sum equal to target/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 15 - DP on Subsequences - Partition Equal Subset Sum/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 16 - DP on Subsequences - Partition A Set Into Two Subsets With Minimum Absolute Sum Difference/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 16 - DP on Subsequences - Partition A Set Into Two Subsets With Minimum Absolute Sum Difference/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 16 - DP on Subsequences - Partition A Set Into Two Subsets With Minimum Absolute Sum Difference/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 16 - DP on Subsequences - Partition A Set Into Two Subsets With Minimum Absolute Sum Difference/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(A) - Array not contains 0/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 17 - DP on Subsequences - Counts Subsets with Sum K/Lect 17(B) - Array contains 0/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 18 - DP on Subsequences - Count Partitions With Given Difference/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 19 - DP on Subsequences - 0 or 1 Knapsack/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 20 - DP on Subsequences - Minimum Coins/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 21 - DP on Subsequences - Target Sum/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 22 - DP on Subsequences - Coin Change 2/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 23 - DP on Subsequences - Unbounded Knapsack/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 4 - DP on Subsequences/Lect 24 - DP on Subsequences - Rod Cutting Problem/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 25 - DP on Strings - Longest Common Subsequence/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 26 - DP on Strings - Print Longest Common Subsequence/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 27 - DP on Strings - Longest Common Substring/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 28 - DP on Strings - Longest Palindromic Subsequence/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 29 - DP on Strings - Minimum Insertions to Make String Palindrome/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 30 - DP on Strings - Minimum Insertions or Deletions to Convert String A to String B/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 31 - DP on Strings - Shortest Common Supersequence/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 32 - DP on Strings - Distinct Subsequences/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 33 - DP on Strings - Edit Distance/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 5 - DP on Strings/Lect 34 - DP on Strings - Wildcard Matching/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 35 - DP on Stocks - Buy and Sell Stock/Method_1_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 35 - DP on Stocks - Buy and Sell Stock/Method_1_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 36 - DP on Stocks - Buy and Sell Stock II/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 1 - 3D DP/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 37 - DP on Stocks - Buy and Sell Stock III/Type 2 - 2D DP/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 38 - DP on Stocks - Buy and Sell Stock IV/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 39 - DP on Stocks - Buy and Sell Stock with Cooldown/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 6 - DP on Stocks/Lect 40 - DP on Stocks - Buy and Sell Stock with Transaction Fee/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 41 - DP on LIS - LIS using Memoization/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 41 - DP on LIS - LIS using Memoization/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 41 - DP on LIS - LIS using Memoization/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 41 - DP on LIS - LIS using Memoization/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_4_Space_Optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_4_Space_Optimization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_5_Weird_Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_5_Weird_Algorithm.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_6_Weird_Algorithm_To_Trace_LIS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 42 - DP on LIS - LIS using Tabulation/Method_6_Weird_Algorithm_To_Trace_LIS.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 43 - DP on LIS - LIS using Binary Search/Method_1_BinarySearch.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 43 - DP on LIS - LIS using Binary Search/Method_1_BinarySearch.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 44 - DP on LIS - Longest Divisible Subset/Method_1_Weird_Algorithm_To_Trace_LIS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 44 - DP on LIS - Longest Divisible Subset/Method_1_Weird_Algorithm_To_Trace_LIS.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 45 - DP on LIS - Longest String Chain/Method_1_Weird_Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 45 - DP on LIS - Longest String Chain/Method_1_Weird_Algorithm.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 46 - DP on LIS - Longest Bitonic Subsequence/Method_1_Weird_Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 46 - DP on LIS - Longest Bitonic Subsequence/Method_1_Weird_Algorithm.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 7 - DP on LIS/Lect 47 - DP on LIS - Number of LIS/Method_1_Weird_Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 7 - DP on LIS/Lect 47 - DP on LIS - Number of LIS/Method_1_Weird_Algorithm.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 48 - Partition DP - MCM using Memoization/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 48 - Partition DP - MCM using Memoization/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 48 - Partition DP - MCM using Memoization/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 48 - Partition DP - MCM using Memoization/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 49 - Partition DP - MCM using Tabulation/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 49 - Partition DP - MCM using Tabulation/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 50 - Partition DP - Minimum Cost to Cut the Stick/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 51 - Partition DP - Burst Balloons/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 52 - Partition DP - Evaluate Boolean Expression to True/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 53 - Partition DP - Palindrome Partitioning II using Front Partition/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_1_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_1_Recursion.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_2_Memoization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_2_Memoization.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_3_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 8 - Partition DP/Lect 54 - Partition DP - Partition Array for Maximum Sum using Front Partition/Method_3_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 9 - DP on Rectangles/Lect 51 - DP on Rectangles - Maximum Rectangle Area with all 1's/Method_1_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 9 - DP on Rectangles/Lect 51 - DP on Rectangles - Maximum Rectangle Area with all 1's/Method_1_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Code/Part 9 - DP on Rectangles/Lect 52 - DP on Rectangles - Count Square Submatrices with All Ones/Method_1_Tabulation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Code/Part 9 - DP on Rectangles/Lect 52 - DP on Rectangles - Count Square Submatrices with All Ones/Method_1_Tabulation.cpp -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_1 - Introduction_to_DP/Lect_1_DP_Introduction.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_1 - Introduction_to_DP/Lect_1_DP_Introduction.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_2_1D_DP_Climbing_Stairs.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_2_1D_DP_Climbing_Stairs.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_3_1D_DP_Frog_Jump.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_3_1D_DP_Frog_Jump.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_4_1D_DP_Frog_Jump_with_K_Distance.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_4_1D_DP_Frog_Jump_with_K_Distance.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_5_1D_DP_Max_sum_of_non_adjacent_elements.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_5_1D_DP_Max_sum_of_non_adjacent_elements.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_6_1D_DP_House_Robber.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_2 - 1D_DP/Lect_6_1D_DP_House_Robber.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/2D_DP/Lect_7 - 2D_DP - Ninja's_Training.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/2D_DP/Lect_7 - 2D_DP - Ninja's_Training.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/3D_DP/Lect_13 - 3D_DP - Ninja_and_his_friends.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/3D_DP/Lect_13 - 3D_DP - Ninja_and_his_friends.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_10 - DP_on_Grids - Minimum_Path_Sum_in_Grid.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_10 - DP_on_Grids - Minimum_Path_Sum_in_Grid.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_11 - DP_on_Grids - Minimum_Path_Sum_in_Triangular_Grid.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_11 - DP_on_Grids - Minimum_Path_Sum_in_Triangular_Grid.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_12 - DP_on_Grids - Minimum_or_Maximum_Falling_Path_Sum.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_12 - DP_on_Grids - Minimum_or_Maximum_Falling_Path_Sum.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_8 - DP_on_Grids - Grid_Unique_Paths.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_8 - DP_on_Grids - Grid_Unique_Paths.docx -------------------------------------------------------------------------------- /Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_9 - DP_on_Grids - Grid_Unique_Paths_with_Obstacles.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Dynamic Programming/Notes/Part_3 - 2D_or_3D_DP_and_DP_on_Grids/DP_on_Grids/Lect_9 - DP_on_Grids - Grid_Unique_Paths_with_Obstacles.docx -------------------------------------------------------------------------------- /Graph/Part 1 - Introduction to Graph/Lect 5 Breadth First Search (BFS)/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 1 - Introduction to Graph/Lect 5 Breadth First Search (BFS)/code.cpp -------------------------------------------------------------------------------- /Graph/Part 1 - Introduction to Graph/Lect 6 Depth First Search (DFS)/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 1 - Introduction to Graph/Lect 6 Depth First Search (DFS)/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 11 Detect a Cycle in an Undirected Graph using BFS/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 11 Detect a Cycle in an Undirected Graph using BFS/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 12 Detect a Cycle in an Undirected Graph using DFS/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 12 Detect a Cycle in an Undirected Graph using DFS/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 13 Distance of nearest cell having 1/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 13 Distance of nearest cell having 1/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 14 Surrounded Regions or Replace O's with X's/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 14 Surrounded Regions or Replace O's with X's/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 15 Number of Enclaves/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 15 Number of Enclaves/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 16 Number of Distinct Islands/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 16 Number of Distinct Islands/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 17 Bipartite Graph using BFS/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 17 Bipartite Graph using BFS/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 18 Bipartite Graph using DFS/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 18 Bipartite Graph using DFS/code.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 19 Detect cycle in a directed graph using DFS/approach1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 19 Detect cycle in a directed graph using DFS/approach1.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 19 Detect cycle in a directed graph using DFS/approach2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 19 Detect cycle in a directed graph using DFS/approach2.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 20 Find Eventual Safe States using DFS/approach1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 20 Find Eventual Safe States using DFS/approach1.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 20 Find Eventual Safe States using DFS/approach2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 20 Find Eventual Safe States using DFS/approach2.cpp -------------------------------------------------------------------------------- /Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 7 Number of Provinces/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 2 - Problems on BFS (Single or Multi Source) Or DFS/Lect 7 Number of Provinces/code.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 21 Topological Sort Algorithm using DFS/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 21 Topological Sort Algorithm using DFS/code.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 22 Topological Sort Algorithm using BFS (Kahn's Algorithm)/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 22 Topological Sort Algorithm using BFS (Kahn's Algorithm)/code.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 23 Detect a Cycle in Directed Graph by Topological Sort using BFS (Kahn's Algorithm)/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 23 Detect a Cycle in Directed Graph by Topological Sort using BFS (Kahn's Algorithm)/code.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 24 Course Schedule I and II/courseScheduleI.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 24 Course Schedule I and II/courseScheduleI.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 24 Course Schedule I and II/courseScheduleII.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 24 Course Schedule I and II/courseScheduleII.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 25 Find Eventual Safe States using BFS by Topological Sort/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 25 Find Eventual Safe States using BFS by Topological Sort/code.cpp -------------------------------------------------------------------------------- /Graph/Part 3 - Problems on Topological Sort/Lect 26 Alien Dictionary/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 3 - Problems on Topological Sort/Lect 26 Alien Dictionary/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 27 Shortest Path in Directed Acyclic Graph/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 27 Shortest Path in Directed Acyclic Graph/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 28 Shortest Path in Undirected Graph with Unit Weights/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 28 Shortest Path in Undirected Graph with Unit Weights/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 29 Word Ladder - I/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 29 Word Ladder - I/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 30 Word Ladder - II/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 30 Word Ladder - II/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 31 Word Ladder - II Optimised Approach for Leetcode/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 31 Word Ladder - II Optimised Approach for Leetcode/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 32 Dijkstra's Algorithm - Using Priority Queue/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 32 Dijkstra's Algorithm - Using Priority Queue/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 33 Dijkstra's Algorithm - Using Set/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 33 Dijkstra's Algorithm - Using Set/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 34 Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 34 Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation/info.txt -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 35 Print Shortest Path - Dijkstra's Algorithm/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 35 Print Shortest Path - Dijkstra's Algorithm/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 36 Shortest Distance in a Binary Maze/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 36 Shortest Distance in a Binary Maze/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 37 Path With Minimum Effort/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 37 Path With Minimum Effort/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 38 Cheapest Flights Within K Stops/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 38 Cheapest Flights Within K Stops/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 39 Minimum Multiplications to Reach End/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 39 Minimum Multiplications to Reach End/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 40 Number of Ways to Arrive at Destination/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 40 Number of Ways to Arrive at Destination/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 41 Bellman Ford Algorithm/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 41 Bellman Ford Algorithm/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 42 Floyd Warshall Algorithm/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 42 Floyd Warshall Algorithm/code.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 43 Find the City With the Smallest Number of Neighbours at a Threshold Distance/usingDijsktra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 43 Find the City With the Smallest Number of Neighbours at a Threshold Distance/usingDijsktra.cpp -------------------------------------------------------------------------------- /Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 43 Find the City With the Smallest Number of Neighbours at a Threshold Distance/usingFloydWarshall.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 4 - Shortest Path Algorithms and Problems/Lect 43 Find the City With the Smallest Number of Neighbours at a Threshold Distance/usingFloydWarshall.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 44 Minimum Spanning Tree - Theory/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 44 Minimum Spanning Tree - Theory/info.txt -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 45 Prim's Algorithm - Minimum Spanning Tree/mst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 45 Prim's Algorithm - Minimum Spanning Tree/mst.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 45 Prim's Algorithm - Minimum Spanning Tree/sumOfMST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 45 Prim's Algorithm - Minimum Spanning Tree/sumOfMST.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 46 Disjoint Set - Union by Rank, Union by Size, Path Compression/unionByRank.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 46 Disjoint Set - Union by Rank, Union by Size, Path Compression/unionByRank.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 46 Disjoint Set - Union by Rank, Union by Size, Path Compression/unionBySize.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 46 Disjoint Set - Union by Rank, Union by Size, Path Compression/unionBySize.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 47 Kruskal's Algorithm - Minimum Spanning Tree/mst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 47 Kruskal's Algorithm - Minimum Spanning Tree/mst.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 47 Kruskal's Algorithm - Minimum Spanning Tree/sumOfMST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 47 Kruskal's Algorithm - Minimum Spanning Tree/sumOfMST.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 48 Number of Provinces - Disjoint Set/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 48 Number of Provinces - Disjoint Set/code.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 49 Number of Operations to Make Network Connected - DSU/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 49 Number of Operations to Make Network Connected - DSU/code.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 50 Accounts Merge - DSU/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 50 Accounts Merge - DSU/code.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 51 Number of Islands - II - Online Queries - DSU/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 51 Number of Islands - II - Online Queries - DSU/code.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 52 Making a Large Island - DSU/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 52 Making a Large Island - DSU/code.cpp -------------------------------------------------------------------------------- /Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 53 Most Stones Removed with Same Row or Column - DSU/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 5 - Minimum Spanning Tree Or Disjoint Set/Lect 53 Most Stones Removed with Same Row or Column - DSU/code.cpp -------------------------------------------------------------------------------- /Graph/Part 6 - Other Algorithms/Lect 54 Strongly Connected Components - Kosaraju's Algorithm/numberOfSCC.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 6 - Other Algorithms/Lect 54 Strongly Connected Components - Kosaraju's Algorithm/numberOfSCC.cpp -------------------------------------------------------------------------------- /Graph/Part 6 - Other Algorithms/Lect 54 Strongly Connected Components - Kosaraju's Algorithm/printSCC.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 6 - Other Algorithms/Lect 54 Strongly Connected Components - Kosaraju's Algorithm/printSCC.cpp -------------------------------------------------------------------------------- /Graph/Part 6 - Other Algorithms/Lect 55 Bridges in Graph - Using Tarjan's Algorithm of time in and low time/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 6 - Other Algorithms/Lect 55 Bridges in Graph - Using Tarjan's Algorithm of time in and low time/code.cpp -------------------------------------------------------------------------------- /Graph/Part 6 - Other Algorithms/Lect 56 Articulation Point in Graph/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Graph/Part 6 - Other Algorithms/Lect 56 Articulation Point in Graph/code.cpp -------------------------------------------------------------------------------- /Heap/Lect 1 Heap Introduction and Identification/Introduction_to_Heap.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 1 Heap Introduction and Identification/Introduction_to_Heap.txt -------------------------------------------------------------------------------- /Heap/Lect 10 Sum of Elements between k1th smallest and k2th smallest numbers/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 10 Sum of Elements between k1th smallest and k2th smallest numbers/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 10 Sum of Elements between k1th smallest and k2th smallest numbers/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 10 Sum of Elements between k1th smallest and k2th smallest numbers/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 2 kth Smallest Element/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 2 kth Smallest Element/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 2 kth Smallest Element/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 2 kth Smallest Element/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 3 k Largest Elements in array/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 3 k Largest Elements in array/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 3 k Largest Elements in array/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 3 k Largest Elements in array/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 4 Sort a k Sorted Array Or Sort Nearly Sorted Array/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 4 Sort a k Sorted Array Or Sort Nearly Sorted Array/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 4 Sort a k Sorted Array Or Sort Nearly Sorted Array/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 4 Sort a k Sorted Array Or Sort Nearly Sorted Array/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 5 k Closest Numbers/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 5 k Closest Numbers/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 5 k Closest Numbers/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 5 k Closest Numbers/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 6 Top k Frequent Numbers/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 6 Top k Frequent Numbers/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 6 Top k Frequent Numbers/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 6 Top k Frequent Numbers/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 7 Frequency Sort/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 7 Frequency Sort/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 7 Frequency Sort/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 7 Frequency Sort/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 8 k Closest Points To Origin/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 8 k Closest Points To Origin/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 8 k Closest Points To Origin/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 8 k Closest Points To Origin/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 9 Connect Ropes to Minimise the Cost/Method_1_Sorting_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 9 Connect Ropes to Minimise the Cost/Method_1_Sorting_Approach.cpp -------------------------------------------------------------------------------- /Heap/Lect 9 Connect Ropes to Minimise the Cost/Method_2_Heap_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Heap/Lect 9 Connect Ropes to Minimise the Cost/Method_2_Heap_Approach.cpp -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/LICENSE -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/README.md -------------------------------------------------------------------------------- /Recursion/L10_Subset_Sum_I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L10_Subset_Sum_I.cpp -------------------------------------------------------------------------------- /Recursion/L11_Subset_Sum_II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L11_Subset_Sum_II.cpp -------------------------------------------------------------------------------- /Recursion/L12_Print_all_Permutation_of_String_Or_Array_Approach_1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L12_Print_all_Permutation_of_String_Or_Array_Approach_1.cpp -------------------------------------------------------------------------------- /Recursion/L13_Print_all_Permutation_of_String_Or_Array_Approach_2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L13_Print_all_Permutation_of_String_Or_Array_Approach_2.cpp -------------------------------------------------------------------------------- /Recursion/L14_N-Queens_Leetcode_Hard_Backtracking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L14_N-Queens_Leetcode_Hard_Backtracking.cpp -------------------------------------------------------------------------------- /Recursion/L15_Sudoko_Solver_Leetcode_Hard_Backtracking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L15_Sudoko_Solver_Leetcode_Hard_Backtracking.cpp -------------------------------------------------------------------------------- /Recursion/L16_M-Coloring_Problem_Backtracking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L16_M-Coloring_Problem_Backtracking.cpp -------------------------------------------------------------------------------- /Recursion/L17_Palindrome_Partitioning_Leetcode_Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L17_Palindrome_Partitioning_Leetcode_Recursion.cpp -------------------------------------------------------------------------------- /Recursion/L18_K-th_Permutation_Sequence_Leetcode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L18_K-th_Permutation_Sequence_Leetcode.cpp -------------------------------------------------------------------------------- /Recursion/L19_Rat_in_A_Maze_Backtracking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L19_Rat_in_A_Maze_Backtracking.cpp -------------------------------------------------------------------------------- /Recursion/L4_Check_String_Panlindrome.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L4_Check_String_Panlindrome.cpp -------------------------------------------------------------------------------- /Recursion/L4_Reverse_A_Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L4_Reverse_A_Array.cpp -------------------------------------------------------------------------------- /Recursion/L5_Fibonacci_Series.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L5_Fibonacci_Series.cpp -------------------------------------------------------------------------------- /Recursion/L7_Subsequence_with_Given_Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L7_Subsequence_with_Given_Sum.cpp -------------------------------------------------------------------------------- /Recursion/L8_Combination_Sum_I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L8_Combination_Sum_I.cpp -------------------------------------------------------------------------------- /Recursion/L9_Combination_Sum_II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/L9_Combination_Sum_II.cpp -------------------------------------------------------------------------------- /Recursion/Tower_of_Hanoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Recursion/Tower_of_Hanoi.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 1 Sliding Window Introduction Identification And Types/Introduction_to_Sliding_Window.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 1 Sliding Window Introduction Identification And Types/Introduction_to_Sliding_Window.txt -------------------------------------------------------------------------------- /Sliding Window/Lect 10 Longest Substring With k Unique Characters/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 10 Longest Substring With k Unique Characters/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 11 Longest Substring With No Repeating Characters/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 11 Longest Substring With No Repeating Characters/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 12 Pick Toys/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 12 Pick Toys/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 13 Minimum Window Substring/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 13 Minimum Window Substring/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 2 Sliding Window Problems/Problems.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 2 Sliding Window Problems/Problems.txt -------------------------------------------------------------------------------- /Sliding Window/Lect 3 Maximum Sum Subarray of size k/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 3 Maximum Sum Subarray of size k/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 4 First Negative Number in every Window of Size k/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 4 First Negative Number in every Window of Size k/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 5 Count Occurrences Of Anagrams/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 5 Count Occurrences Of Anagrams/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 6 Maximum of all subarrays of size k/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 6 Maximum of all subarrays of size k/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Lect 7 and 8 Largest Subarray of sum k/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Lect 7 and 8 Largest Subarray of sum k/code.cpp -------------------------------------------------------------------------------- /Sliding Window/Templates for Sliding Window/fixed_size_sliding_window.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Templates for Sliding Window/fixed_size_sliding_window.cpp -------------------------------------------------------------------------------- /Sliding Window/Templates for Sliding Window/variable_size_sliding_window.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Sliding Window/Templates for Sliding Window/variable_size_sliding_window.cpp -------------------------------------------------------------------------------- /Stack/Lect 1 Stack Introduction and Identification/Introduction_to_Stack.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 1 Stack Introduction and Identification/Introduction_to_Stack.txt -------------------------------------------------------------------------------- /Stack/Lect 2 NGR or Nearest Greater to right or Next Greater Element/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 2 NGR or Nearest Greater to right or Next Greater Element/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 2 NGR or Nearest Greater to right or Next Greater Element/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 2 NGR or Nearest Greater to right or Next Greater Element/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 3 NGL or Nearest Greater to left or Previous Greater Element/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 3 NGL or Nearest Greater to left or Previous Greater Element/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 3 NGL or Nearest Greater to left or Previous Greater Element/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 3 NGL or Nearest Greater to left or Previous Greater Element/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 4 NSL or Nearest Smaller to left or Previous Smaller Element/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 4 NSL or Nearest Smaller to left or Previous Smaller Element/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 4 NSL or Nearest Smaller to left or Previous Smaller Element/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 4 NSL or Nearest Smaller to left or Previous Smaller Element/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 5 NSR or Nearest Smaller to right or Next Smaller Element/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 5 NSR or Nearest Smaller to right or Next Smaller Element/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 5 NSR or Nearest Smaller to right or Next Smaller Element/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 5 NSR or Nearest Smaller to right or Next Smaller Element/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 6 Stock Span Problem/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 6 Stock Span Problem/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 6 Stock Span Problem/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 6 Stock Span Problem/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 7 Maximum Area Histogram/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 7 Maximum Area Histogram/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 7 Maximum Area Histogram/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 7 Maximum Area Histogram/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 7 Maximum Area Histogram/Method_3_Optimized_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 7 Maximum Area Histogram/Method_3_Optimized_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 8 Max Area Rectangle in binary matrix/Method_1_Brute_Force_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 8 Max Area Rectangle in binary matrix/Method_1_Brute_Force_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 8 Max Area Rectangle in binary matrix/Method_2_Stack_Approach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 8 Max Area Rectangle in binary matrix/Method_2_Stack_Approach.cpp -------------------------------------------------------------------------------- /Stack/Lect 9 Implement Min Stack/Method_1_With_Extra_Space.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 9 Implement Min Stack/Method_1_With_Extra_Space.cpp -------------------------------------------------------------------------------- /Stack/Lect 9 Implement Min Stack/Method_2_Without_Extra_Space.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Stack/Lect 9 Implement Min Stack/Method_2_Without_Extra_Space.cpp -------------------------------------------------------------------------------- /Tree/Lect 1 Introduction to Trees and Its Types/Introduction_to_Trees_and_Its_Types.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 1 Introduction to Trees and Its Types/Introduction_to_Trees_and_Its_Types.txt -------------------------------------------------------------------------------- /Tree/Lect 10 Iterative Inorder Traversal in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 10 Iterative Inorder Traversal in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 11 Iterative Postorder Traversal using 2 Stack/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 11 Iterative Postorder Traversal using 2 Stack/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 12 Iterative Postorder Traversal using 1 Stack/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 12 Iterative Postorder Traversal using 1 Stack/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 13 Preorder Inorder Postorder Traversals in One Traversal/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 13 Preorder Inorder Postorder Traversals in One Traversal/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 14 Maximum Depth or Height of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 14 Maximum Depth or Height of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 15 Check for Balanced Binary Tree/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 15 Check for Balanced Binary Tree/bruteForce.cpp -------------------------------------------------------------------------------- /Tree/Lect 15 Check for Balanced Binary Tree/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 15 Check for Balanced Binary Tree/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 16 Diameter of Binary Tree/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 16 Diameter of Binary Tree/bruteForce.cpp -------------------------------------------------------------------------------- /Tree/Lect 16 Diameter of Binary Tree/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 16 Diameter of Binary Tree/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 17 Maximum Path Sum in Binary Tree/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 17 Maximum Path Sum in Binary Tree/bruteForce.cpp -------------------------------------------------------------------------------- /Tree/Lect 17 Maximum Path Sum in Binary Tree/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 17 Maximum Path Sum in Binary Tree/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 18 Check it two trees are Identical or Not/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 18 Check it two trees are Identical or Not/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 19 Zig-Zag or Spiral Traversal in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 19 Zig-Zag or Spiral Traversal in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 2 Binary Tree Representation in C++/UsingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 2 Binary Tree Representation in C++/UsingClass.cpp -------------------------------------------------------------------------------- /Tree/Lect 2 Binary Tree Representation in C++/UsingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 2 Binary Tree Representation in C++/UsingStructure.cpp -------------------------------------------------------------------------------- /Tree/Lect 20 Boundary Traversal in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 20 Boundary Traversal in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 21 Vertical Order Traversal of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 21 Vertical Order Traversal of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 22 Top View of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 22 Top View of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 23 Bottom View of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 23 Bottom View of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 24 Right and Left View of Binary Tree/iterativeCode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 24 Right and Left View of Binary Tree/iterativeCode.cpp -------------------------------------------------------------------------------- /Tree/Lect 24 Right and Left View of Binary Tree/recursiveCode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 24 Right and Left View of Binary Tree/recursiveCode.cpp -------------------------------------------------------------------------------- /Tree/Lect 25 Check for Symmetrical Binary Trees/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 25 Check for Symmetrical Binary Trees/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 26 Print Root to Node Path in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 26 Print Root to Node Path in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 27 Lowest Common Ancestor in Binary Tree/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 27 Lowest Common Ancestor in Binary Tree/bruteForce.cpp -------------------------------------------------------------------------------- /Tree/Lect 27 Lowest Common Ancestor in Binary Tree/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 27 Lowest Common Ancestor in Binary Tree/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 28 Maximum Width of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 28 Maximum Width of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 29 Children Sum Property in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 29 Children Sum Property in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 3 Binary Tree Representation in Java/BinaryTree.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 3 Binary Tree Representation in Java/BinaryTree.class -------------------------------------------------------------------------------- /Tree/Lect 3 Binary Tree Representation in Java/BinaryTree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 3 Binary Tree Representation in Java/BinaryTree.java -------------------------------------------------------------------------------- /Tree/Lect 3 Binary Tree Representation in Java/Node.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 3 Binary Tree Representation in Java/Node.class -------------------------------------------------------------------------------- /Tree/Lect 30 Print all the Nodes at a distance of K in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 30 Print all the Nodes at a distance of K in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 31 Minimum time taken to Burn the Binary Tree from a Node/graphBFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 31 Minimum time taken to Burn the Binary Tree from a Node/graphBFS.cpp -------------------------------------------------------------------------------- /Tree/Lect 31 Minimum time taken to Burn the Binary Tree from a Node/graphDFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 31 Minimum time taken to Burn the Binary Tree from a Node/graphDFS.cpp -------------------------------------------------------------------------------- /Tree/Lect 32 Count total Nodes in a Complete Binary Tree/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 32 Count total Nodes in a Complete Binary Tree/bruteForce.cpp -------------------------------------------------------------------------------- /Tree/Lect 32 Count total Nodes in a Complete Binary Tree/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 32 Count total Nodes in a Complete Binary Tree/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 33 Requirements needed to construct a Unique Binary Tree/notes.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 33 Requirements needed to construct a Unique Binary Tree/notes.txt -------------------------------------------------------------------------------- /Tree/Lect 34 Construct a Binary Tree from Preorder and Inorder Traversal/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 34 Construct a Binary Tree from Preorder and Inorder Traversal/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 35 Construct the Binary Tree from Postorder and Inorder Traversal/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 35 Construct the Binary Tree from Postorder and Inorder Traversal/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 36 Serialize and De-serialize Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 36 Serialize and De-serialize Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 37 Morris Traversal Preorder and Inorder/inorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 37 Morris Traversal Preorder and Inorder/inorder.cpp -------------------------------------------------------------------------------- /Tree/Lect 37 Morris Traversal Preorder and Inorder/preorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 37 Morris Traversal Preorder and Inorder/preorder.cpp -------------------------------------------------------------------------------- /Tree/Lect 38 Flatten a Binary Tree to Linked List/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 38 Flatten a Binary Tree to Linked List/info.txt -------------------------------------------------------------------------------- /Tree/Lect 38 Flatten a Binary Tree to Linked List/iterativeApproach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 38 Flatten a Binary Tree to Linked List/iterativeApproach.cpp -------------------------------------------------------------------------------- /Tree/Lect 38 Flatten a Binary Tree to Linked List/morrisTraversalApproach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 38 Flatten a Binary Tree to Linked List/morrisTraversalApproach.cpp -------------------------------------------------------------------------------- /Tree/Lect 38 Flatten a Binary Tree to Linked List/recursiveApproach.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 38 Flatten a Binary Tree to Linked List/recursiveApproach.cpp -------------------------------------------------------------------------------- /Tree/Lect 39 Introduction to Binary Search Tree/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 39 Introduction to Binary Search Tree/info.txt -------------------------------------------------------------------------------- /Tree/Lect 40 Search in a Binary Search Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 40 Search in a Binary Search Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 41 Ceil in a Binary Search Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 41 Ceil in a Binary Search Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 42 Floor in a Binary Search Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 42 Floor in a Binary Search Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 43 Insert a given Node in Binary Search Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 43 Insert a given Node in Binary Search Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 44 Delete a Node in Binary Search Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 44 Delete a Node in Binary Search Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 45 Kth Smallest and Largest Element in BST/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 45 Kth Smallest and Largest Element in BST/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 46 Check if a tree is a BST or BT Or Validate a BST/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 46 Check if a tree is a BST or BT Or Validate a BST/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 47 Lowest Common Ancestor in Binary Search Tree/iterativeCode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 47 Lowest Common Ancestor in Binary Search Tree/iterativeCode.cpp -------------------------------------------------------------------------------- /Tree/Lect 47 Lowest Common Ancestor in Binary Search Tree/recursiveCode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 47 Lowest Common Ancestor in Binary Search Tree/recursiveCode.cpp -------------------------------------------------------------------------------- /Tree/Lect 48 Construct a BST from a preorder traversal/bruteForce1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 48 Construct a BST from a preorder traversal/bruteForce1.cpp -------------------------------------------------------------------------------- /Tree/Lect 48 Construct a BST from a preorder traversal/bruteForce2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 48 Construct a BST from a preorder traversal/bruteForce2.cpp -------------------------------------------------------------------------------- /Tree/Lect 48 Construct a BST from a preorder traversal/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 48 Construct a BST from a preorder traversal/info.txt -------------------------------------------------------------------------------- /Tree/Lect 48 Construct a BST from a preorder traversal/optimization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 48 Construct a BST from a preorder traversal/optimization.cpp -------------------------------------------------------------------------------- /Tree/Lect 49 Inorder Successor and Predecessor in BST/predecessor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 49 Inorder Successor and Predecessor in BST/predecessor.cpp -------------------------------------------------------------------------------- /Tree/Lect 49 Inorder Successor and Predecessor in BST/successor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 49 Inorder Successor and Predecessor in BST/successor.cpp -------------------------------------------------------------------------------- /Tree/Lect 5 Preorder Traversal of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 5 Preorder Traversal of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/BSTIterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/BSTIterator.cpp -------------------------------------------------------------------------------- /Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/beforeBSTIterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/beforeBSTIterator.cpp -------------------------------------------------------------------------------- /Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/info.txt -------------------------------------------------------------------------------- /Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/nextBSTIterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 50 Binary Search Tree Iterator in O(H) Space/nextBSTIterator.cpp -------------------------------------------------------------------------------- /Tree/Lect 51 Two Sum In BST Or Check if there exists a pair with Sum K/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 51 Two Sum In BST Or Check if there exists a pair with Sum K/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 52 Recover BST Or Correct BST with two nodes swapped/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 52 Recover BST Or Correct BST with two nodes swapped/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 53 Largest BST in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 53 Largest BST in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 6 Inorder Traversal of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 6 Inorder Traversal of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 7 Postorder Traversal of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 7 Postorder Traversal of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 8 Level Order or BFS Traversal of Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 8 Level Order or BFS Traversal of Binary Tree/code.cpp -------------------------------------------------------------------------------- /Tree/Lect 9 Iterative Preorder Traversal in Binary Tree/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Tree/Lect 9 Iterative Preorder Traversal in Binary Tree/code.cpp -------------------------------------------------------------------------------- /Trie/Lect 1 Implement Trie 1 - Insert, Search and StartsWith/usingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 1 Implement Trie 1 - Insert, Search and StartsWith/usingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 1 Implement Trie 1 - Insert, Search and StartsWith/usingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 1 Implement Trie 1 - Insert, Search and StartsWith/usingStructure.cpp -------------------------------------------------------------------------------- /Trie/Lect 2 Implement Trie 2 - Insert, countWordsEqualTo and countWordsStartingWith/usingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 2 Implement Trie 2 - Insert, countWordsEqualTo and countWordsStartingWith/usingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 2 Implement Trie 2 - Insert, countWordsEqualTo and countWordsStartingWith/usingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 2 Implement Trie 2 - Insert, countWordsEqualTo and countWordsStartingWith/usingStructure.cpp -------------------------------------------------------------------------------- /Trie/Lect 3 Longest Word With All Prefixes - Complete String/usingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 3 Longest Word With All Prefixes - Complete String/usingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 3 Longest Word With All Prefixes - Complete String/usingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 3 Longest Word With All Prefixes - Complete String/usingStructure.cpp -------------------------------------------------------------------------------- /Trie/Lect 4 Number of Distinct Substrings in a String/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 4 Number of Distinct Substrings in a String/bruteForce.cpp -------------------------------------------------------------------------------- /Trie/Lect 4 Number of Distinct Substrings in a String/trieUsingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 4 Number of Distinct Substrings in a String/trieUsingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 4 Number of Distinct Substrings in a String/trieUsingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 4 Number of Distinct Substrings in a String/trieUsingStructure.cpp -------------------------------------------------------------------------------- /Trie/Lect 5 Bit Manipulation PreRequisites for Trie Problems/info.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 5 Bit Manipulation PreRequisites for Trie Problems/info.txt -------------------------------------------------------------------------------- /Trie/Lect 6.Maximum XOR of Two Numbers in an Array/usingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 6.Maximum XOR of Two Numbers in an Array/usingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 6.Maximum XOR of Two Numbers in an Array/usingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 6.Maximum XOR of Two Numbers in an Array/usingStructure.cpp -------------------------------------------------------------------------------- /Trie/Lect 7 Maximum XOR With an Element From Array - Queries/bruteForce.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 7 Maximum XOR With an Element From Array - Queries/bruteForce.cpp -------------------------------------------------------------------------------- /Trie/Lect 7 Maximum XOR With an Element From Array - Queries/trieUsingClass.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 7 Maximum XOR With an Element From Array - Queries/trieUsingClass.cpp -------------------------------------------------------------------------------- /Trie/Lect 7 Maximum XOR With an Element From Array - Queries/trieUsingStructure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/VinayakJamadar/DSA/HEAD/Trie/Lect 7 Maximum XOR With an Element From Array - Queries/trieUsingStructure.cpp --------------------------------------------------------------------------------