Non-crossing lines to connect points in a circle
Consider a circle with n points on circumference of it where n is even. Count number of ways we can connect these points such that… Read More »
Category Archives: Dynamic Programming
Count digit groupings of a number with given constraints
We are given a string consisting of digits, we may group these digits into sub-groups (but maintaining their original order). The task is to count… Read More »
Minimum cost to fill given weight in a bag
You are given a bag of size W kg and you are provided costs of packets different weights of oranges in array cost[] where cost[i]… Read More »
OLA Interview Experience | Set 10 ( For DS)
1. Abut my DS related work. Why change? IsBST() Kadane algo with start and end indices. 2. What is SVM? Given a hard disk with… Read More »
A Space Optimized DP solution for 0-1 Knapsack Problem
Given the weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the… Read More »
Find number of times a string occurs as a subsequence in given string
Given two strings, find the number of times the second string occurs in the first string, whether continuous or discontinuous. Examples: Input: string a =… Read More »
Minimum Cost To Make Two Strings Identical
Given two strings X and Y, and two values costX and costY. We need to find minimum cost required to make the given two strings… Read More »
Find all combinations of k-bit numbers with n bits set where 1 <= n <= k in sorted order
Given a number k, find all the possible combinations of k-bit numbers with n-bits set where 1 <= n <= k. The solution should print… Read More »
Longest Geometric Progression
Given a set of numbers, find the Length of the Longest Geometrix Progression (LLGP) in it. The common ratio of GP must be an integer.… Read More »
Directi Interview | Set 12 (On-Campus)
Recently DirectI visited our campus for placements for three profiles – 1. Platform Engineer 2. Applications Engineer 3. Operations Engineer This process is for the… Read More »
Weighted Job Scheduling | Set 2 (Using LIS)
Given N jobs where every job is represented by following three elements of it. 1. Start Time 2. Finish Time 3. Profit or Value Associated… Read More »
Print Maximum Length Chain of Pairs
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. A pair (c, d) can… Read More »
Find Jobs involved in Weighted Job Scheduling
Given N jobs where every job is represented by following three elements of it. 1. Start Time 2. Finish Time 3. Profit or Value Associated… Read More »
Printing Longest Bitonic Subsequence
The Longest Bitonic Subsequence problem is to find the longest subsequence of a given sequence such that it is first increasing and then decreasing. A… Read More »
Printing Maximum Sum Increasing Subsequence
The Maximum Sum Increasing Subsequence problem is to find the maximum sum subsequence of a given sequence such that all elements of the subsequence are… Read More »
