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.
C++ Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a given complex problem .
Network Layer | Ipv4 Datagram Fragmentation and Delays – Network Layer – Different Networks may have different maximum transmission unit (MTU),
Python Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a complex problem
C programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.
Sort an array in wave form – Searching and sorting – A Simple Solution is to use sorting. First sort the input array, then swap all adjacent elements.
Java Programming Overlapping Subproblems Property – Dynamic Programming – Dynamic Programming is an algorithmic paradigm that solves a given complex problem
Optimal Substructure Property – Dynamic Programming – A problem has Optimal Substructure Property if optimal solution of the given problem can be obtained
C++ programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.