2097. Valid Arrangement of Pairs
You are given a 0-indexed 2D integer array pairs where pairs[i] = [starti, endi]. An arrangement of pairs is valid if for every index i where 1 <= i < pairs.length, we […]
2577. Minimum Time to Visit a Cell In a Grid
You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum time required to be able to visit the cell (row, col), which means
Add Binary Strings
Given two binary strings s1 and s2 consisting of only 0s and 1s. Find the resultant string after adding the two Binary Strings.Note: The input
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