C Programming – Longest Common Subsequence – Dynamic Programming – LCS problem has optimal substructure property as main problem can be solved using solution.
Algorithm
C programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x – Searching and sorting.- Given a sorted array. find a pair in array whose sum is closest to x.
C++ Programming-Find common elements in three sorted arrays – Searching and sorting – A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array.
JAVA Programming-Find common elements in three sorted arrays – Searching and sorting – A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array.
PYTHON Programming-Find common elements in three sorted arrays – Searching and sorting – A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array.
Python Programming – Longest Increasing Subsequence – Dynamic Programming – LIS problem is to find the length of the longest subsequence of a given sequence
Java Programming – Longest Increasing Subsequence – Dynamic Programming – The LIS problem is to find the length of the longest subsequence of a given sequence.
C++ Programming – Longest Increasing Subsequence – Dynamic Programming The LIS problem is to find the length of the longest subsequence of a given sequence
C Programming – Longest Increasing Subsequence – Dynamic Programming – The LIS problem is to find the length of the longest subsequence of a given sequence.
Find the closest pair from two sorted arrays – Searching and Sorting – Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array.