Files

0-1 Knapsack Problem
Bell Numbers
Binary Search
Binomial Coefficient
Boggle
Coin Change
Combinational Sum
Compute nCr mod p
Count Balanced Binary Trees of Height h
Count Distinct Subsequences
Count Inversions
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
Cubic Root of A Number
Cutting a Rod
DATA STRUCTURES
Delannoy Number
Dice Throw Problem
Dijkstra's Algorithm
Edit Distance
Egg Dropping Puzzle
Entringer Number
Eulerian Number
Fibonacci numbers
Find A Peak Element
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
Floor in a Sorted Array
Floyd warshal
Fractional Knapsack Problem
Friends Pairing Problem
Golomb Sequence
Graph Coloring Problem
Hamiltonian Cycle
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
- code_1.cpp
- readMe.md
Longest Common Prefix
Longest Common Subsequence
Longest Common Substring
Longest Geometric Progression
Longest Increasing Subsequence
Longest Palindromic Subsequence
Longest Repeated Subsequence
Longest Substring Without Repeating Characters
Longest subsequence
Majority Element
Matrix Chain Multiplication
Maximize the sum of index by muliplying the element at the index
Maximum Length Chain of Pairs
Maximum Product Cutting
Maximum Product Subset of an Array
Maximum Size Subset with Given Sum
Maximum Subarray 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 subsequence sum
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 Partition
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
Minimum number of Coins
Moser-de Bruijn Sequence
N Queen Problem
Newman-Conway Sequence
Newman-Shanks-Williams prime
Nth Catalan Number
Number of N Digit(s) Stepping Numbers
Number of Zeros
Optimal Strategy for a Game
Painting Fence Algorithm
Palindrome Partitioning
Perfect Sum Problem
Permutation Coefficient
Power Set in Lexicographic order
Rat in A Maze
Remove Invalid Parentheses
Rencontres Number
Reservoir Sampling
Rotation Count in Rotated Sorted Array
Size of The Subarray With Maximum Sum
Smallest Sum Contiguous Subarray
Split A Number into Maximum Composite Number
Stolen Values Problem
String Matching Algorithms
Subset Sum Problem
Sudoku
Sum of All Substrings of A String Representing A Number
Sum of Average of All Subsets
Super Ugly Number
Temple Offerings
The Celebrity Problem
The Knight’s Tour Problem
Tile Stacking Problem
Tiling Problem
Tiling with Dominoes
Ugly Numbers
Unbounded Knapsack
Weighted Job Scheduling
Wildcard Pattern Matching
.gitignore
LICENSE
readMe.md

Longest Common Increasing Subsequence

Shoaib Rayeen

Longest Common Increasing Subsequence - Program

Feb 7, 2019

efb0e37 · Feb 7, 2019

Name		Name	Last commit message	Last commit date
parent directory ..
code_1.cpp		code_1.cpp	using DP	Feb 7, 2019
readMe.md		readMe.md	Longest Common Increasing Subsequence - Program	Feb 7, 2019

readMe.md

Given two arrays, find length of the longest common increasing subsequence [LCIS] and print one of such sequences (multiple sequences may exist)

arr1[] = {3, 4, 9, 1} and
arr2[] = {5, 3, 8, 9, 10, 2, 1}

Our answer would be {3, 9} as this is the longest common subsequence which is increasing also.