leetcode-potd

A company is organizing a meeting and has a list of n employees, waiting to be invited. They have arranged for a […]

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 a map of a server center, represented as a m * n integer matrix grid, where 1 means that on

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]

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

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 an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water

Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit

A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n. Specifically, for each index i in the range [0,

You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers

Given two positive integers num1 and num2, find the positive integer x such that: x has the same number of set bits as num2, and The value x