## 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 »

- Check if a word exists in a grid or not
- Sum of XOR of all subarrays
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Longest subsequence such that adjacent elements have at least one common digit
- Make Binary Search Tree
- Samsung Interview Experience through Co-cubes (2019)
- Minimum distance to the end of a grid from source
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Double Knapsack | Dynamic Programming
- Optimal Strategy for a Game | Set 2
- Minimum steps required to convert X to Y where a binary matrix represents the possible conversions
- Longest path in a directed Acyclic graph | Dynamic Programming
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Maximum subarray sum by flipping signs of at most K array elements
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Count of Numbers in Range where first digit is equal to last digit of the number
- Bellman Ford Algorithm (Simple Implementation)
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Find sub-matrix with the given sum
- Minimum steps to delete a string by deleting substring comprising of same characters
- Minimum cost to reach end of array array when a maximum jump of K index is allowed
- Count of sub-sets of size n with total element sum divisible by 3
- Count number of ways to reach a given score in a Matrix
- Sum of bitwise AND of all submatrices
- Maximum sum such that no two elements are adjacent | Set 2
- DP on Trees | Set-3 ( Diameter of N-ary Tree )
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Find the sum of the diagonal elements of the given N X N spiral matrix
- Number of Binary Strings of length N with K adjacent Set Bits

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »