Java Archives - Page 2 of 24

Solved! Leetcode 1700. Number of Students Unable to Eat Lunch

Apr

13

2024

Table of ContentsDescription Number of Students Unable to Eat LunchExample 1Example 2ConstraintsSolutionTime ComplexitySpace Complexity Description Number of Students Unable to Eat Lunch The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches ...

Solved! Leetcode 950. Reveal Cards In Increasing Order

Apr

13

2024

Table of ContentsDescription Reveal Cards In Increasing OrderExample 1Example 2ConstraintsSolutionTime ComplexitySpace Complexity Description Reveal Cards In Increasing Order You are given an integer array deck. There is a deck of cards where every card has a unique integer. The integer on the ith card is deck[i]. You can order the deck in any order you want. Initially, all the ...

Solved! Leetcode 1669. Merge In Between Linked Lists

Mar

21

2024

Table of ContentsMerge In Between Linked ListsDescriptionExample 1Example 2ConstraintsApproachSolution Merge In Between Linked Lists Description You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1‘s nodes from the ath node to the bth node, and put list2 in their place. The blue edges and nodes in the following figure indicate the result: Build the result list and return its head. Example 1 <strong>Input:</strong> ...

Solved! Leetcode 935. Knight Dialer

Nov

27

2023

source: https://leetcode.com/problems/knight-dialer/ 935. Knight Dialer Table of Contents935. Knight DialerDescriptionExample 1Example 2Example 3ConstraintsSolution Description The chess knight has a unique movement, it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an L). The possible movements of chess knight are shown ...

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 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 ...