You are given a 0-indexed array of positive integers nums and a positive integer limit. In one operation, you can choose any two indices i and j and swap nums[i] and nums[j] if |nums[i] – nums[j]| <= limit. […]
There is a directed graph of n nodes with each node labeled from 0 to n – 1. The graph is represented by a 0-indexed 2D integer
You are given the head of a singly linked list. Your task is to determine if the linked list contains a loop. A
You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on
You are given a special linked list with n nodes where each node has two pointers a next pointer that points to the next
Given the head of two singly linked lists num1 and num2 representing two non-negative integers. The task is to return the head of the linked list
You are given an integer matrix isWater of size m x n that represents a map of land and water cells. If isWater[i][j] == 0, cell (i, j) is a land cell. If isWater[i][j]
Given the head a linked list, the task is to reverse every k node in the linked list. If the number of nodes is not a
You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (r, c) on the matrix. Two robots
Given the head of two sorted linked lists consisting of nodes respectively. The task is to merge both lists and return the head of the sorted merged list. Examples:
You are given a 0-indexed integer array arr, and an m x n integer matrix mat. arr and mat both contain all the integers in the range [1, m * n]. Go through each
Given the head of a singly linked list, your task is to left rotate the linked list k times. Examples: Input: head = 10 -> 20
