Web Technologies37.4K+ articles

DSA22.8K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Dynamic Programming1.6K+ articles

Matrix1.3K+ articles

Recursion1.0K+ articles

Combinatorial707+ articles

Given three strings s1, s2 and s3. The task is to compute the Longest Common Subsequence of the string s1 and s2, such that it does not contain s3 as a substring. If there...read more

Strings

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given two strings S and T, and an empty string Z, the task is to print the minimum operations required to make string Z equal to T by appending any subsequence of S at the...read more

Strings

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Precomputation

Given two integers n and m, the task is to count the number of pairs of arrays (a, b) where both arrays have a length of m, contain integers between 1 and n (inclusive), a...read more

Competitive Programming

Picked

Geeks Premier League

DSA

Arrays

combinatorics

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given an array arr[] of size N, in one operation you can increase arr[i] by 1 if arr[i] = arr[i+1]. The task is to find the maximum value of the array if you can perform t...read more

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given 2 integers N and M, find the number of ways to arrange N integers in a circle such that every integer is in the range 0 to M-1, and no two adjacent integers are same...read more

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given an array arr[] of size N, you can perform the following operation on the array any number of times: If arr[i]=0, we can replace it with any integer. Your task is to ...read more

Competitive Programming

Picked

Geeks Premier League

DSA

prefix-sum

Algorithms-Dynamic Programming

Map

Geeks Premier League 2023

Given two integers n and m, where n represents delivery drivers and m represents the number of packages, Additionally, their position are also given in drivers[][] and pac...read more

Bit Magic

Geeks Premier League

DSA

Arrays

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given a string s1 and an empty string s2, you have to transform the empty string s2 to given string s1 using the given moves. In one move, you can create a sequence of ide...read more

Strings

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Two Players A and B are playing a game using a non-empty string S of length N having lowercase English Alphabets. The length of string S is even. Each player also has a st...read more

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Geeks Premier League 2023

Given a 2D array maze[][] of size M x N, one ball is dropped in each column. The maze is open on the top and bottom sides. Each cell in the box has a diagonal wall spannin...read more

Dynamic Programming

Matrix

Picked

DSA

Algorithms-Dynamic Programming

Given a binary string S of length N. Two players 'A' and 'B' are playing a game and at each alternate turn, the player converts two consecutive 1s to 0s. The game ends whe...read more

Strings

DSA

Algorithms-Dynamic Programming

Algorithms-Backtracking

Given an M * N matrix matrix[][], where each cell is either an obstacle '#', a coin 'C', or empty '0', the task is to choose one empty cell optimally to maximize the coins...read more

Dynamic Programming

Matrix

DSA

Algorithms-Dynamic Programming

Given an array workers[] and bikes[], which represents position of workers and bikes on a 2D plane, the task is to assign each worker to a bike based on the shortest Manha...read more

Bit Magic

Dynamic Programming

Picked

DSA

Google

Algorithms-Dynamic Programming

Given a string currentState that contains only '+' and '-'. You and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longe...read more

Strings

Picked

DSA

Google

Algorithms-Dynamic Programming

Given an array called arr[] and another array queries[]. You can perform an operation on arr at most once, replacing it with a subsequence of itself. Then, you process the...read more

Picked

DSA

Arrays

Amazon

Binary Search

Algorithms-Dynamic Programming

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy PolicyGot It !