LeetCode with JavaScript: give your brain a workout

All Solutions

1. № 1. Two Sum
2. № 2. Add Two Numbers
3. № 3. Longest Substring Without Repeating Characters
4. № 4. Median of Two Sorted Arrays
5. № 5. Longest Palindromic Substring
6. № 6. Zigzag Conversion
7. № 7. Reverse Integer
8. № 8. String to Integer (atoi)
9. № 9. Palindrome Number
10. № 11. Container With Most Water
11. № 12. Integer to Roman
12. № 13. Roman to Integer
13. № 14. Longest Common Prefix
14. № 15. 3Sum
15. № 16. 3Sum Closest
16. № 17. Letter Combinations of a Phone Number
17. № 18. 4Sum
18. № 19. Remove Nth Node From End of List
19. № 20. Valid Parentheses
20. № 21. Merge Two Sorted Lists
21. № 22. Generate Parentheses
22. № 23. Merge k Sorted Lists
23. № 24. Swap Nodes in Pairs
24. № 25. Reverse Nodes in k-Group
25. № 26. Remove Duplicates from Sorted Array
26. № 27. Remove Element
27. № 28. Find the Index of the First Occurrence in a String
28. № 29. Divide Two Integers
29. № 30. Substring with Concatenation of All Words
30. № 31. Next Permutation
31. № 32. Longest Valid Parentheses
32. № 33. Search in Rotated Sorted Array
33. № 34. Find First and Last Position of Element in Sorted Array
34. № 35. Search Insert Position
35. № 36. Valid Sudoku
36. № 37. Sudoku Solver
37. № 38. Count and Say
38. № 39. Combination Sum
39. № 40. Combination Sum II
40. № 41. First Missing Positive
41. № 42. Trapping Rain Water
42. № 43. Multiply Strings
43. № 44. Wildcard Matching
44. № 45. Jump Game II
45. № 46. Permutations
46. № 47. Permutations II
47. № 48. Rotate Image
48. № 49. Group Anagrams
49. № 50. Pow
50. № 51. N-Queens
51. № 52. N-Queens II
52. № 53. Maximum Subarray
53. № 54. Spiral Matrix
54. № 55. Jump Game
55. № 56. Merge Intervals
56. № 57. Insert Interval
57. № 58. Length of Last Word
58. № 59. Spiral Matrix II
59. № 60. Permutation Sequence
60. № 61. Rotate List
61. № 62. Unique Paths
62. № 63. Unique Paths II
63. № 64. Minimum Path Sum
64. № 65. Valid Number
65. № 66. Plus One
66. № 67. Add Binary
67. № 68. Text Justification
68. № 69. Sqrt(x)
69. № 70. Climbing Stairs
70. № 71. Simplify Path
71. № 72. Edit Distance
72. № 73. Set Matrix Zeroes
73. № 74. Search a 2D Matrix
74. № 75. Sort Colors
75. № 76. Minimum Window Substring
76. № 77. Combinations
77. № 78. Subsets
78. № 79. Word Search
79. № 80. Remove Duplicates from Sorted Array II
80. № 81. Search in Rotated Sorted Array II
81. № 82. Remove Duplicates from Sorted List II
82. № 83. Remove Duplicates from Sorted List
83. № 84. Largest Rectangle in Histogram
84. № 85. Maximal Rectangle
85. № 86. Partition List
86. № 87. Scramble String
87. № 88. Merge Sorted Array
88. № 89. Gray Code
89. № 90. Subsets II
90. № 91. Decode Ways
91. № 92. Reverse Linked List II
92. № 93. Restore IP Addresses
93. № 94. Binary Tree Inorder Traversal
94. № 95. Unique Binary Search Trees II
95. № 96. Unique Binary Search Trees
96. № 97. Interleaving String
97. № 98. Validate Binary Search Tree
98. № 99. Recover Binary Search Tree
99. № 100. Same Tree
100. № 101. Symmetric Tree
101. № 102. Binary Tree Level Order Traversal
102. № 103. Binary Tree Zigzag Level Order Traversal
103. № 104. Maximum Depth of Binary Tree
104. № 105. Construct Binary Tree from Preorder and Inorder Traversal
105. № 106. Construct Binary Tree from Inorder and Postorder Traversal
106. № 107. Binary Tree Level Order Traversal II
107. № 108. Convert Sorted Array to Binary Search Tree
108. № 109. Convert Sorted List to Binary Search Tree
109. № 110. Balanced Binary Tree
110. № 111. Minimum Depth of Binary Tree
111. № 112. Path Sum
112. № 113. Path Sum II
113. № 114. Flatten Binary Tree to Linked List
114. № 115. Distinct Subsequences
115. № 116. Populating Next Right Pointers in Each Node
116. № 117. Populating Next Right Pointers in Each Node II
117. № 118. Pascal's Triangle
118. № 119. Pascal's Triangle II
119. № 120. Triangle
120. № 121. Best Time to Buy and Sell Stock
121. № 122. Best Time to Buy and Sell Stock II
122. № 123. Best Time to Buy and Sell Stock III
123. № 124. Binary Tree Maximum Path Sum
124. № 125. Valid Palindrome
125. № 126. Word Ladder II
126. № 127. Word Ladder II
127. № 128. Longest Consecutive Sequence
128. № 129. Sum Root to Leaf Numbers
129. № 130. Surrounded Regions
130. № 131. Palindrome Partitioning
131. № 132. Palindrome Partitioning II
132. № 133. Clone Graph
133. № 134. Gas Station
134. № 135. Candy
135. № 136. Single Number
136. № 137. Single Number II
137. № 138. Copy List with Random Pointer
138. № 139. Word Break
139. № 140. Word Break II
140. № 141. Linked List Cycle
141. № 142. Linked List Cycle II
142. № 143. Reorder List
143. № 144. Binary Tree Preorder Traversal
144. № 145. Binary Tree Postorder Traversal
145. № 146. LRU Cache
146. № 147. Insertion Sort List
147. № 148. Sort List
148. № 149. Max Points on a Line
149. № 150. Evaluate Reverse Polish Notation
150. № 151. Reverse Words in a String
151. № 152. Maximum Product Subarray
152. № 153. Find Minimum in Rotated Sorted Array
153. № 154. Find Minimum in Rotated Sorted Array II
154. № 155. Min Stack
155. № 160. Intersection of Two Linked Lists
156. № 162. Find Peak Element
157. № 164. Maximum Gap
158. № 165. Compare Version Numbers
159. № 166. Fraction to Recurring Decimal
160. № 167. Two Sum II - Input Array Is Sorted
161. № 168. Excel Sheet Column Title
162. № 169. Majority Element
163. № 171. Excel Sheet Column Number
164. № 172. Factorial Trailing Zeroes
165. № 173. Binary Search Tree Iterator
166. № 174. Dungeon Game
167. № 176. Second Highest Salary
168. № 177. Nth Highest Salary
169. № 178. Rank Scores
170. № 179. Largest Number
171. № 187. Repeated DNA Sequences
172. № 190. Reverse Bits
173. № 191. Number of 1 Bits
174. № 198. House Robber
175. № 199. Binary Tree Right Side View
176. № 200. Number of Islands
177. № 201. Bitwise AND of Numbers Range
178. № 205. Isomorphic Strings
179. № 206. Reverse Linked List
180. № 208. Implement Trie (Prefix Tree)
181. № 211. Design Add and Search Words Data Structure
182. № 214. Shortest Palindrome
183. № 215. Kth Largest Element in an Array
184. № 217. Contains Duplicate
185. № 225. Implement Stack using Queues
186. № 226. Invert Binary Tree
187. № 228. Summary Ranges
188. № 229. Majority Element II
189. № 231. Power of Two
190. № 232. Implement Queue using Stacks
191. № 234. Palindrome Linked List
192. № 235. Lowest Common Ancestor of a Binary Search Tree
193. № 237. Delete Node in a Linked List
194. № 238. Product of Array Except Self
195. № 239. Sliding Window Maximum
196. № 241. Different Ways to Add Parentheses
197. № 242. Valid Anagram
198. № 258. Add Digits
199. № 260. Single Number III
200. № 264. Ugly Number II
201. № 268. Missing Number
202. № 273. Integer to English Words
203. № 278. First Bad Version
204. № 279. Perfect Squares
205. № 287. Find the Duplicate Number
206. № 299. Bulls and Cows
207. № 300. Longest Increasing Subsequence
208. № 310. Minimum Height Trees
209. № 316. Remove Duplicate Letters
210. № 319. Bulb Switcher
211. № 326. Power of Three
212. № 330. Patching Array
213. № 341. Flatten Nested List Iterator
214. № 342. Power of Four
215. № 343. Integer Break
216. № 344. Reverse String
217. № 347. Top K Frequent Elements
218. № 349. Intersection of Two Arrays
219. № 350. Intersection of Two Arrays II
220. № 368. Largest Divisible Subset
221. № 373. Find K Pairs with Smallest Sums
222. № 380. Insert Delete GetRandom O(1)
223. № 382. Linked List Random Node
224. № 383. Ransom Note
225. № 386. Lexicographical Numbers
226. № 387. First Unique Character in a String
227. № 392. Is Subsequence
228. № 394. Decode String
229. № 396. Rotate Function
230. № 399. Evaluate Division
231. № 401. Binary Watch
232. № 402. Remove K Digits
233. № 403. Frog Jump
234. № 404. Sum of Left Leaves
235. № 407. Trapping Rain Water II
236. № 409. Longest Palindrome
237. № 416. Partition Equal Subset Sum
238. № 417. Pacific Atlantic Water Flow
239. № 424. Longest Repeating Character Replacement
240. № 432. All O`one Data Structure
241. № 435. Non-overlapping Intervals
242. № 438. Find All Anagrams in a String
243. № 440. K-th Smallest in Lexicographical Order
244. № 442. Find All Duplicates in an Array
245. № 443. String Compression
246. № 445. Add Two Numbers II
247. № 446. Arithmetic Slices II - Subsequence
248. № 451. Sort Characters By Frequency
249. № 452. Minimum Number of Arrows to Burst Balloons
250. № 455. Assign Cookies
251. № 458. Poor Pigs
252. № 459. Repeated Substring Pattern
253. № 463. Island Perimeter
254. № 474. Ones and Zeroes
255. № 476. Number Complement
256. № 486. Predict the Winner
257. № 494. Target Sum
258. № 498. Diagonal Traverse
259. № 501. Find Mode in Binary Search Tree
260. № 502. IPO
261. № 506. Relative Ranks
262. № 509. Fibonacci Number
263. № 513. Find Bottom Left Tree Value
264. № 514. Freedom Trail
265. № 515. Find Largest Value in Each Tree Row
266. № 516. Longest Palindromic Subsequence
267. № 518. Coin Change II
268. № 521. Longest Uncommon Subsequence I
269. № 523. Continuous Subarray Sum
270. № 525. Contiguous Array
271. № 530. Minimum Absolute Difference in BST
272. № 538. Convert BST to Greater Tree
273. № 539. Minimum Time Difference
274. № 540. Single Element in a Sorted Array
275. № 543. Diameter of Binary Tree
276. № 547. Number of Provinces
277. № 552. Student Attendance Record II
278. № 557. Reverse Words in a String III
279. № 560. Subarray Sum Equals K
280. № 564. Find the Closest Palindrome
281. № 567. Permutation in String
282. № 572. Subtree of Another Tree
283. № 576. Out of Boundary Paths
284. № 589. N-ary Tree Preorder Traversal
285. № 590. N-ary Tree Postorder Traversal
286. № 592. Fraction Addition and Subtraction
287. № 594. Longest Harmonious% Subsequence
288. № 605. Can Place Flowers
289. № 606. Construct String from Binary Tree
290. № 611. Valid Triangle Number
291. № 621. Task Scheduler
292. № 623. Add One Row to Tree
293. № 624. Maximum Distance in Arrays
294. № 628. Maximum Product of Three Numbers
295. № 629. K Inverse Pairs Array
296. № 632. Smallest Range Covering Elements from K Lists
297. № 633. Sum of Square Numbers
298. № 641. Design Circular Deque
299. № 645. Set Mismatch
300. № 647. Palindromic Substrings
301. № 648. Replace Words
302. № 649. Dota2 Senate
303. № 650. 2 Keys Keyboard
304. № 657. Robot Return to Origin
305. № 661. Image Smoother
306. № 664. Strange Printer
307. № 670. Maximum Swap
308. № 678. Valid Parenthesis String
309. № 679. 24 Game
310. № 684. Redundant Connection
311. № 688. Knight Probability in Chessboard
312. № 689. Maximum Sum of 3 Non-Overlapping Subarrays
313. № 692. Top K Frequent Words
314. № 693. Binary Number with Alternating Bits
315. № 696. Count Binary Substrings
316. № 703. Kth Largest Element in a Stream
317. № 704. Binary Search
318. № 705. Design HashSet
319. № 706. Design HashMap
320. № 712. Minimum ASCII Delete Sum for Two Strings
321. № 713. Subarray Product Less Than K
322. № 714. Best Time to Buy and Sell Stock with Transaction Fee
323. № 717. 1-bit and 2-bit Characters
324. № 719. Find K-th Smallest Pair Distance
325. № 724. Find Pivot Index
326. № 725. Split Linked List in Parts
327. № 726. Number of Atoms
328. № 729. My Calendar I
329. № 731. My Calendar II
330. № 733. Flood Fill
331. № 735. Asteroid Collision
332. № 739. Daily Temperatures
333. № 744. Find Smallest Letter Greater Than Target
334. № 746. Min Cost Climbing Stairs
335. № 752. Open the Lock
336. № 756. Pyramid Transition Matrix
337. № 757. Set Intersection Size At Least Two
338. № 761. Special Binary String
339. № 762. Prime Number of Set Bits in Binary Representation
340. № 763. Partition Labels
341. № 767. Reorganize String
342. № 769. Max Chunks To Make Sorted
343. № 773. Sliding Puzzle
344. № 778. Swim in Rising Water
345. № 779. K-th Symbol in Grammar
346. № 781. Rabbits in Forest
347. № 783. Minimum Distance Between BST Nodes
348. № 786. K-th Smallest Prime Fraction
349. № 787. Cheapest Flights Within K Stops
350. № 788. Rotated Digits
351. № 790. Domino and Tromino Tiling
352. № 791. Custom Sort String
353. № 796. Rotate String
354. № 799. Champagne Tower
355. № 802. Find Eventual Safe States
356. № 808. Soup Servings
357. № 812. Largest Triangle Area
358. № 815. Bus Routes
359. № 823. Binary Trees With Factors
360. № 826. Most Profit Assigning Work
361. № 827. Making A Large Island
362. № 834. Sum of Distances in Tree
363. № 835. Image Overlap
364. № 836. Rectangle Overlap
365. № 837. New 21 Game
366. № 838. Push Dominoes
367. № 840. Magic Squares In Grid
368. № 844. Backspace String Compare
369. № 846. Hand of Straights
370. № 852. Peak Index in a Mountain Array
371. № 853. Car Fleet
372. № 857. Minimum Cost to Hire K Workers
373. № 859. Buddy Strings
374. № 860. Lemonade Change
375. № 861. Score After Flipping Matrix
376. № 862. Shortest Subarray with Sum at Least K
377. № 863. All Nodes Distance K in Binary Tree
378. № 865. Smallest Subtree with all the Deepest Nodes
379. № 867. Transpose Matrix
380. № 868. Binary Gap
381. № 869. Reordered Power of 2
382. № 872. Leaf-Similar Trees
383. № 873. Length of Longest Fibonacci Subsequence
384. № 874. Walking Robot Simulation
385. № 875. Koko Eating Bananas
386. № 876. Middle of the Linked List
387. № 877. Stone Game
388. № 880. Decoded String at Index
389. № 881. Boats to Save People
390. № 884. Uncommon Words from Two Sentences
391. № 885. Spiral Matrix III
392. № 889. Construct Binary Tree from Preorder and Postorder Traversal
393. № 898. Bitwise ORs of Subarrays
394. № 904. Fruit Into Baskets
395. № 907. Sum of Subarray Minimums
396. № 909. Snakes and Ladders
397. № 912. Sort an Array
398. № 916. Word Subsets
399. № 920. Number of Music Playlists
400. № 921. Minimum Add to Make Parentheses Valid
401. № 930. Binary Subarrays With Sum
402. № 931. Minimum Falling Path Sum
403. № 934. Shortest Bridge
404. № 935. Knight Dialer
405. № 938. Range Sum of BST
406. № 940. Distinct Subsequences II
407. № 944. Delete Columns to Make Sorted
408. № 945. Minimum Increment to Make Array Unique
409. № 946. Validate Stack Sequences
410. № 947. Most Stones Removed with Same Row or Column
411. № 948. Bag of Tokens
412. № 950. Reveal Cards In Increasing Order
413. № 951. Flip Equivalent Binary Trees
414. № 955. Delete Columns to Make Sorted II
415. № 956. Tallest Billboard
416. № 958. Check Completeness of a Binary Tree
417. № 959. Regions Cut By Slashes
418. № 960. Delete Columns to Make Sorted III
419. № 961. N-Repeated Element in Size 2N Array
420. № 962. Maximum Width Ramp
421. № 966. Vowel Spellchecker
422. № 974. Subarray Sums Divisible by K
423. № 976. Largest Perimeter Triangle
424. № 977. Squares of a Sorted Array
425. № 979. Distribute Coins in Binary Tree
426. № 981. Time Based Key-Value Store
427. № 983. Minimum Cost For Tickets
428. № 988. Smallest String Starting From Leaf
429. № 989. Add to Array-Form of Integer
430. № 992. Subarrays with K Different Integers
431. № 995. Minimum Number of K Consecutive Bit Flips
432. № 997. Find the Town Judge
433. № 1002. Find Common Characters
434. № 1007. Minimum Domino Rotations For Equal Row
435. № 1009. Complement of Base 10 Integer
436. № 1014. Best Sightseeing Pair
437. № 1015. Smallest Integer Divisible by K
438. № 1018. Binary Prefix Divisible By 5
439. № 1020. Number of Enclaves
440. № 1022. Sum of Root To Leaf Binary Numbers
441. № 1026. Maximum Difference Between Node and Ancestor
442. № 1027. Longest Arithmetic Subsequence
443. № 1028. Recover a Tree From Preorder Traversal
444. № 1035. Uncrossed Lines
445. № 1038. Binary Search Tree to Greater Sum Tree
446. № 1039. Minimum Score Triangulation of Polygon
447. № 1043. Partition Array for Maximum Sum
448. № 1046. Last Stone Weight
449. № 1051. Height Checker
450. № 1052. Grumpy Bookstore Owner
451. № 1061. Lexicographically Smallest Equivalent String
452. № 1072. Flip Columns For Maximum Number of Equal Rows
453. № 1074. Number of Submatrices That Sum to Target
454. № 1079. Letter Tile Possibilities
455. № 1081. Smallest Subsequence of Distinct Characters
456. № 1091. Shortest Path in Binary Matrix
457. № 1092. Shortest Common Supersequence
458. № 1095. Find in Mountain Array
459. № 1105. Filling Bookcase Shelves
460. № 1106. Parsing A Boolean Expression
461. № 1110. Delete Nodes And Return Forest
462. № 1122. Relative Sort Array
463. № 1123. Lowest Common Ancestor of Deepest Leaves
464. № 1125. Smallest Sufficient Team
465. № 1128. Number of Equivalent Domino Pairs
466. № 1137. N-th Tribonacci Number
467. № 1140. Stone Game II
468. № 1143. Longest Common Subsequence
469. № 1146. Snapshot Array
470. № 1155. Number of Dice Rolls With Target Sum
471. № 1160. Find Words That Can Be Formed by Characters
472. № 1161. Maximum Level Sum of a Binary Tree
473. № 1171. Remove Zero Sum Consecutive Nodes from Linked List
474. № 1189. Maximum Number of Balloons
475. № 1190. Reverse Substrings Between Each Pair of Parentheses
476. № 1200. Minimum Absolute Difference
477. № 1207. Unique Number of Occurrences
478. № 1208. Get Equal Substrings Within Budget
479. № 1218. Longest Arithmetic Subsequence of Given Difference
480. № 1219. Path with Maximum Gold
481. № 1220. Count Vowels Permutation
482. № 1232. Check If It Is a Straight Line
483. № 1233. Remove Sub-Folders from the Filesystem
484. № 1235. Maximum Profit in Job Scheduling
485. № 1239. Maximum Length of a Concatenated String with Unique Characters
486. № 1248. Count Number of Nice Subarrays
487. № 1249. Minimum Remove to Make Valid Parentheses
488. № 1254. Number of Closed Islands
489. № 1255. Maximum Score Words Formed by Letters
490. № 1260. Shift 2D Grid
491. № 1261. Find Elements in a Contaminated Binary Tree
492. № 1262. Greatest Sum Divisible by Three
493. № 1266. Minimum Time Visiting All Points
494. № 1267. Count Servers that Communicate
495. № 1269. Number of Ways to Stay in the Same Place After Some Steps
496. № 1277. Count Square Submatrices with All Ones
497. № 1287. Element Appearing More Than 25% In Sorted Array
498. № 1288. Remove Covered Intervals
499. № 1289. Minimum Falling Path Sum II
500. № 1290. Convert Binary Number in a Linked List to Integer
501. № 1291. Sequential Digits
502. № 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
503. № 1295. Find Numbers with Even Number of Digits
504. № 1298. Maximum Candies You Can Get from Boxes
505. № 1301. Number of Paths with Max Score
506. № 1304. Find N Unique Integers Sum up to Zero
507. № 1306. Jump Game III
508. № 1310. XOR Queries of a Subarray
509. № 1312. Minimum Insertion Steps to Make a String Palindrome
510. № 1317. Convert Integer to the Sum of Two No-Zero Integers
511. № 1318. Minimum Flips to Make a OR b Equal to c
512. № 1320. Minimum Distance to Type a Word Using Two Fingers
513. № 1323. Maximum 69 Number
514. № 1325. Delete Leaves With a Given Value
515. № 1331. Rank Transform of an Array
516. № 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
517. № 1335. Minimum Difficulty of a Job Schedule
518. № 1339. Maximum Product of Splitted Binary Tree
519. № 1340. Jump Game V
520. № 1344. Angle Between Hands of a Clock
521. № 1345. Jump Game IV
522. № 1346. Check If N and Its Double Exist
523. № 1347. Minimum Number of Steps to Make Two Strings Anagram
524. № 1351. Count Negative Numbers in a Sorted Matrix
525. № 1352. Product of the Last K Numbers
526. № 1353. Maximum Number of Events That Can Be Attended
527. № 1356. Sort Integers by The Number of 1 Bits
528. № 1358. Number of Substrings Containing All Three Characters
529. № 1361. Validate Binary Tree Nodes
530. № 1367. Linked List in Binary Tree
531. № 1368. Minimum Cost to Make at Least One Valid Path in a Grid
532. № 1371. Find the Longest Substring Containing Vowels in Even Counts
533. № 1372. Longest ZigZag Path in a Binary Tree
534. № 1380. Lucky Numbers in a Matrix
535. № 1381. Design a Stack With Increment Operation
536. № 1382. Balance a Binary Search Tree
537. № 1386. Cinema Seat Allocation
538. № 1390. Four Divisors
539. № 1391. Check if There is a Valid Path in a Grid
540. № 1394. Find Lucky Integer in an Array
541. № 1395. Count Number of Teams
542. № 1396. Design Underground System
543. № 1399. Count Largest Group
544. № 1400. Construct K Palindrome Strings
545. № 1404. Number of Steps to Reduce a Number in Binary Representation to One
546. № 1405. Longest Happy String
547. № 1406. Stone Game III
548. № 1411. Number of Ways to Paint N × 3 Grid
549. № 1415. The k-th Lexicographical String of All Happy Strings of Length n
550. № 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
551. № 1422. Maximum Score After Splitting a String
552. № 1424. Diagonal Traverse II
553. № 1425. Constrained Subsequence Sum
554. № 1431. Kids With the Greatest Number of Candies
555. № 1432. Max Difference You Can Get From Changing an Integer
556. № 1436. Destination City
557. № 1437. Check If All 1's Are at Least Length K Places Away
558. № 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
559. № 1441. Build an Array With Stack Operations
560. № 1442. Count Triplets That Can Form Two Arrays of Equal XOR
561. № 1448. Count Good Nodes in Binary Tree
562. № 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
563. № 1456. Maximum Number of Vowels in a Substring of Given Length
564. № 1457. Pseudo-Palindromic Paths in a Binary Tree
565. № 1458. Max Dot Product of Two Subsequences
566. № 1460. Make Two Arrays Equal by Reversing Subarrays
567. № 1461. Check If a String Contains All Binary Codes of Size K
568. № 1462. Course Schedule IV
569. № 1463. Cherry Pickup II
570. № 1464. Maximum Product of Two Elements in an Array
571. № 1472. Design Browser History
572. № 1475. Final Prices With a Special Discount in a Shop
573. № 1480. Running Sum of 1d Array
574. № 1481. Least Number of Unique Integers after K Removals
575. № 1482. Minimum Number of Days to Make m Bouquets
576. № 1488. Avoid Flood in The City
577. № 1491. Average Salary Excluding the Minimum and Maximum Salary
578. № 1493. Longest Subarray of 1's After Deleting One Element
579. № 1496. Path Crossing
580. № 1497. Check If Array Pairs Are Divisible by k
581. № 1498. Number of Subsequences That Satisfy the Given Sum Condition
582. № 1502. Can Make Arithmetic Progression From Sequence
583. № 1503. Last Moment Before All Ants Fall Out of a Plank
584. № 1504. Count Submatrices With All Ones
585. № 1508. Range Sum of Sorted Subarray Sums
586. № 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
587. № 1510. Stone Game IV
588. № 1512. Number of Good Pairs
589. № 1513. Number of Substrings With Only 1s
590. № 1514. Path with Maximum Probability
591. № 1518. Water Bottles
592. № 1523. Count Odd Numbers in an Interval Range
593. № 1524. Number of Sub-arrays With Odd Sum
594. № 1526. Minimum Number of Increments on Subarrays to Form a Target Array
595. № 1530. Number of Good Leaf Nodes Pairs
596. № 1531. String Compression II
597. № 1534. Count Good Triplets
598. № 1535. Find the Winner of an Array Game
599. № 1536. Minimum Swaps to Arrange a Binary Grid
600. № 1539. Kth Missing Positive Number
601. № 1544. Make The String Great
602. № 1545. Find Kth Bit in Nth Binary String
603. № 1550. Three Consecutive Odds
604. № 1552. Magnetic Force Between Two Balls
605. № 1559. Detect Cycles in 2D Grid
606. № 1561. Maximum Number of Coins You Can Get
607. № 1563. Stone Game V
608. № 1568. Minimum Number of Days to Disconnect Island
609. № 1572. Matrix Diagonal Sum
610. № 1574. Shortest Subarray to be Removed to Make Array Sorted
611. № 1575. Count All Possible Routes
612. № 1578. Minimum Time to Make Rope Colorful
613. № 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
614. № 1582. Special Positions in a Binary Matrix
615. № 1590. Make Sum Divisible by P
616. № 1593. Split a String Into the Max Number of Unique Substrings
617. № 1594. Maximum Non-Negative Product in a Matrix
618. № 1598. Crawler Log Folder
619. № 1603. Design Parking System
620. № 1605. Find Valid Matrix Given Row and Column Sums
621. № 1608. Special Array With X Elements Greater Than or Equal X
622. № 1609. Even Odd Tree
623. № 1611. Minimum One Bit Operations to Make Integers Zero
624. № 1614. Maximum Nesting Depth of the Parentheses
625. № 1621. Number of Sets of K Non-Overlapping Line Segments
626. № 1622. Fancy Sequence
627. № 1624. Largest Substring Between Two Equal Characters
628. № 1625. Lexicographically Smallest String After Applying Operations
629. № 1630. Arithmetic Subarrays
630. № 1636. Sort Array by Increasing Frequency
631. № 1637. Widest Vertical Area Between Two Points Containing No Points
632. № 1639. Number of Ways to Form a Target String Given a Dictionary
633. № 1642. Furthest Building You Can Reach
634. № 1652. Defuse the Bomb
635. № 1653. Minimum Deletions to Make String Balanced
636. № 1657. Determine if Two Strings Are Close
637. № 1662. Check If Two String Arrays are Equivalent
638. № 1665. Minimum Initial Energy to Finish Tasks
639. № 1669. Merge In Between Linked Lists
640. № 1671. Minimum Number of Removals to Make Mountain Array
641. № 1674. Minimum Moves to Make Array Complementary
642. № 1680. Concatenation of Consecutive Binary Numbers
643. № 1684. Count the Number of Consistent Strings
644. № 1685. Sum of Absolute Differences in a Sorted Array
645. № 1688. Count of Matches in Tournament
646. № 1689. Partitioning Into Minimum Number of Deci-Binary Numbers
647. № 1695. Maximum Erasure Value
648. № 1700. Number of Students Unable to Eat Lunch
649. № 1701. Average Waiting Time
650. № 1704. Determine if String Halves Are Alike
651. № 1716. Calculate Money in Leetcode Bank
652. № 1717. Maximum Score From Removing Substrings
653. № 1718. Construct the Lexicographically Largest Valid Sequence
654. № 1721. Swapping Nodes in a Linked List
655. № 1722. Minimize Hamming Distance After Swap Operations
656. № 1726. Tuple with Same Product
657. № 1727. Largest Submatrix With Rearrangements
658. № 1732. Find the Highest Altitude
659. № 1733. Minimum Number of People to Teach
660. № 1743. Restore the Array From Adjacent Pairs
661. № 1749. Maximum Absolute Sum of Any Subarray
662. № 1750. Minimum Length of String After Deleting Similar Ends
663. № 1751. Maximum Number of Events That Can Be Attended II
664. № 1752. Check if Array Is Sorted and Rotated
665. № 1758. Minimum Changes To Make Alternating Binary String
666. № 1759. Count Number of Homogenous Substrings
667. № 1760. Minimum Limit of Balls in a Bag
668. № 1765. Map of Highest Peak
669. № 1768. Merge Strings Alternately
670. № 1769. Minimum Number of Operations to Move All Balls to Each Box
671. № 1780. Check if Number is a Sum of Powers of Three
672. № 1784. Check if Binary String Has at Most One Segment of Ones
673. № 1790. Check if One String Swap Can Make Strings Equal
674. № 1791. Find Center of Star Graph
675. № 1792. Maximum Average Pass Ratio
676. № 1793. Maximum Score of a Good Subarray
677. № 1799. Maximize Score After N Operations
678. № 1800. Maximum Ascending Subarray Sum
679. № 1802. Maximum Value at a Given Index in a Bounded Array
680. № 1813. Sentence Similarity III
681. № 1814. Count Nice Pairs in an Array
682. № 1822. Sign of the Product of an Array
683. № 1823. Find the Winner of the Circular Game
684. № 1829. Maximum XOR for Each Query
685. № 1833. Maximum Ice Cream Bars
686. № 1838. Frequency of the Most Frequent Element
687. № 1845. Seat Reservation Manager
688. № 1846. Maximum Element After Decreasing and Rearranging
689. № 1848. Minimum Distance to the Target Element
690. № 1855. Maximum Distance Between a Pair of Values
691. № 1857. Largest Color Value in a Directed Graph
692. № 1861. Rotating the Box
693. № 1863. Sum of All Subset XOR Totals
694. № 1865. Finding Pairs With a Certain Sum
695. № 1870. Minimum Speed to Arrive on Time
696. № 1871. Jump Game VII
697. № 1872. Stone Game VIII
698. № 1877. Minimize Maximum Pair Sum in Array
699. № 1878. Get Biggest Three Rhombus Sums in a Grid
700. № 1886. Determine Whether Matrix Can Be Obtained By Rotation
701. № 1887. Reduction Operations to Make the Array Elements Equal
702. № 1888. Minimum Number of Flips to Make the Binary String Alternating
703. № 1894. Find the Student that Will Replace the Chalk
704. № 1895. Largest Magic Square
705. № 1897. Redistribute Characters to Make All Strings Equal
706. № 1900. The Earliest and Latest Rounds Where Players Compete
707. № 1903. Largest Odd Number in String
708. № 1905. Count Sub Islands
709. № 1910. Remove All Occurrences of a Substring
710. № 1912. Design Movie Rental System
711. № 1913. Maximum Product Difference Between Two Pairs
712. № 1914. Cyclically Rotating a Grid
713. № 1915. Number of Wonderful Substrings
714. № 1920. Build Array from Permutation
715. № 1921. Eliminate Maximum Number of Monsters
716. № 1922. Count Good Numbers
717. № 1925. Count Square Sum Triples
718. № 1927. Sum Game
719. № 1930. Unique Length-3 Palindromic Subsequences
720. № 1931. Painting a Grid With Three Different Colors
721. № 1935. Maximum Number of Words You Can Type
722. № 1937. Maximum Number of Points with Cost
723. № 1942. The Number of the Smallest Unoccupied Chair
724. № 1945. Sum of Digits of String After Convert
725. № 1948. Delete Duplicate Folders in System
726. № 1957. Delete Characters to Make Fancy String
727. № 1963. Minimum Number of Swaps to Make the String Balanced
728. № 1967. Number of Strings That Appear as Substrings in Word
729. № 1968. Maximum Building Height
730. № 1970. Last Day Where You Can Still Cross
731. № 1971. Find if Path Exists in Graph
732. № 1975. Maximum Matrix Sum
733. № 1976. Number of Ways to Arrive at Destination
734. № 1979. Find Greatest Common Divisor of Array
735. № 1980. Find Unique Binary String
736. № 1984. Minimum Difference Between Highest and Lowest of K Scores
737. № 1992. Find All Groups of Farmland
738. № 2000. Reverse Prefix of Word
739. № 2009. Minimum Number of Operations to Make Array Continuous
740. № 2011. Final Value of Variable After Performing Operations
741. № 2014. Longest Subsequence Repeated k Times
742. № 2016. Maximum Difference Between Increasing Elements
743. № 2017. Grid Game
744. № 2022. Convert 1D Array Into 2D Array
745. № 2024. Maximize the Confusion of an Exam
746. № 2028. Find Missing Observations
747. № 2029. Stone Game IX
748. № 2033. Minimum Operations to Make a Uni-Value Grid
749. № 2037. Minimum Number of Moves to Seat Everyone
750. № 2038. Remove Colored Pieces if Both Neighbors are the Same Color
751. № 2040. Kth Smallest Product of Two Sorted Arrays
752. № 2043. Simple Bank System
753. № 2044. Count Number of Maximum Bitwise-OR Subsets
754. № 2045. Second Minimum Time to Reach Destination
755. № 2048. Next Greater Numerically Balanced Number
756. № 2050. Parallel Courses III
757. № 2053. Kth Distinct String in an Array
758. № 2054. Two Best Non-Overlapping Events
759. № 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points
760. № 2064. Minimized Maximum of Products Distributed to Any Store
761. № 2069. Walking Robot Simulation II
762. № 2070. Most Beautiful Item for Each Query
763. № 2071. Maximum Number of Tasks You Can Assign
764. № 2073. Time Needed to Buy Tickets
765. № 2075. Decode the Slanted Ciphertext
766. № 2078. Two Furthest Houses With Different Colors
767. № 2081. Sum of k-Mirror Numbers
768. № 2090. K Radius Subarray Averages
769. № 2092. Find All People With Secret
770. № 2094. Finding 3-Digit Even Numbers
771. № 2095. Delete the Middle Node of a Linked List
772. № 2096. Step-By-Step Directions From a Binary Tree Node to Another
773. № 2097. Valid Arrangement of Pairs
774. № 2099. Find Subsequence of Length K With the Largest Sum
775. № 2106. Maximum Fruits Harvested After at Most K Steps
776. № 2108. Find First Palindromic String in the Array
777. № 2109. Adding Spaces to a String
778. № 2110. Number of Smooth Descent Periods of a Stock
779. № 2115. Find All Possible Recipes from Given Supplies
780. № 2116. Check if a Parentheses String Can Be Valid
781. № 2125. Number of Laser Beams in a Bank
782. № 2126. Destroying Asteroids
783. № 2127. Maximum Employees to Be Invited to a Meeting
784. № 2130. Maximum Twin Sum of a Linked List
785. № 2131. Longest Palindrome by Concatenating Two Letter Words
786. № 2134. Minimum Swaps to Group All 1's Together II
787. № 2138. Divide a String Into Groups of Size k
788. № 2140. Solving Questions With Brainpower
789. № 2141. Maximum Running Time of N Computers
790. № 2144. Minimum Cost of Buying Candies With Discount
791. № 2145. Count the Hidden Sequences
792. № 2147. Number of Ways to Divide a Long Corridor
793. № 2149. Rearrange Array Elements by Sign
794. № 2154. Keep Multiplying Found Values by Two
795. № 2161. Partition Array According to Given Pivot
796. № 2163. Minimum Difference in Sums After Removal of Elements
797. № 2169. Count Operations to Obtain Zero
798. № 2176. Count Equal and Divisible Pairs in an Array
799. № 2179. Count Good Triplets in an Array
800. № 2181. Merge Nodes in Between Zeros
801. № 2182. Construct String With Repeat Limit
802. № 2185. Counting Words With a Given Prefix
803. № 2187. Minimum Time to Complete Trips
804. № 2191. Sort the Jumbled Numbers
805. № 2192. All Ancestors of a Node in a Directed Acyclic Graph
806. № 2196. Create Binary Tree From Descriptions
807. № 2197. Replace Non-Coprime Numbers in Array
808. № 2200. Find All K-Distant Indices in an Array
809. № 2206. Divide Array Into Equal Pairs
810. № 2210. Count Hills and Valleys in an Array
811. № 2211. Count Collisions on a Road
812. № 2212. Removing Minimum and Maximum From Array
813. № 2213. Longest Substring of One Repeating Character
814. № 2215. Find the Difference of Two Arrays
815. № 2220. Minimum Bit Flips to Convert Number
816. № 2221. Find Triangular Sum of an Array
817. № 2225. Find Players With Zero or One Losses
818. № 2226. Maximum Candies Allocated to K Children
819. № 2235. Add Two Integers
820. № 2236. Root Equals Sum of Children
821. № 2251. Number of Flowers in Full Bloom
822. № 2257. Count Unguarded Cells in the Grid
823. № 2264. Largest 3-Same-Digit Number in String
824. № 2265. Count Nodes Equal to Average of Subtree
825. № 2270. Number of Ways to Split Array
826. № 2273. Find Resultant Array After Removing Anagrams
827. № 2275. Largest Combination With Bitwise AND Greater Than Zero
828. № 2285. Maximum Total Importance of Roads
829. № 2290. Minimum Obstacle Removal to Reach Corner
830. № 2294. Partition Array Such That Maximum Difference Is K
831. № 2300. Successful Pairs of Spells and Potions
832. № 2302. Count Subarrays With Score Less Than K
833. № 2305. Fair Distribution of Cookies
834. № 2311. Longest Binary Subsequence Less Than or Equal to K
835. № 2322. Minimum Score After Removals on a Tree
836. № 2326. Spiral Matrix IV
837. № 2327. Number of People Aware of a Secret
838. № 2331. Evaluate Boolean Binary Tree
839. № 2336. Smallest Number in Infinite Set
840. № 2337. Move Pieces to Obtain a String
841. № 2338. Count the Number of Ideal Arrays
842. № 2342. Max Sum of a Pair With Equal Sum of Digits
843. № 2348. Number of Zero-Filled Sub-arrays
844. № 2349. Design a Number Container System
845. № 2352. Equal Row and Column Pairs
846. № 2353. Design a Food Rating System
847. № 2359. Find Closest Node to Given Two Nodes
848. № 2364. Count Number of Bad Pairs
849. № 2370. Longest Ideal Subsequence
850. № 2373. Largest Local Values in a Matrix
851. № 2375. Construct Smallest Number From DI String
852. № 2379. Minimum Recolors to Get K Consecutive Black Blocks
853. № 2381. Shifting Letters II
854. № 2385. Amount of Time for Binary Tree to Be Infected
855. № 2390. Removing Stars From a String
856. № 2391. Minimum Amount of Time to Collect Garbage
857. № 2392. Build a Matrix With Conditions
858. № 2401. Longest Nice Subarray
859. № 2402. Meeting Rooms III
860. № 2405. Optimal Partition of String
861. № 2406. Divide Intervals Into Minimum Number of Groups
862. № 2410. Maximum Matching of Players With Trainers
863. № 2411. Smallest Subarrays With Maximum Bitwise OR
864. № 2414. Length of the Longest Alphabetical Continuous Substring
865. № 2415. Reverse Odd Levels of Binary Tree
866. № 2416. Sum of Prefix Scores of Strings
867. № 2418. Sort the People
868. № 2419. Longest Subarray With Maximum Bitwise AND
869. № 2425. Bitwise XOR of All Pairings
870. № 2429. Minimize XOR
871. № 2433. Find The Original Array of Prefix Xor
872. № 2434. Using a Robot to Print the Lexicographically Smallest String
873. № 2435. Paths in Matrix Whose Sum Is Divisible by K
874. № 2438. Range Product Queries of Powers
875. № 2439. Minimize Maximum of Array
876. № 2441. Largest Positive Integer That Exists With Its Negative
877. № 2444. Count Subarrays With Fixed Bounds
878. № 2448. Minimum Cost to Make Array Equal
879. № 2452. Words Within Two Edits of Dictionary
880. № 2458. Height of Binary Tree After Subtree Removal Queries
881. № 2460. Apply Operations to an Array
882. № 2461. Maximum Sum of Distinct Subarrays With Length K
883. № 2462. Total Cost to Hire K Workers
884. № 2463. Minimum Total Distance Traveled
885. № 2466. Count Ways To Build Good Strings
886. № 2467. Most Profitable Path in a Tree
887. № 2471. Minimum Number of Operations to Sort a Binary Tree by Level
888. № 2472. Maximum Number of Non-overlapping Palindrome Substrings
889. № 2482. Difference Between Ones and Zeros in Row and Column
890. № 2483. Minimum Penalty for a Shop
891. № 2485. Find the Pivot Integer
892. № 2486. Append Characters to String to Make Subsequence
893. № 2487. Remove Nodes From Linked List
894. № 2490. Circular Sentence
895. № 2491. Divide Players Into Teams of Equal Skill
896. № 2492. Minimum Score of a Path Between Two Cities
897. № 2493. Divide Nodes Into the Maximum Number of Groups
898. № 2501. Longest Square Streak in an Array
899. № 2503. Maximum Number of Points From Grid Queries
900. № 2515. Shortest Distance to Target String in a Circular Array
901. № 2516. Take K of Each Character From Left and Right
902. № 2523. Closest Prime Numbers in Range
903. № 2528. Maximize the Minimum Powered City
904. № 2529. Maximum Count of Positive Integer and Negative Integer
905. № 2530. Maximal Score After Applying K Operations
906. № 2536. Increment Submatrices by One
907. № 2537. Count the Number of Good Subarrays
908. № 2540. Minimum Common Value
909. № 2542. Maximum Subsequence Score
910. № 2551. Put Marbles in Bags
911. № 2553. Separate the Digits in an Array
912. № 2554. Maximum Number of Integers to Choose From a Range I
913. № 2558. Take Gifts From the Richest Pile
914. № 2559. Count Vowel Strings in Ranges
915. № 2560. House Robber IV
916. № 2561. Rearranging Fruits
917. № 2563. Count the Number of Fair Pairs
918. № 2566. Maximum Difference by Remapping a Digit
919. № 2570. Merge Two 2D Arrays by Summing Values
920. № 2573. Find the String with LCP
921. № 2574. Left and Right Sum Differences
922. № 2577. Minimum Time to Visit a Cell In a Grid
923. № 2577. Minimum Time to Visit a Cell In a Grid2579. Count Total Number of Colored Cells
924. № 2582. Pass the Pillow
925. № 2583. Kth Largest Sum in a Binary Tree
926. № 2593. Find Score of an Array After Marking All Elements
927. № 2594. Minimum Time to Repair Cars
928. № 2597. The Number of Beautiful Subsets
929. № 2598. Smallest Missing Non-negative Integer After Operations
930. № 2601. Prime Subtraction Operation
931. № 2610. Convert an Array Into a 2D Array With Conditions
932. № 2615. Sum of Distances
933. № 2616. Minimize the Maximum Difference of Pairs
934. № 2641. Cousins in Binary Tree II
935. № 2642. Design Graph With Shortest Path Calculator
936. № 2654. Minimum Number of Operations to Make All Array Elements Equal to 1
937. № 2657. Find the Prefix Common Array of Two Arrays
938. № 2658. Maximum Number of Fish in a Grid
939. № 2661. First Completely Painted Row or Column
940. № 2678. Number of Senior Citizens
941. № 2683. Neighboring Bitwise XOR
942. № 2684. Maximum Number of Moves in a Grid
943. № 2685. Count the Number of Complete Components
944. № 2696. Minimum String Length After Removing Substrings
945. № 2698. Find the Punishment Number of an Integer
946. № 2699. Modify Graph Edge Weights
947. № 2706. Buy Two Chocolates
948. № 2707. Extra Characters in a String
949. № 2709. Greatest Common Divisor Traversal
950. № 2742. Painting the Walls
951. № 2749. Minimum Operations to Make the Integer Zero
952. № 2751. Robot Collisions
953. № 2762. Continuous Subarrays
954. № 2779. Maximum Beauty of an Array After Applying Operation
955. № 2780. Minimum Index of a Valid Split
956. № 2784. Check if Array is Good
957. № 2785. Sort Vowels in a String
958. № 2787. Ways to Express an Integer as Sum of Powers
959. № 2799. Count Complete Subarrays in an Array
960. № 2807. Insert Greatest Common Divisors in Linked List
961. № 2812. Find the Safest Path in a Grid
962. № 2816. Double a Number Represented as a Linked List
963. № 2818. Apply Operations to Maximize Score
964. № 2825. Make String a Subsequence Using Cyclic Increments
965. № 2833. Furthest Point From Origin
966. № 2839. Check if Strings Can be Made Equal With Operations I
967. № 2840. Check if Strings Can be Made Equal With Operations II
968. № 2843. Count Symmetric Integers
969. № 2845. Count of Interesting Subarrays
970. № 2849. Determine if a Cell Is Reachable at a Given Time
971. № 2855. Maximum Number of Jumps to Reach the Last Index
972. № 2864. Maximum Odd Binary Number
973. № 2870. Minimum Number of Operations to Make Array Empty
974. № 2872. Maximum Number of K-Divisible Components
975. № 2873. Maximum Value of an Ordered Triplet I
976. № 2874. Maximum Value of an Ordered Triplet II
977. № 2894. Divisible and Non-divisible Sums Difference
978. № 2900. Longest Unequal Adjacent Groups Subsequence I
979. № 2901. Longest Unequal Adjacent Groups Subsequence II
980. № 2904. Shortest and Lexicographically Smallest Beautiful String
981. № 2906. Construct Product Matrix
982. № 2914. Minimum Number of Changes to Make Binary String Beautiful
983. № 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros
984. № 2924. Find Champion II
985. № 2929. Distribute Candies Among Children II
986. № 2938. Separate Black and White Balls
987. № 2940. Find Building Where Alice and Bob Can Meet
988. № 2942. Find Words Containing Character
989. № 2943. Maximize Area of Square Hole in Grid
990. № 2946. Matrix Similarity After Cyclic Shifts
991. № 2948. Make Lexicographically Smallest Array by Swapping Elements
992. № 2958. Length of Longest Subarray With at Most K Frequency
993. № 2962. Count Subarrays Where Max Element Appears at Least K Times
994. № 2965. Find Missing and Repeated Values
995. № 2966. Divide Array Into Arrays With Max Difference
996. № 2971. Find Polygon With the Largest Perimeter
997. № 2975. Maximum Square Area by Removing Fences From a Field
998. № 2976. Minimum Cost to Convert String I
999. № 2977. Minimum Cost to Convert String II
1000. № 2981. Find Longest Special Substring That Occurs Thrice I
1001. № 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum
1002. № 2997. Minimum Number of Operations to Make Array XOR Equal to K
1003. № 2999. Count the Number of Powerful Integers
1004. № 3000. Maximum Area of Longest Diagonal Rectangle
1005. № 3003. Maximize the Number of Partitions After Operations
1006. № 3005. Count Elements With Maximum Frequency
1007. № 3010. Divide an Array Into Subarrays With Minimum Cost I
1008. № 3011. Find if Array Can Be Sorted
1009. № 3013. Divide an Array Into Subarrays With Minimum Cost II
1010. № 3014. Minimum Number of Pushes to Type Word I
1011. № 3016. Minimum Number of Pushes to Type Word II
1012. № 3020. Find the Maximum Number of Elements in Subset
1013. № 3021. Alice and Bob Playing Flower Game
1014. № 3024. Type of Triangle
1015. № 3025. Find the Number of Ways to Place People I
1016. № 3027. Find the Number of Ways to Place People II
1017. № 3042. Count Prefix and Suffix Pairs I
1018. № 3043. Find the Length of the Longest Common Prefix
1019. № 3047. Find the Largest Area of Square Inside Two Rectangles
1020. № 3066. Minimum Operations to Exceed Threshold Value II
1021. № 3068. Find the Maximum Sum of Node Values
1022. № 3070. Count Submatrices with Top-Left Element and Sum Less Than k
1023. № 3074. Apple Redistribution into Boxes
1024. № 3074. Distribute Elements Into Two Arrays I
1025. № 3075. Maximize Happiness of Selected Children
1026. № 3085. Minimum Deletions to Make String K-Special
1027. № 3090. Maximum Length Substring With Two Occurrences
1028. № 3093. Longest Common Suffix Queries
1029. № 3097. Shortest Subarray With OR at Least K II
1030. № 3100. Water Bottles II
1031. № 3105. Longest Strictly Increasing or Strictly Decreasing Subarray
1032. № 3108. Minimum Cost Walk in Weighted Graph
1033. № 3110. Score of a String
1034. № 3116. Kth Smallest Amount With Single Denomination Combination
1035. № 3120. Count the Number of Special Characters I
1036. № 3121. Count the Number of Special Characters II
1037. № 3129. Find All Possible Stable Binary Arrays I
1038. № 3130. Find All Possible Stable Binary Arrays II
1039. № 3133. Minimum Array End
1040. № 3136. Valid Word
1041. № 3147. Taking Maximum Energy From the Mystic Dungeon
1042. № 3151. Special Array I
1043. № 3152. Special Array II
1044. № 3160. Find the Number of Distinct Colors Among the Balls
1045. № 3161. Block Placement Queries
1046. № 3163. String Compression III
1047. № 3169. Count Days Without Meetings
1048. № 3170. Lexicographically Minimum String After Removing Stars
1049. № 3174. Clear Digits
1050. № 3186. Maximum Total Damage With Spell Casting
1051. № 3190. Find Minimum Operations to Make All Elements Divisible by Three
1052. № 3191. Minimum Operations to Make Binary Array Elements Equal to One I
1053. № 3195. Find the Minimum Area to Cover All Ones I
1054. № 3197. Find the Minimum Area to Cover All Ones II
1055. № 3201. Find the Maximum Length of Valid Subsequence I
1056. № 3202. Find the Maximum Length of Valid Subsequence II
1057. № 3203. Find Minimum Diameter After Merging Two Trees
1058. № 3208. Alternating Groups II
1059. № 3212. Count Submatrices With Equal Frequency of X and Y
1060. № 3217. Delete Nodes From Linked List Present in Array
1061. № 3223. Minimum Length of String After Operations
1062. № 3225. Maximum Score From Grid Operations
1063. № 3227. Vowels Game in a String
1064. № 3228. Maximum Number of Operations to Move Ones to the End
1065. № 3234. Count the Number of Substrings With Dominant Ones
1066. № 3243. Shortest Distance After Road Addition Queries I
1067. № 3254. Find the Power of K-Size Subarrays I
1068. № 3264. Final Array State After K Multiplication Operations I
1069. № 3272. Find the Count of Good Integers
1070. № 3286. Find a Safe Walk Through a Grid
1071. № 3289. The Two Sneaky Numbers of Digitville
1072. № 3296. Minimum Number of Seconds to Make Mountain Height Zero
1073. № 3300. Minimum Element After Replacement With Digit Sum
1074. № 3302. Find the Lexicographically Smallest Valid Sequence
1075. № 3304. Find the K-th Character in String Game I
1076. № 3306. Count of Substrings Containing Every Vowel and K Consonants II
1077. № 3307. Find the K-th Character in String Game II
1078. № 3310. Remove Methods From Project
1079. № 3312. Sorted GCD Pair Queries
1080. № 3314. Construct the Minimum Bitwise Array I
1081. № 3315. Construct the Minimum Bitwise Array II
1082. № 3318. Find X-Sum of All K-Long Subarrays I
1083. № 3321. Find X-Sum of All K-Long Subarrays II
1084. № 3330. Find the Original Typed String I
1085. № 3333. Find the Original Typed String II
1086. № 3335. Total Characters in String After Transformations I
1087. № 3336. Find the Number of Subsequences With Equal GCD
1088. № 3337. Total Characters in String After Transformations II
1089. № 3341. Find Minimum Time to Reach Last Room I
1090. № 3342. Find Minimum Time to Reach Last Room II
1091. № 3343. Count Number of Balanced Permutations
1092. № 3345. Smallest Divisible Digit Product I
1093. № 3346. Maximum Frequency of an Element After Performing Operations I
1094. № 3347. Maximum Frequency of an Element After Performing Operations II
1095. № 3348. Smallest Divisible Digit Product II
1096. № 3349. Adjacent Increasing Subarrays Detection I
1097. № 3350. Adjacent Increasing Subarrays Detection II
1098. № 3354. Make Array Elements Equal to Zero
1099. № 3355. Zero Array Transformation I
1100. № 3356. Zero Array Transformation II
1101. № 3362. Zero Array Transformation III
1102. № 3363. Find the Maximum Number of Fruits Collected
1103. № 3370. Smallest Number With All Set Bits
1104. № 3372. Maximize the Number of Target Nodes After Connecting Trees I
1105. № 3373. Maximize the Number of Target Nodes After Connecting Trees II
1106. № 3375. Minimum Operations to Make Array Values Equal to K
1107. № 3379. Transformed Array
1108. № 3381. Maximum Subarray Sum With Length Divisible by K
1109. № 3392. Count Subarrays of Length Three With a Condition
1110. № 3394. Check if Grid can be Cut into Sections
1111. № 3396. Minimum Number of Operations to Make Elements in Array Distinct
1112. № 3397. Maximum Number of Distinct Elements After Operations
1113. № 3403. Find the Lexicographically Largest String From the Box I
1114. № 3405. Count the Number of Arrays with K Matching Adjacent Elements
1115. № 3408. Design Task Manager
1116. № 3418. Maximum Amount of Money Robot Can Earn
1117. № 3423. Maximum Difference Between Adjacent Elements in a Circular Array
1118. № 3432. Count Partitions with Even Sum Difference
1119. № 3433. Count Mentions Per User
1120. № 3439. Reschedule Meetings for Maximum Free Time I
1121. № 3440. Reschedule Meetings for Maximum Free Time II
1122. № 3442. Maximum Difference Between Even and Odd Frequency I
1123. № 3443. Maximum Manhattan Distance After K Changes
1124. № 3445. Maximum Difference Between Even and Odd Frequency II
1125. № 3446. Sort Matrix by Diagonals
1126. № 3453. Separate Squares I
1127. № 3454. Separate Squares II
1128. № 3459. Length of Longest V-Shaped Diagonal Segment
1129. № 3461. Check If Digits Are Equal in String After Operations I
1130. № 3464. Maximize the Distance Between Points on a Square
1131. № 3474. Lexicographically Smallest Generated String
1132. № 3477. Fruits Into Baskets II
1133. № 3479. Fruits Into Baskets III
1134. № 3480. Maximize Subarrays After Removing One Conflicting Pair
1135. № 3483. Unique 3-Digit Even Numbers
1136. № 3484. Design Spreadsheet
1137. № 3487. Maximum Unique Subarray Sum After Deletion
1138. № 3488. Closest Equal Element Queries
1139. № 3494. Find the Minimum Amount of Time to Brew Potions
1140. № 3495. Minimum Operations to Make Array Elements Zero
1141. № 3499. Maximize Active Section with Trade I
1142. № 3501. Maximize Active Section with Trade II
1143. № 3507. Minimum Pair Removal to Sort Array I
1144. № 3508. Implement Router
1145. № 3510. Minimum Pair Removal to Sort Array II
1146. № 3512. Minimum Operations to Make Array Sum Divisible by K
1147. № 3513. Number of Unique XOR Triplets I
1148. № 3514. Number of Unique XOR Triplets II
1149. № 3516. Find Closest Person
1150. № 3517. Smallest Palindromic Rearrangement I
1151. № 3531. Count Covered Buildings
1152. № 3532. Path Existence Queries in a Graph I
1153. № 3534. Path Existence Queries in a Graph II
1154. № 3536. Maximum Product of Two Digits
1155. № 3539. Find Sum of Array Product of Magical Sequences
1156. № 3541. Find Most Frequent Vowel and Consonant
1157. № 3542. Minimum Operations to Convert All Elements to Zero
1158. № 3546. Equal Sum Grid Partition I
1159. № 3548. Equal Sum Grid Partition II
1160. № 3558. Number of Ways to Assign Edge Weights I
1161. № 3559. Number of Ways to Assign Edge Weights II
1162. № 3562. Maximum Profit from Trading Stocks with Discounts
1163. № 3568. Minimum Moves to Clean the Classroom
1164. № 3573. Best Time to Buy and Sell Stock V
1165. № 3577. Count the Number of Computer Unlocking Permutations
1166. № 3578. Count Partitions With Max-Min Difference at Most K
1167. № 3583. Count Special Triplets
1168. № 3606. Coupon Code Validator
1169. № 3607. Power Grid Maintenance
1170. № 3612. Process String with Special Operations I
1171. № 3614. Process String with Special Operations II
1172. № 3620. Network Recovery Pathways
1173. № 3623. Count Number of Trapezoids I
1174. № 3625. Count Number of Trapezoids II
1175. № 3629. Minimum Jumps to Reach End via Prime Teleportation
1176. № 3633. Earliest Finish Time for Land and Water Rides I
1177. № 3634. Minimum Removals to Balance Array
1178. № 3637. Trionic Array I
1179. № 3640. Trionic Array II
1180. № 3643. Flip Square Submatrix Vertically
1181. № 3650. Minimum Cost Path with Edge Reversals
1182. № 3651. Minimum Cost Path with Teleportations
1183. № 3652. Best Time to Buy and Sell Stock using Strategy
1184. № 3653. XOR After Range Multiplication Queries I
1185. № 3655. XOR After Range Multiplication Queries II
1186. № 3658. GCD of Odd and Even Sums
1187. № 3660. Jump Game IX
1188. № 3661. Maximum Walls Destroyed by Robots
1189. № 3666. Minimum Operations to Equalize Binary String
1190. № 3689. Maximum Total Subarray Value I
1191. № 3691. Maximum Total Subarray Value II
1192. № 3699. Number of ZigZag Arrays I
1193. № 3700. Number of ZigZag Arrays II
1194. № 3702. Longest Subsequence With Non-Zero Bitwise XOR
1195. № 3705. Find Largest Almost Missing Integer
1196. № 3713. Longest Balanced Substring I
1197. № 3714. Longest Balanced Substring II
1198. № 3718. Smallest Missing Multiple of K
1199. № 3719. Longest Balanced Subarray I
1200. № 3720. Lexicographically Smallest Permutation Greater Than Target
1201. № 3721. Longest Balanced Subarray II
1202. № 3731. Find Missing Elements
1203. № 3734. Lexicographically Smallest Palindromic Permutation Greater Than Target
1204. № 3737. Count Subarrays With Majority Element I
1205. № 3739. Count Subarrays With Majority Element II
1206. № 3740. Minimum Distance Between Three Equal Elements I
1207. № 3741. Minimum Distance Between Three Equal Elements II
1208. № 3742. Maximum Path Score in a Grid
1209. № 3751. Total Waviness of Numbers in Range I
1210. № 3753. Total Waviness of Numbers in Range II
1211. № 3754. Concatenate Non-Zero Digits and Multiply by Sum I
1212. № 3756. Concatenate Non-Zero Digits and Multiply by Sum II
1213. № 3761. Minimum Absolute Distance Between Mirror Pairs
1214. № 3783. Mirror Distance of an Integer
1215. № 3838. Weighted Word Mapping
1216. № 3867. Sum of GCD of Formed Pairs
1217. № 3870. Count Commas in Range
1218. № 3871. Count Commas in Range II
1219. № 3875. Construct Uniform Parity Array I
1220. № 3876. Construct Uniform Parity Array II
1221. № 3884. Minimum Absolute Difference in Sliding Submatrix
1222. № 3902. Maximize Spanning Tree Stability with Upgrades
1223. № 3903. Smallest Stable Index I
1224. № 3904. Smallest Stable Index II
1225. № 3918. Check Divisibility by Digit Sum and Product
1226. № 3967. Earliest Finish Time for Land and Water Rides II