Count Balanced Binary Trees of Height h
Count Distinct Subsequences
Count Number of Increasing SubSequence
Count Number of Subsets having Given XOR Value
Count Number of Ways to Reach A Given Score in A Game
Count Number of Ways to jump to Reach End
Count Ways to Build Street Under Given Constraints
Count Ways to Reach the Nth Stair Using Step 1, 2 or 3
Count all subsequences having product less than K
Count of Different Ways to Express N As The Sum of 1, 3 And 4
Find Bitonic Point in Given Bitonic Sequence
Find Closest Number in Array
Find Maximum Possible Stolen Value From Houses
Find a Fixed Point in a Given Array
Find the Element that appears once in a Sorted Array
Fractional Knapsack Problem
Highway Billboard Problem
Jacobsthal and Jacobsthal-Lucas numbers
K-th Element of Two Sorted Arrays
Largest Sum Contiguous Subarray
Longest Arithmetic Progression
Longest Bitonic Subsequence
Longest Common Increasing Subsequence
Longest Common Subsequence
Longest Geometric Progression
Longest Increasing Subsequence
Longest Palindromic Subsequence
Longest Repeated Subsequence
Longest Substring Without Repeating Characters
Matrix Chain Multiplication
Maximize the sum of index by muliplying the element at the index
Maximum Length Chain of Pairs
Maximum Product Subset of an Array
Maximum Size Subset with Given Sum
Maximum Subset Sum With No Repeating Digits
Maximum Sum Increasing Subsequence
Maximum games played by winner
Maximum length subsequence
Maximum path sum in a triangle
Maximum product of an increasing subsequence
Maximum size square sub-matrix with all 1s
Maximum sum of pairs with specific difference
Median of Two Sorted Arrays of Same Size
Minimum Cost to Fill Given Weight in A Bag
Minimum Insertions to Form a Palindrome
Minimum Insertions to Sort An Array
Minimum Number of Jumps to Reach ( M , N ) From ( 1 , 1 )
Minimum Number of Jumps to Reach End
Minimum Product Subset of an Array
Minimum Sum of Absolute Difference of Pairs of Two Arrays
Minimum Sum of Multiplications of N Numbers
Minimum Sum of Product of Two Arrays
Newman-Shanks-Williams prime
Number of N Digit(s) Stepping Numbers
Optimal Strategy for a Game
Power Set in Lexicographic order
Remove Invalid Parentheses
Rotation Count in Rotated Sorted Array
Size of The Subarray With Maximum Sum
Smallest Sum Contiguous Subarray
Split A Number into Maximum Composite Number
String Matching Algorithms
Sum of All Substrings of A String Representing A Number
Sum of Average of All Subsets
The Knight’s Tour Problem
Wildcard Pattern Matching
Latest commit Shoaib Rayeen
Oct 8, 2018 Folders and files Name Name Last commit message
Last commit date
parent directory Oct 8, 2018
Oct 8, 2018
View all files
Given a string, print the longest repeating subsequence such that the two subsequence don’t have same string character at same position, i.e., any i’th character in the two subsequences shouldn’t have the same index in the original string.
You can’t perform that action at this time.
