Repository for solving the right questions and not grinding over redundant one
- DYNAMIC PROGRAMMING
- BACKTRACKING
- DIVIDE AND CONQUERE
- GREEDY
- GRAPH ALGORITHM
- BRANCH AND BOUND
- PATTERN MATCHING
- RANDOMISED ALGORITHM
- SORTING & SEARCHING
- TREES
- LINKED LIST
- STACK
-
- Bell Numbers
- Tilling Problem
- Friends Pairing Problem
- Tiling With Dominoes
- Painting Fence Algorithm
- Tile Stacking Problem
- Highway Billboard Problem
- choose maximum weight given weight value ratio
- maximum sum subsequence least k distant elements
- maximum number of trailing zeros
- hosoyas triangle
- wildcard pattern matching
- non crossing lines connect points circle
- Balanced expressions such that given positions have opening brackets
- word wrap problem
- Maximize arr[j] – arr[i] + arr[l] – arr[k]
-
Longest increasing subsequence
- Maximum Sum Bitonic Subsequence
- Maximum Product Increasing Subsequenc
- Count Subsequences Product Less K --Doubt
- Maximum Length Chain Of Pairs
- Longest Alternating Subsequence -Doubt
- Box Stacking Problem
- Weighted Job Scheduling
- Building Bridges
- minimum insertions sort array
- min number del make sorted sequence
- maximum sum bitonic subarray
-
- Gold Mine Problem
- minimum sum path
- max decimal value path in a binary matrix
- max sqsubmatrix with equal ele
- maximum points collected by two persons allowed to meet once --Doubt
- minimum sum path 3d array
- minimum positive points to reach destination
- minimum jumps to reach last building
- longest path in a matrix
- check possible path 2d matrix
- longest increasing path matrix
- prefix sum 2d array
- maximize binary matrix filpping submatrix
- number of palindromic paths in a matrix
- Largest rectangular sub-matrix whose sum is 0
- Largest rectangular sub-matrix having sum divisible by k
- Largest area rectangular sub-matrix with equal number of 1’s and 0’s
- Collect maximum points in a grid using two traversals
- Maximum points from top left of matrix to bottom right and return back
- Check whether row or column swaps produce maximum size binary sub-matrix with all 1s
-
- Count Balanced Binary Trees of Height h
- Vertex Cover Problem
- Largest Independent Set
- subtree min color diff 2coloured tree
- minimum cost to reach destination
- multistage graph shortest path
- Shortest path with exactly k edges in a directed and weighted graph
- Traversal of tree with k jumps allowed between nodes of same height
Place one has the fun times of linking here, but I can also link back here.