Skip to main content

LeetCode Problems 2300 - 2399

Start Practicing: https://leetcode.com/study-plan/programming-skills

Problem NameDifficultySolution Link
2300. Successful Pairs of Spells and PotionsMediumView Solutions
2301. Match Substring After ReplacementHardView Solutions
2302. Count Subarrays With Score Less Than KHardView Solutions
2303. Calculate Amount Paid in TaxesEasyView Solutions
2304. Minimum Path Cost in a GridMediumView Solutions
2305. Fair Distribution of CookiesMediumView Solutions
2306. Naming a CompanyHardView Solutions
2307. Check for Contradictions in EquationsHardView Solutions
2308. Arrange Table by GenderMediumView Solutions
2309. Greatest English Letter in Upper and Lower CaseEasyView Solutions
2310. Sum of Numbers With Units Digit KMediumView Solutions
2311. Longest Binary Subsequence Less Than or Equal to KMediumView Solutions
2312. Selling Pieces of WoodHardView Solutions
2313. Minimum Flips in Binary Tree to Get ResultHardView Solutions
2314. The First Day of the Maximum Recorded Degree in Each CityMediumView Solutions
2315. Count AsterisksEasyView Solutions
2316. Count Unreachable Pairs of Nodes in an Undirected GraphMediumView Solutions
2317. Maximum XOR After OperationsMediumView Solutions
2318. Number of Distinct Roll SequencesHardView Solutions
2319. Check if Matrix Is X-MatrixEasyView Solutions
2320. Count Number of Ways to Place HousesMediumView Solutions
2321. Maximum Score Of Spliced ArrayHardView Solutions
2322. Minimum Score After Removals on a TreeHardView Solutions
2323. Find Minimum Time to Finish All Jobs IIMediumView Solutions
2324. Product Sales Analysis IVMediumView Solutions
2325. Decode the MessageEasyView Solutions
2326. Spiral Matrix IVMediumView Solutions
2327. Number of People Aware of a SecretMediumView Solutions
2328. Number of Increasing Paths in a GridHardView Solutions
2329. Product Sales Analysis VEasyView Solutions
2330. Valid Palindrome IVMediumView Solutions
2331. Evaluate Boolean Binary TreeEasyView Solutions
2332. The Latest Time to Catch a BusMediumView Solutions
2333. Minimum Sum of Squared DifferenceMediumView Solutions
2334. Subarray With Elements Greater Than Varying ThresholdHardView Solutions
2335. Minimum Amount of Time to Fill CupsEasyView Solutions
2336. Smallest Number in Infinite SetMediumView Solutions
2337. Move Pieces to Obtain a StringMediumView Solutions
2338. Count the Number of Ideal ArraysHardView Solutions
2339. All the Matches of the LeagueEasyView Solutions
2340. Minimum Adjacent Swaps to Make a Valid ArrayMediumView Solutions
2341. Maximum Number of Pairs in ArrayEasyView Solutions
2342. Max Sum of a Pair With Equal Sum of DigitsMediumView Solutions
2343. Query Kth Smallest Trimmed NumberMediumView Solutions
2344. Minimum Deletions to Make Array DivisibleHardView Solutions
2345. Finding the Number of Visible MountainsMediumView Solutions
2346. Compute the Rank as a PercentageMediumView Solutions
2347. Best Poker HandEasyView Solutions
2348. Number of Zero-Filled SubarraysMediumView Solutions
2349. Design a Number Container SystemMediumView Solutions
2350. Shortest Impossible Sequence of RollsHardView Solutions
2351. First Letter to Appear TwiceEasyView Solutions
2352. Equal Row and Column PairsMediumView Solutions
2353. Design a Food Rating SystemMediumView Solutions
2354. Number of Excellent PairsHardView Solutions
2355. Maximum Number of Books You Can TakeHardView Solutions
2356. Number of Unique Subjects Taught by Each TeacherEasyView Solutions
2357. Make Array Zero by Subtracting Equal AmountsEasyView Solutions
2358. Maximum Number of Groups Entering a CompetitionMediumView Solutions
2359. Find Closest Node to Given Two NodesMediumView Solutions
2360. Longest Cycle in a GraphHardView Solutions
2361. Minimum Costs Using the Train LineHardView Solutions
2362. Generate the InvoiceHardView Solutions
2363. Merge Similar ItemsEasyView Solutions
2364. Count Number of Bad PairsMediumView Solutions
2365. Task Scheduler IIMediumView Solutions
2366. Minimum Replacements to Sort the ArrayHardView Solutions
2367. Number of Arithmetic TripletsEasyView Solutions
2368. Reachable Nodes With RestrictionsMediumView Solutions
2369. Check if There is a Valid Partition For The ArrayMediumView Solutions
2370. Longest Ideal SubsequenceMediumView Solutions
2371. Minimize Maximum Value in a GridHardView Solutions
2372. Calculate the Influence of Each SalespersonMediumView Solutions
2373. Largest Local Values in a MatrixEasyView Solutions
2374. Node With Highest Edge ScoreMediumView Solutions
2375. Construct Smallest Number From DI StringMediumView Solutions
2376. Count Special IntegersHardView Solutions
2377. Sort the Olympic TableEasyView Solutions
2378. Choose Edges to Maximize Score in a TreeMediumView Solutions
2379. Minimum Recolors to Get K Consecutive Black BlocksEasyView Solutions
2380. Time Needed to Rearrange a Binary StringMediumView Solutions
2381. Shifting Letters IIMediumView Solutions
2382. Maximum Segment Sum After RemovalsHardView Solutions
2383. Minimum Hours of Training to Win a CompetitionEasyView Solutions
2384. Largest Palindromic NumberMediumView Solutions
2385. Amount of Time for Binary Tree to Be InfectedMediumView Solutions
2386. Find the K-Sum of an ArrayHardView Solutions
2387. Median of a Row Wise Sorted MatrixMediumView Solutions
2388. Change Null Values in a Table to the Previous ValueMediumView Solutions
2389. Longest Subsequence With Limited SumEasyView Solutions
2390. Removing Stars From a StringMediumView Solutions
2391. Minimum Amount of Time to Collect GarbageMediumView Solutions
2392. Build a Matrix With ConditionsHardView Solutions
2393. Count Strictly Increasing SubarraysMediumView Solutions
2394. Employees With DeductionsMediumView Solutions
2395. Find Subarrays With Equal SumEasyView Solutions
2396. Strictly Palindromic NumberMediumView Solutions
2397. Maximum Rows Covered by ColumnsMediumView Solutions
2398. Maximum Number of Robots Within BudgetHardView Solutions
2399. Check Distances Between Same LettersEasyView Solutions

Now, you can see the list of problems in a table format. You can click on the problem link to view the problem on the LeetCode website. You can also click on the solution link to view the solution of the problem.