nlok5923 / Love-Babbar-450

This repo is devoted for the complete solution of 450 questions provided by love Babbar. Those solutions are hosted for viewing purpose on below link
1 stars 0 forks source link
cheatsheet coding competitive-programming dsa dsa-algorithm love-babbar

Want to contribute to lb-450

Follow this steps:

Fork this repo
Solve any problem of love babbar 450 question set
Name filename as problem statement name(in concise).
make a pr 

After approval see your solution hosted on: lb-450

Download Question set from here : Question-set

Type link Status
Array Reverse the array :white_check_mark:
Array Find the maximum and minimum element in an array :white_check_mark:
Array Find the "Kth" max and min element of an array :white_check_mark:
Array Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo :white_check_mark:
Array Move all the negative elements to one side of the array :white_check_mark:
Array Find the Union and Intersection of the two sorted arrays. :white_check_mark:
Array Write a program to cyclically rotate an array by one. :white_check_mark:
Array find Largest sum contiguous Subarray [V. IMP] :white_check_mark:
Array Minimise the maximum difference between heights [V.IMP] :white_check_mark:
Array Minimum no. of Jumps to reach end of an array :white_check_mark:
Array find duplicate in an array of N+1 Integers :white_check_mark:
Array Merge 2 sorted arrays without using Extra space. cfg :white_check_mark:
Array Kadane's Algo [V.V.V.V.V IMP] :white_check_mark:
Array Merge Intervals
Array Next Permutation :white_check_mark:
Array Count Inversion :white_check_mark:
Array Best time to buy and Sell stock :white_check_mark:
Array find all pairs on integer array whose sum is equal to given number :white_check_mark:
Array find common elements In 3 sorted arrays :white_check_mark:
Array Rearrange the array in alternating positive and negative items with O(1) extra space :white_check_mark:
Array Find if there is any subarray with sum equal to 0 :white_check_mark:
Array Find factorial of a large number :white_check_mark:
Array find maximum product subarray :white_check_mark:
Array Find longest coinsecutive subsequence :white_check_mark:
Array Given an array of size n and a number k, fin all elements that appear more than " n/k " times. :white_check_mark:
Array Maximum profit by buying and selling a share atmost twice :white_check_mark:
Array Find whether an array is a subset of another array :white_check_mark:
Array Find the triplet that sum to a given value :white_check_mark:
Array Trapping Rain water problem :white_check_mark:
Array Chocolate Distribution problem :white_check_mark:
Array Smallest Subarray with sum greater than a given value :white_check_mark:
Array Three way partitioning of an array around a given value
Array Minimum swaps required bring elements less equal K together
Array Minimum no. of operations required to make an array palindrome
Array Median of 2 sorted arrays of equal size
Array Median of 2 sorted arrays of different size
Matrix Spiral traversal on a Matrix :white_check_mark:
Matrix Search an element in a matriix :white_check_mark:
Matrix Find median in a row wise sorted matrix :white_check_mark:
Matrix Find row with maximum no. of 1's :white_check_mark:
Matrix Print elements in sorted order using row-column wise sorted matrix
Matrix Maximum size rectangle corrupted
Matrix Find a specific pair in matrix documentation
Matrix Rotate matrix by 90 degrees
Matrix Kth smallest element in a row-cpumn wise sorted matrix
Matrix Common elements in all rows of a given matrix
String Reverse a String :white_check_mark:
String Check whether a String is Palindrome or not :white_check_mark:
String Find Duplicate characters in a string :white_check_mark:
String Why strings are immutable in Java? :white_check_mark:
String Write a Code to check whether one string is a rotation of another :white_check_mark:
String Write a Program to check whether a string is a valid shuffle of two strings or not
String Count and Say problem ghatiya
String Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] dp
String Find Longest Recurring Subsequence in String dp
String Print all Subsequences of a string.
String Print all the permutations of the given string dp
String Split the Binary string into two substring with equal 0’s and 1’s :white_check_mark:
String Word Wrap Problem [VERY IMP]. dp
String EDIT Distance [Very Imp] dp
String Find next greater number with same set of digits. [Very Very IMP]
String Balanced Parenthesis problem.[Imp]
String Word break Problem[ Very Imp]
String Rabin Karp Algo
String KMP Algo :white_check_mark:
String Convert a Sentence into its equivalent mobile numeric keypad sequence. :white_check_mark:
String Minimum number of bracket reversals needed to make an expression balanced.
String Count All Palindromic Subsequence in a given String. dp
String Count of number of given string in 2D character array bt
String Search a Word in a 2D Grid of characters. bt
String Boyer Moore Algorithm for Pattern Searching.
String Converting Roman Numerals to Decimal
String Longest Common Prefix
String Number of flips to make binary string alternate
String Find the first repeated word in string.
String Minimum number of swaps for bracket balancing.
String Find the longest common subsequence between two strings. dp
String Program to generate all possible valid IP addresses from given string. doc
String Write a program tofind the smallest window that contains all characters of string itself.
String Rearrange characters in a string such that no two adjacent are same :o:
String Minimum characters to be added at front to make string palindrome see again
String Given a sequence of words, print all anagrams together
String Find the smallest window in a string containing all characters of another string :o:
String Recursively remove all adjacent duplicates :o:
String String matching where one string contains wildcard characters :o:
String Function to find Number of customers who could not get a computer
String Transform One String to Another using Minimum Number of Given Operation
String Check if two given strings are isomorphic to each other
String Recursively print all sentences that can be formed from list of word lists recursion
Searching & Sorting Find first and last positions of an element in a sorted array
Searching & Sorting Find a Fixed Point (Value equal to index) in a given array
Searching & Sorting Search in a rotated sorted array
Searching & Sorting square root of an integer
Searching & Sorting Maximum and minimum of an array using minimum number of comparisons
Searching & Sorting Optimum location of point to minimize total distance doc
Searching & Sorting Find the repeating and the missing kinda unique
Searching & Sorting find majority element
Searching & Sorting Searching in an array where adjacent differ by at most k
Searching & Sorting find a pair with a given difference BS not working
Searching & Sorting find four elements that sum to a given value good to see
Searching & Sorting maximum sum such that no 2 elements are adjacent DP
Searching & Sorting Count triplet with sum smaller than a given value
Searching & Sorting merge 2 sorted arrays Hard
Searching & Sorting print all subarrays with 0 sum need more emphasis
Searching & Sorting Product array Puzzle
Searching & Sorting Sort array according to count of set bits
Searching & Sorting minimum no. of swaps required to sort the array partially done
Searching & Sorting Bishu and Soldiers :o:
Searching & Sorting Rasta and Kheshtak :o:
Searching & Sorting Kth smallest number again :o:
Searching & Sorting Find pivot element in a sorted array
Searching & Sorting K-th Element of Two Sorted Arrays solved not optmized
Searching & Sorting Aggressive cows :o:
Searching & Sorting Book Allocation Problem :o:
Searching & Sorting EKOSPOJ: :o:
Searching & Sorting Job Scheduling Algo :o:
Searching & Sorting Missing Number in AP
Searching & Sorting Smallest number with atleastn trailing zeroes infactorial
Searching & Sorting ROTI-Prata SPOJ :o:
Searching & Sorting DoubleHelix SPOJ :o:
Searching & Sorting Subset Sums :o:
Searching & Sorting Findthe inversion count :o:
Searching & Sorting Implement Merge-sort in-place :o:
Searching & Sorting Partitioning and Sorting Arrays with Many Repeated Entries :o:
LinkedList Write a Program to reverse the Linked List. (Both Iterative and recursive)
LinkedList Reverse a Linked List in group of Given Size. [Very Imp] good question
LinkedList Write a program to Detect loop in a linked list.
LinkedList Find the starting point of the loop.
LinkedList Remove Duplicates in a sorted Linked List.
LinkedList Remove Duplicates in a Un-sorted Linked List.
LinkedList Write a Program to Move the last element to Front in a Linked List.
LinkedList Add “1” to a number represented as a Linked List. opt for large input
LinkedList Add two numbers represented by linked lists. opt for large input
LinkedList Intersection of two Sorted Linked List. :o:
LinkedList Intersection Point of two Linked Lists. :o:
LinkedList Merge Sort For Linked lists.[Very Important] :o:
LinkedList Quicksort for Linked Lists.[Very Important] :o:
LinkedList Find the middle Element of a linked list. :o:
LinkedList Check if a linked list is a circular linked list. :o:
LinkedList Split a Circular linked list into two halves. :o:
LinkedList Write a Program to check whether the Singly Linked list is a palindrome or not. :o:
LinkedList Deletion from a Circular Linked List. :o:
LinkedList Reverse a Doubly Linked list. :o:
LinkedList Find pairs with a given sum in a DLL. :o:
LinkedList Count triplets in a sorted DLL whose sum is equal to given value “X”. :o:
LinkedList Sort a “k”sorted Doubly Linked list.[Very IMP] :o:
LinkedList Rotate DoublyLinked list by N nodes. :o:
LinkedList Rotate a Doubly Linked list in group of Given Size.[Very IMP] :o:
LinkedList Can we reverse a linked list in less than O(n) ? :o:
LinkedList Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ? :o:
LinkedList Flatten a Linked List :o:
LinkedList Sort a LL of 0's, 1's and 2's :o:
LinkedList Clone a linked list with next and random pointer :o:
LinkedList Merge K sorted Linked list :o:
LinkedList Multiply 2 no. represented by LL :o:
LinkedList Delete nodes which have a greater value on right side :o:
LinkedList Segregate even and odd nodes in a Linked List :o:
LinkedList Program for n’th node from the end of a Linked List :o:
LinkedList Find the first non-repeating character from a stream of characters :o:
Binary Trees level order traversal :white_check_mark:
Binary Trees Reverse Level Order traversal :white_check_mark:
Binary Trees Height of a tree :white_check_mark:
Binary Trees Diameter of a tree :white_check_mark:
Binary Trees Mirror of a tree :negative_squared_cross_mark:
Binary Trees Inorder Traversal of a tree both using recursion and Iteration :white_check_mark:
Binary Trees Preorder Traversal of a tree both using recursion and Iteration :white_check_mark:
Binary Trees Postorder Traversal of a tree both using recursion and Iteration :white_check_mark:
Binary Trees Left View of a tree :white_check_mark:
Binary Trees Right View of Tree
Binary Trees Top View of a tree :negative_squared_cross_mark:
Binary Trees Bottom View of a tree :negative_squared_cross_mark:
Binary Trees Zig-Zag traversal of a binary tree :negative_squared_cross_mark:
Binary Trees Check if a tree is balanced or not :white_check_mark:
Binary Trees Diagnol Traversal of a Binary tree
Binary Trees Boundary traversal of a Binary tree
Binary Trees Construct Binary Tree from String with Bracket Representation
Binary Trees Convert Binary tree into Doubly Linked List :o:
Binary Trees Convert Binary tree into Sum tree :o:
Binary Trees Construct Binary tree from Inorder and preorder traversal :o:
Binary Trees Find minimum swaps required to convert a Binary tree into BST :o:
Binary Trees Check if Binary tree is Sum tree or not :o:
Binary Trees Check if all leaf nodes are at same level or not :o:
Binary Trees Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ] :o:
Binary Trees Check if 2 trees are mirror or not :o:
Binary Trees Sum of Nodes on the Longest path from root to leaf node :o:
Binary Trees Check if given graph is tree or not. [ IMP ] :o:
Binary Trees Find Largest subtree sum in a tree :o:
Binary Trees Maximum Sum of nodes in Binary tree such that no two are adjacent :o:
Binary Trees Print all "K" Sum paths in a Binary tree :o:
Binary Trees Find LCA in a Binary tree :o:
Binary Trees Find distance between 2 nodes in a Binary tree :o:
Binary Trees Kth Ancestor of node in a Binary tree :o:
Binary Trees Find all Duplicate subtrees in a Binary tree [ IMP ] :o:
Binary Trees Tree Isomorphism Problem :o:
Binary Search Trees Fina a value in a BST :o:
Binary Search Trees Deletion of a node in a BST :o:
Binary Search Trees Find min and max value in a BST :o:
Binary Search Trees Find inorder successor and inorder predecessor in a BST :o:
Binary Search Trees Check if a tree is a BST or not :o:
Binary Search Trees Populate Inorder successor of all nodes :o:
Binary Search Trees Find LCA of 2 nodes in a BST :o:
Binary Search Trees Construct BST from preorder traversal :o:
Binary Search Trees Convert Binary tree into BST :o:
Binary Search Trees Convert a normal BST into a Balanced BST :o:
Binary Search Trees Merge two BST [ V.V.V>IMP ] :o:
Binary Search Trees Find Kth largest element in a BST :o:
Binary Search Trees Find Kth smallest element in a BST :o:
Binary Search Trees Count pairs from 2 BST whose sum is equal to given value "X" :o:
Binary Search Trees Find the median of BST in O(n) time and O(1) space :o:
Binary Search Trees Count BST ndoes that lie in a given range :o:
Binary Search Trees Replace every element with the least greater element on its right :o:
Binary Search Trees Given "n" appointments, find the conflicting appointments :o:
Binary Search Trees Check preorder is valid or not :o:
Binary Search Trees Check whether BST contains Dead end :o:
Binary Search Trees Largest BST in a Binary Tree [ V.V.V.V.V IMP ] :o:
Binary Search Trees Flatten BST to sorted list :o:
Greedy Activity Selection Problem
Greedy Job SequencingProblem :o:
Greedy Huffman Coding
Greedy Water Connection Problem
Greedy Fractional Knapsack Problem :o:
Greedy Greedy Algorithm to find Minimum number of Coins nahi aata
Greedy Maximum trains for which stoppage can be provided :o:
Greedy Minimum Platforms Problem :o:
Greedy Buy Maximum Stocks if i stocks can be bought on i-th day :o:
Greedy Find the minimum and maximum amount to buy all N candies :o:
Greedy Minimize Cash Flow among a given set of friends who have borrowed money from each other :o:
Greedy Minimum Cost to cut a board into squares :o:
Greedy Check if it is possible to survive on Island :o:
Greedy Find maximum meetings in one room :o:
Greedy Maximum product subset of an array :o:
Greedy Maximize array sum after K negations :o:
Greedy Maximize the sum of arr[i]*i :o:
Greedy Maximum sum of absolute difference of an array :o:
Greedy Maximize sum of consecutive differences in a circular array :o:
Greedy Minimum sum of absolute difference of pairs of two arrays :o:
Greedy Program for Shortest Job First (or SJF) CPU Scheduling :o:
Greedy Program for Least Recently Used (LRU) Page Replacement algorithm :o:
Greedy Smallest subset with sum greater than all other elements :o:
Greedy Chocolate Distribution Problem :o:
Greedy DEFKIN -Defense of a Kingdom :o:
Greedy DIEHARD -DIE HARD :o:
Greedy GERGOVIA -Wine trading in Gergovia :o:
Greedy Picking Up Chicks :o:
Greedy CHOCOLA –Chocolate :o:
Greedy ARRANGE -Arranging Amplifiers :o:
Greedy K Centers Problem :o:
Greedy Minimum Cost of ropes :o:
Greedy Find smallest number with given number of digits and sum of digits :o:
Greedy Rearrange characters in a string such that no two adjacent are same :o:
Greedy Find maximum sum possible equal sum of three stacks :o:
BackTracking Rat in a maze Problem :o:
BackTracking Printing all solutions in N-Queen Problem :o:
BackTracking Word Break Problem using Backtracking :o:
BackTracking Remove Invalid Parentheses :o:
BackTracking Sudoku Solver :o:
BackTracking m Coloring Problem :o:
BackTracking Print all palindromic partitions of a string :o:
BackTracking Subset Sum Problem :o:
BackTracking The Knight’s tour problem :o:
BackTracking Tug of War :o:
BackTracking Find shortest safe route in a path with landmines :o:
BackTracking Combinational Sum :o:
BackTracking Find Maximum number possible by doing at-most K swaps :o:
BackTracking Print all permutations of a string :o:
BackTracking Find if there is a path of more than k length from a source :o:
BackTracking Longest Possible Route in a Matrix with Hurdles :o:
BackTracking Print all possible paths from top left to bottom right of a mXn matrix :o:
BackTracking Partition of a set intoK subsets with equal sum :o:
BackTracking Find the K-th Permutation Sequence of first N natural numbers :o:
Stacks & Queues Implement Stack from Scratch
Stacks & Queues Implement Queue from Scratch
Stacks & Queues Implement 2 stack in an array :o:
Stacks & Queues find the middle element of a stack :o:
Stacks & Queues Implement "N" stacks in an Array :o:
Stacks & Queues Check the expression has valid or Balanced parenthesis or not. :o:
Stacks & Queues Reverse a String using Stack :o:
Stacks & Queues Design a Stack that supports getMin() in O(1) time and O(1) extra space. :o:
Stacks & Queues Find the next Greater element :o:
Stacks & Queues The celebrity Problem :o:
Stacks & Queues Arithmetic Expression evaluation.) :o:
Stacks & Queues Evaluation of Postfix expression :o:
Stacks & Queues Implement a method to insert an element at its bottom without using any other data structure. :o:
Stacks & Queues Reverse a stack using recursion :o:
Stacks & Queues Sort a Stack using recursion :o:
Stacks & Queues Merge Overlapping Intervals :o:
Stacks & Queues Largest rectangular Area in Histogram :o:
Stacks & Queues Length of the Longest Valid Substring :o:
Stacks & Queues Expression contains redundant bracket or not :o:
Stacks & Queues Implement Stack using Queue :o:
Stacks & Queues Implement Stack using Deque :o:
Stacks & Queues Stack Permutations (Check if an array is stack permutation of other) :o:
Stacks & Queues Implement Queue using Stack :o:
Stacks & Queues Implement "n" queue in an array :o:
Stacks & Queues Implement a Circular queue :o:
Stacks & Queues LRU Cache Implementationa :o:
Stacks & Queues Reverse a Queue using recursion :o:
Stacks & Queues Reverse the first “K” elements of a queue :o:
Stacks & Queues Interleave the first half of the queue with second half :o:
Stacks & Queues Find the first circular tour that visits all Petrol Pumps :o:
Stacks & Queues Minimum time required to rot all oranges :o:
Stacks & Queues Distance of nearest cell having 1 in a binary matrix :o:
Stacks & Queues First negative integer in every window of size “k” :o:
Stacks & Queues Check if all levels of two trees are anagrams or not. :o:
Stacks & Queues Sum of minimum and maximum elements of all subarrays of size “k”. :o:
Stacks & Queues Minimum sum of squares of character counts in a given string after removing “k” characters. :o:
Stacks & Queues Queue based approach or first non-repeating character in a stream. :o:
Stacks & Queues Next Smaller Element :o:
Heap Implement a Maxheap/MinHeap using arrays and recursion. :o:
Heap Sort an Array using heap. (HeapSort) :o:
Heap Maximum of all subarrays of size k. :o:
Heap “k” largest element in an array :o:
Heap Kth smallest and largest element in an unsorted array :o:
Heap Merge “K” sorted arrays. [ IMP ] :o:
Heap Merge 2 Binary Max Heaps :o:
Heap Kth largest sum continuous subarrays :o:
Heap Leetcode- reorganize strings :o:
Heap Merge “K” Sorted Linked Lists [V.IMP] :o:
Heap Smallest range in “K” Lists :o:
Heap Median in a stream of Integers :o:
Heap Check if a Binary Tree is Heap :o:
Heap Connect “n” ropes with minimum cost :o:
Heap Convert BST to Min Heap :o:
Heap Convert min heap to max heap :o:
Heap Rearrange characters in a string such that no two adjacent are same. :o:
Heap Minimum sum of two numbers formed from digits of an array :o:
Graph Create a Graph, print it :o:
Graph Implement BFS algorithm :o:
Graph Implement DFS Algo :o:
Graph Detect Cycle in Directed Graph using BFS/DFS Algo :o:
Graph Detect Cycle in UnDirected Graph using BFS/DFS Algo :o:
Graph Search in a Maze :o:
Graph Minimum Step by Knight :o:
Graph flood fill algo :o:
Graph Clone a graph :o:
Graph Making wired Connections :o:
Graph word Ladder :o:
Graph Dijkstra algo :o:
Graph Implement Topological Sort :o:
Graph Minimum time taken by each job to be completed given by a Directed Acyclic Graph :o:
Graph Find whether it is possible to finish all tasks or not from given dependencies :o:
Graph Find the no. of Isalnds :o:
Graph Given a sorted Dictionary of an Alien Language, find order of characters :o:
Graph Implement Kruksal’sAlgorithm :o:
Graph Implement Prim’s Algorithm :o:
Graph Total no. of Spanning tree in a graph :o:
Graph Implement Bellman Ford Algorithm :o:
Graph Implement Floyd warshallAlgorithm :o:
Graph Travelling Salesman Problem :o:
Graph Graph ColouringProblem :o:
Graph Snake and Ladders Problem :o:
Graph Find bridge in a graph :o:
Graph Count Strongly connected Components(Kosaraju Algo) :o:
Graph Check whether a graph is Bipartite or Not :o:
Graph Detect Negative cycle in a graph :o:
Graph Longest path in a Directed Acyclic Graph :o:
Graph Journey to the Moon :o:
Graph Cheapest Flights Within K Stops :o:
Graph Oliver and the Game :o:
Graph Water Jug problem using BFS :o:
Graph Water Jug problem using BFS :o:
Graph Find if there is a path of more thank length from a source :o:
Graph M-ColouringProblem :o:
Graph Minimum edges to reverse o make path from source to destination :o:
Graph Paths to travel each nodes using each edge(Seven Bridges) :o:
Graph Vertex Cover Problem :o:
Graph Chinese Postman or Route Inspection :o:
Graph Number of Triangles in a Directed and Undirected Graph :o:
Graph Minimise the cashflow among a given set of friends who have borrowed money from each other :o:
Graph Two Clique Problem :o:
Trie Construct a trie from scratch :o:
Trie Find shortest unique prefix for every word in a given list :o:
Trie Word Break Problem (Trie solution) :o:
Trie Given a sequence of words, print all anagrams together :o:
Trie Implement a Phone Directory :o:
Trie Print unique rows in a given boolean matrix :o:
Dynamic Programming Coin ChangeProblem :o:
Dynamic Programming Knapsack Problem :o:
Dynamic Programming Binomial CoefficientProblem :o:
Dynamic Programming Permutation CoefficientProblem :o:
Dynamic Programming Program for nth Catalan Number :o:
Dynamic Programming Matrix Chain Multiplication :o:
Dynamic Programming Edit Distance :o:
Dynamic Programming Subset Sum Problem :o:
Dynamic Programming Friends Pairing Problem :o:
Dynamic Programming Gold Mine Problem :o:
Dynamic Programming Assembly Line SchedulingProblem :o:
Dynamic Programming Painting the Fenceproblem :o:
Dynamic Programming Maximize The Cut Segments :o:
Dynamic Programming Longest Common Subsequence :o:
Dynamic Programming Longest Repeated Subsequence :o:
Dynamic Programming Longest Increasing Subsequence :o:
Dynamic Programming Space Optimized Solution of LCS :o:
Dynamic Programming LCS (Longest Common Subsequence) of three strings :o:
Dynamic Programming Maximum Sum Increasing Subsequence :o:
Dynamic Programming Count all subsequences having product less than K :o:
Dynamic Programming Longest subsequence such that difference between adjacent is one :o:
Dynamic Programming Maximum subsequence sum such that no three are consecutive :o:
Dynamic Programming Egg Dropping Problem :o:
Dynamic Programming Maximum Length Chain of Pairs :o:
Dynamic Programming Maximum size square sub-matrix with all 1s :o:
Dynamic Programming Maximum sum of pairs with specific difference :o:
Dynamic Programming Min Cost PathProblem :o:
Dynamic Programming Maximum difference of zeros and ones in binary string :o:
Dynamic Programming Minimum number of jumps to reach end :o:
Dynamic Programming Minimum cost to fill given weight in a bag :o:
Dynamic Programming Minimum removals from array to make max –min <= K :o:
Dynamic Programming Longest Common Substring :o:
Dynamic Programming Count number of ways to reacha given score in a game :o:
Dynamic Programming Count Balanced Binary Trees of Height h :o:
Dynamic Programming LargestSum Contiguous Subarray [V>V>V>V IMP ] :o:
Dynamic Programming Smallest sum contiguous subarray :o:
Dynamic Programming Unbounded Knapsack (Repetition of items allowed) :o:
Dynamic Programming Word Break Problem :o:
Dynamic Programming Largest Independent Set Problem :o:
Dynamic Programming Partition problem :o:
Dynamic Programming Longest Palindromic Subsequence :o:
Dynamic Programming Count All Palindromic Subsequence in a given String :o:
Dynamic Programming Longest Palindromic Substring :o:
Dynamic Programming Longest alternating subsequence :o:
Dynamic Programming Weighted Job Scheduling :o:
Dynamic Programming Coin game winner where every player has three choices :o:
Dynamic Programming Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] :o:
Dynamic Programming Maximum profit by buying and selling a share at most twice [ IMP ] :o:
Dynamic Programming Optimal Strategy for a Game :o:
Dynamic Programming Optimal Binary Search Tree :o:
Dynamic Programming Palindrome PartitioningProblem :o:
Dynamic Programming Word Wrap Problem :o:
Dynamic Programming Mobile Numeric Keypad Problem [ IMP ] :o:
Dynamic Programming Boolean Parenthesization Problem :o:
Dynamic Programming Largest rectangular sub-matrix whose sum is 0 :o:
Dynamic Programming Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] :o:
Dynamic Programming Maximum sum rectangle in a 2D matrix :o:
Dynamic Programming Maximum profit by buying and selling a share at most k times :o:
Dynamic Programming Find if a string is interleaved of two other strings :o:
Dynamic Programming Maximum Length of Pair Chain :o:
Bit Manipulation Count set bits in an integer :o:
Bit Manipulation Find the two non-repeating elements in an array of repeating elements :o:
Bit Manipulation Count number of bits to be flipped to convert A to B :o:
Bit Manipulation Count total set bits in all numbers from 1 to n :o:
Bit Manipulation Program to find whether a no is power of two :o:
Bit Manipulation Find position of the only set bit :o:
Bit Manipulation Copy set bits in a range :o:
Bit Manipulation Divide two integers without using multiplication, division and mod operator :o:
Bit Manipulation [Calculate square of a number without using *, / and pow()](https://www.geeksforgeeks.org/calculate-square-of-a-number-without-using-and-pow/#:~:text=Given%20an%20integer%20n%2C%20calculate,*%2C%20%2F%20and%20pow().&text=A%20Simple%20Solution%20is%20to%20repeatedly%20add%20n%20to%20result.) :o:
Bit Manipulation Power Set :o: