## Find the maximum number of composite summands of a number

Given an integer N(1<=N<=10^9). The task is to represent N as a sum of the maximum possible number of composite summands and print this maximum… Read More »

- Understanding The Coin Change Problem With Dynamic Programming
- Burst Balloon to maximize coins
- Matrix Chain Multiplication (A O(N^2) Solution)
- Walmart Labs Interview Experience ( On Campus FT + 6 month Internship )
- Check if a word exists in a grid or not
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Sum of XOR of all subarrays
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Count the number of ways to traverse a Matrix
- Longest subsequence such that adjacent elements have at least one common digit
- Make Binary Search Tree
- Level Ancestor Problem
- Treasure and Cities
- Number of ways to partition a string into two balanced subsequences
- Count common subsequence in two strings
- Memoization using decorators in Python
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of increasing subsequences
- Minimum distance to the end of a grid from source
- Jump Pointer Algorithm
- Minimum cost to buy N kilograms of sweet for M persons
- Printing Matrix Chain Multiplication (A Space Optimized Solution)
- Minimum steps required to convert X to Y where a binary matrix represents the possible conversions
- Minimum cost to reach a point N from 0 with two different operations allowed
- Samsung Interview Experience through Co-cubes (2019)
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Ways to write N as sum of two or more positive integers | Set-2
- Count of Numbers in Range where first digit is equal to last digit of the number
- Maximum subarray sum by flipping signs of at most K array elements
- A variation of Rat in a Maze : multiple steps or jumps allowed

Given an integer N(1<=N<=10^9). The task is to represent N as a sum of the maximum possible number of composite summands and print this maximum… Read More »

Given three integers R, B and W which denote the number of runs, balls and wickets. One can score 0, 1, 2, 3, 6 or… Read More »

Given an array arr[] of N integers and an integer K, one can move from an index i to any other j if j ≤… Read More »

Given three arrays A[], B[] and C[] of N integers. We can choose N elements from these array such that for every index i only… Read More »

Given a string str. You are allowed to delete only some contiguous characters if all the characters are same in a single operation. The task… Read More »

Given two integers N and K, the task is to count the number of ways to make a binary string of length N such that… Read More »

Given an array arr[] and an integer K, the task is to find out the minimum product of a subsequence where adjacent elements of the… Read More »

Given n, find count of n digit Stepping numbers. A number is called stepping number if all adjacent digits have an absolute difference of 1.… Read More »

Given an array arr[] of N integers and an integer X. Element arr[i] in array denotes the cost to use 2i. The task is to… Read More »

Given a directed graph G with N vertices and M edges. The task is to find the length of the longest directed path in Graph.… Read More »

Given a range [l, r], the task is to find the sum of all the even factors of the numbers from the given range. Examples:… Read More »

Given height and width of N rectangles. The task is to find the size of the largest subset such that no pair of rectangles fit… Read More »

Given that there are p people in a party. Each person can either join dance as a single individual or as a pair with any… Read More »

Given three numbers(x, y and z) which denote the number of people in the first group, the second group, and third group. We can form… Read More »

Given an array arr[] of N integers and an integer K. The task is to find the maximum sub-array sum by flipping signs of at… Read More »