Skip to main content

LeetCode Problems 1300 - 1399

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

Problem NameDifficultySolution Link
1300. Sum of Mutated Array Closest to TargetMediumView Solutions
1301. Number of Paths with Max ScoreHardView Solutions
1302. Deepest Leaves SumMediumView Solutions
1303. Find the Team SizeEasyView Solutions
1304. Find N Unique Integers Sum up to ZeroEasyView Solutions
1305. All Elements in Two Binary Search TreesMediumView Solutions
1306. Jump Game IIIMediumView Solutions
1307. Verbal Arithmetic PuzzleHardView Solutions
1308. Running Total for Different GendersMediumView Solutions
1309. Decrypt String from Alphabet to Integer MappingEasyView Solutions
1310. XOR Queries of a SubarrayMediumView Solutions
1311. Get Watched Videos by Your FriendsMediumView Solutions
1312. Minimum Insertion Steps to Make a String PalindromeHardView Solutions
1313. Decompress Run-Length Encoded ListEasyView Solutions
1314. Matrix Block SumMediumView Solutions
1315. Sum of Nodes with Even-Valued GrandparentMediumView Solutions
1316. Distinct Echo SubstringsHardView Solutions
1317. Convert Integer to the Sum of Two No-Zero IntegersEasyView Solutions
1318. Minimum Flips to Make a OR b Equal to cMediumView Solutions
1319. Number of Operations to Make Network ConnectedMediumView Solutions
1320. Minimum Distance to Type a Word Using Two FingersHardView Solutions
1321. Restaurant GrowthMediumView Solutions
1322. Ads PerformanceEasyView Solutions
1323. Maximum 69 NumberEasyView Solutions
1324. Print Words VerticallyMediumView Solutions
1325. Delete Leaves With a Given ValueMediumView Solutions
1326. Minimum Number of Taps to Open to Water a GardenHardView Solutions
1327. List the Products Ordered in a PeriodEasyView Solutions
1328. Break a PalindromeMediumView Solutions
1329. Sort the Matrix DiagonallyMediumView Solutions
1330. Reverse Subarray To Maximize Array ValueHardView Solutions
1331. Rank Transform of an ArrayEasyView Solutions
1332. Remove Palindromic SubsequencesEasyView Solutions
1333. Filter Restaurants by Vegan-Friendly, Price and DistanceMediumView Solutions
1334. Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumView Solutions
1335. Minimum Difficulty of a Job ScheduleHardView Solutions
1336. Number of Transactions per VisitHardView Solutions
1337. The K Weakest Rows in a MatrixEasyView Solutions
1338. Reduce Array Size to The HalfMediumView Solutions
1339. Maximum Product of Splitted Binary TreeMediumView Solutions
1340. Jump Game VHardView Solutions
1341. The K Weakest Rows in a MatrixEasyView Solutions
1342. Reduce Array Size to The HalfMediumView Solutions
1343. Maximum Product of Splitted Binary TreeMediumView Solutions
1344. Jump Game VHardView Solutions
1345. List the Products Ordered in a PeriodEasyView Solutions
1346. Break a PalindromeMediumView Solutions
1347. Sort the Matrix DiagonallyMediumView Solutions
1348. Reverse Subarray To Maximize Array ValueHardView Solutions
1349. Rank Transform of an ArrayEasyView Solutions
1350. Remove Palindromic SubsequencesEasyView Solutions
1351. Filter Restaurants by Vegan-Friendly, Price and DistanceMediumView Solutions
1352. Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumView Solutions
1353. Minimum Difficulty of a Job ScheduleHardView Solutions
1354. Number of Transactions per VisitHardView Solutions
1355. The K Weakest Rows in a MatrixEasyView Solutions
1356. Reduce Array Size to The HalfMediumView Solutions
1357. Maximum Product of Splitted Binary TreeMediumView Solutions
1358. Jump Game VHardView Solutions
1359. List the Products Ordered in a PeriodEasyView Solutions
1360. Break a PalindromeMediumView Solutions
1361. Sort the Matrix DiagonallyMediumView Solutions
1362. Reverse Subarray To Maximize Array ValueHardView Solutions
1363. Rank Transform of an ArrayEasyView Solutions
1364. Remove Palindromic SubsequencesEasyView Solutions
1365. Filter Restaurants by Vegan-Friendly, Price and DistanceMediumView Solutions
1366. Find the City With the Smallest Number of Neighbors at a Threshold DistanceMediumView Solutions
1367. Minimum Difficulty of a Job ScheduleHardView Solutions
1368. Number of Transactions per VisitHardView Solutions
1369. The K Weakest Rows in a MatrixEasyView Solutions
1370. Reduce Array Size to The HalfMediumView Solutions
1371. Find the Longest Substring Containing Vowels in Even CountsMediumView Solutions
1372. Longest ZigZag Path in a Binary TreeMediumView Solutions
1373. Maximum Sum BST in Binary TreeHardView Solutions
1374. Generate a String With Characters That Have Odd CountsEasyView Solutions
1375. Bulb Switcher IIIMediumView Solutions
1376. Time Needed to Inform All EmployeesMediumView Solutions
1377. Frog Position After T SecondsHardView Solutions
1378. Replace Elements with Greatest Element on Right SideEasyView Solutions
1379. Find a Corresponding Node of a Binary Tree in a Clone of That TreeMediumView Solutions
1380. Lucky Numbers in a MatrixEasyView Solutions
1381. Design a Stack With Increment OperationMediumView Solutions
1382. Balance a Binary Search TreeMediumView Solutions
1383. Maximum Performance of a TeamHardView Solutions
1384. Count Good Nodes in Binary TreeMediumView Solutions
1385. Find the Distance Value Between Two ArraysEasyView Solutions
1386. Cinema Seat AllocationMediumView Solutions
1387. Sort Integers by The Power ValueMediumView Solutions
1388. Pizza With 3n SlicesHardView Solutions
1389. Create Target Array in the Given OrderEasyView Solutions
1390. Four DivisorsMediumView Solutions
1391. Check if There is a Valid Path in a GridMediumView Solutions
1392. Longest Happy PrefixHardView Solutions
1393. Capital Gain/LossMediumView Solutions
1394. Find Lucky Integer in an ArrayEasyView Solutions
1395. Count Number of TeamsMediumView Solutions
1396. Design Underground SystemMediumView Solutions
1397. Find All Good StringsHardView Solutions
1398. Customers Who Bought Products A and B but Not CMediumView Solutions
1399. Count Largest GroupEasyView 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.