Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Mathematical5.1K+ articles

Amazon1.9K+ articles

Searching1.0K+ articles

Tree909+ articles

Matrix743+ articles

Graph560+ articles

DFS359+ articles

Queue225+ articles

BFS

228+ posts

Jump Game III Problem

Last Updated: 23 July 2025

Given an array arr[] of non-negative integers size N, the task is to start from index X and check if we can reach any index with value 0. For any index i, we can jump to i...read more

Dynamic Programming

CSES Solutions - Swap Game

Last Updated: 23 July 2025

You are given a 3X3 grid containing the numbers 1,2...9. Your task is to perform a sequence of moves so that the grid will look like this:1 2 34 5 67 8 9On each move, you...read more

Competitive Programming

CSES Solutions - Letter Pair Move Game

Last Updated: 19 May 2024

There are 2n boxes in a line. Two adjacent boxes are empty, and all other boxes have a letter "A" or "B". Both letters appear in exactly n-1 boxes.Your task is to move the...read more

Competitive Programming

Time and Space Complexity of DFS and BFS Algorithm

Last Updated: 23 July 2025

The time complexity of both Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms is O(V + E), where V is the number of vertices and E is the number of edges ...read more

Analysis of Algorithms

Data Structures and Algorithms-QnA

Shortest Path to Get Food in Matrix

Last Updated: 18 April 2024

Given a matrix grid[][], where '*' represents your location, '#' represents food cells, 'O' represents free space, 'X' represents obstacles. The task is to find the shorte...read more

Time and Space Complexity of Breadth First Search (BFS)

Last Updated: 23 July 2025

The Breadth First Search (BFS) algorithm is used to traverse a graph. It starts at a node of the graph and visits all nodes at the current depth level before moving on to ...read more

Minimum cost to reach the last cell of a grid with directions

Last Updated: 23 July 2025

Given a 2D matrix grid[][] of size M X N, where each cell of the grid has a character denoting the next cell we should visit we are at the current cell. The character at a...read more

article_image

Geeks Premier League 2023

Minimum of Maximum Distance to Colored Vertices

Last Updated: 20 March 2024

Given a tree of N vertices, where a vertex can be colored or uncolored, the task is to determine for each vertex the maximum distance to any of the colored vertices. The t...read more

Geeks Premier League 2023

Longest mutation sequence

Last Updated: 23 July 2025

Given a list of conversion tuples Arr[], such that string Arr[i][0] gets converted to string Arr[i][1]. A character is considered good if it has one-to-one mapping to some...read more

Algorithms-InsertionSort

Analytics Quotient

TCS-coding-questions

Geeks Premier League 2023

Minimize steps for Knight to collect maximum points (Knight in Geekland)

Last Updated: 07 February 2024

In Geekland, a knight is positioned at coordinates (start_x, start_y) within an N x M matrix. Each cell in the matrix contains a certain number of points. The knight has a...read more

Dynamic Programming

Geeks Premier League

Algorithms-Dynamic Programming

Geeks Premier League 2023

Two Rats in a Maze

Last Updated: 12 January 2024

Given a 2D matrix maze[][], where some cells are blocked, some cells are locked (which the rats can unlock) and some cells are vacant. Given the initial position of two ra...read more

Geeks Premier League 2023

Minimum jumps to move outside the matrix

Last Updated: 22 January 2024

Given a grid of size NXN, some of the cells are vacant and some are blocked. We can move to any horizontally or vertically adjacent cell if the cell is vacant. Also, we ca...read more

QA - Placement Quizzes-Data Interpretation

Geeks Premier League 2023

Minimize Set Cost

Last Updated: 28 January 2024

Given a string s of size n. In one move you can take any subsequence of the given string and add it to the set S. The set S can't contain duplicates. The move costs n−|t|,...read more

Geeks Premier League 2023

Count of Reachable cells in Grid within given Left-Right moves

Last Updated: 23 July 2025

Given a grid of size N X M in which some cells are empty, and some have obstacles, the task is to find how many cells (including the starting cell) are reachable from cell...read more

article_image

Geeks Premier League 2023

Shortest path between two cities without running out of fuel

Last Updated: 23 July 2025

Given a country with N cities connected by M bi-directional roads given in the form of 2D array roads[][], where P cities have fuel stations and (N - P) cities do not. The...read more

article_image

Geeks Premier League

Geeks Premier League 2023

...