2290. Minimum Obstacle Removal to Reach Corner
You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values: 0 represents an empty cell, 1 represents an obstacle that […]
Implement Atoi
Given a string s, the objective is to convert it into integer format without utilizing any built-in functions. Refer the
3243. Shortest Distance After Road Addition Queries I
You are given an integer n and a 2D integer array queries. There are n cities numbered from 0 to n – 1. Initially, there is a unidirectional road from
Smallest Positive Missing Number
You are given an integer array arr[]. Your task is to find the smallest positive number missing from the array. Note: Positive number
2924. Find Champion II
There are n teams numbered from 0 to n – 1 in a tournament; each team is also a node in a DAG. You are given the
Max Circular Subarray Sum
Given an array of integers arr[] in a circular fashion. Find the maximum subarray sum that we can get if we assume the array to be circular.
773. Sliding Puzzle
On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and a
Maximum Product Subarray
Given an array arr[] that contains positive and negative integers (may contain 0 as well). Find the maximum product that we can get in
1975. Maximum Matrix Sum
You are given an n x n integer matrix. You can do the following operation any number of times: Choose any two adjacent elements of matrix and multiply each of them
1072. Flip Columns For Maximum Number of Equal Rows
You are given an m x n binary matrix matrix. You can choose any number of columns in the matrix and flip every
Stock Buy and Sell – Max one Transaction Allowed
Given an array prices[] of length n, representing the prices of the stocks on different days. The task is to find the
2257. Count Unguarded Cells in the Grid
You are given two integers m and n representing a 0-indexed m x n grid. You are also given two 2D integer arrays guards and walls where guards[i] = [rowi, coli] and walls[j] =