java Archives - Page 3 of 23

Solved! Leetcode 1980. Find Unique Binary String

Nov

17

2023

Table of ContentsFind Unique Binary StringSourceDescriptionExample 1Example 2Example 3ConstraintsSolution Find Unique Binary String Source https://leetcode.com/problems/find-unique-binary-string/ Description Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. If there are multiple answers, you may return any of them. ...

Solved! Leetcode 2305. Fair Distribution of Cookies

Nov

17

2023

Table of ContentsFair Distribution of CookiesSourceDescriptionExample 1Example 2ConstraintsSolution Fair Distribution of Cookies Source https://leetcode.com/problems/fair-distribution-of-cookies/description/ Description You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag. You are also given an integer k that denotes the number of children to distribute all the bags of cookies to. All ...

Solved! Leetcode 573. Squirrel Simulation

Nov

9

2023

source: https://leetcode.com/problems/squirrel-simulation/ Table of ContentsSquirrel SimulationDescriptionExample 1Example 2ConstraintsSolution Squirrel Simulation Description You are given two integers height and width representing a garden of size height x width. You are also given: an array tree where tree = [treer, treec] is the position of the tree in the garden, an array squirrel where squirrel = [squirrelr, ...

Solved! Leetcode 1502. Can Make Arithmetic Progression From Sequence

Nov

9

2023

source: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/ Table of ContentsCan Make Arithmetic Progression From SequenceDescriptionExample 1Example 2ConstraintsSolution Can Make Arithmetic Progression From Sequence Description A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same. Given an array of numbers arr, return true if the array can be rearranged to form ...

Solved! Leetcode 1057. Campus Bikes

Nov

7

2023

source: https://leetcode.com/problems/campus-bikes/description/ Campus Bikes On a campus represented on the X-Y plane, there are n workers and m bikes, with n <= m. You are given an array workers of length n where workers[i] = [xi, yi] is the position of the ith worker. You are also given an array bikes of length m where ...

Solved! Leetcode 983. Minimum Cost For Tickets

Nov

6

2023

source: https://leetcode.com/problems/minimum-cost-for-tickets/description/ Table of ContentsMinimum Cost For TicketsExample 1Example 2ConstraintsSolution Minimum Cost For Tickets You have planned some train traveling one year in advance. The days of the year you will travel are given as an integer array days. Each day is an integer from 1 to 365. Train tickets are sold in three different ...

Solved! Leetcode 1319. Number of Operations to Make Network Connected

Sep

20

2023

source: https://leetcode.com/problems/number-of-operations-to-make-network-connected/description/ Table of ContentsNumber of Operations to Make Network ConnectedDescriptionExample 1:Example 2:Example 3:Constraints:Solution Number of Operations to Make Network Connected Description There are n computers numbered from 0 to n – 1 connected by ethernet cables connections forming a network where connections[i] = [ai, bi] represents a connection between computers ai and bi. Any ...

Solved! Leetcode 63. Unique Paths II

Aug

13

2023

source: https://leetcode.com/problems/unique-paths-ii/ Unique Paths II Table of ContentsUnique Paths IIDescriptionExample 1:Example 2:Constraints:Solution Description You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m – 1][n – 1]). The robot can only move ...

Solved! Leetcode 77. Combinations

Aug

13

2023

source: https://leetcode.com/problems/combinations/description/ Combinations Table of ContentsCombinationsDescriptionExample 1:Example 2:Constraints:Solution Description Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n].You may return the answer in any order. Example 1: Input: n = 4, k = 2Output: [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]Explanation: There are 4 choose 2 = 6 total combinations. Note ...

Solved! Leetcode 2616. Minimize the Maximum Difference of Pairs

Aug

10

2023

source: https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/ Table of ContentsMinimize the Maximum Difference of PairsExample 1:Example 2:Constraints:Solution Minimize the Maximum Difference of Pairs You are given a 0-indexed integer array nums and an integer p. Find p pairs of indices of nums to minimize the maximum difference amongst all the pairs. Also, ensure no index appears more than once amongst ...