From 5a49d867f65a0e0271cfbebe015c8a57e29d31bd Mon Sep 17 00:00:00 2001 From: Niharika Shah Date: Sat, 25 May 2024 19:21:30 +0530 Subject: [PATCH] leetcode 1300-1399 --- dsa-problems/leetcode-problems/1300-1399.md | 622 ++++++++++++++++++++ 1 file changed, 622 insertions(+) diff --git a/dsa-problems/leetcode-problems/1300-1399.md b/dsa-problems/leetcode-problems/1300-1399.md index e69de29bb..fe0fd3f18 100644 --- a/dsa-problems/leetcode-problems/1300-1399.md +++ b/dsa-problems/leetcode-problems/1300-1399.md @@ -0,0 +1,622 @@ +--- +id: 1300-1399 +title: LeetCode Problems 1300 - 1399 +sidebar_label: 1300 - 1399 +keywords: + - LeetCode + - LeetCode Problems + - LeetCode Problems 1300 - 1399 + - DSA problems +--- + +export const problems = [ + { + "problemName": "1300. Sum of Mutated Array Closest to Target", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sum-of-mutated-array-closest-to-target", + "solutionLink": "#" + }, + { + "problemName": "1301. Number of Paths with Max Score", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-paths-with-max-score", + "solutionLink": "#" + }, + { + "problemName": "1302. Deepest Leaves Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/deepest-leaves-sum", + "solutionLink": "#" + }, + { + "problemName": "1303. Find the Team Size", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-the-team-size", + "solutionLink": "#" + }, + { + "problemName": "1304. Find N Unique Integers Sum up to Zero", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero", + "solutionLink": "#" + }, + { + "problemName": "1305. All Elements in Two Binary Search Trees", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/all-elements-in-two-binary-search-trees", + "solutionLink": "#" + }, + { + "problemName": "1306. Jump Game III", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/jump-game-iii", + "solutionLink": "#" + }, + { + "problemName": "1307. Verbal Arithmetic Puzzle", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/verbal-arithmetic-puzzle", + "solutionLink": "#" + }, + { + "problemName": "1308. Running Total for Different Genders", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/running-total-for-different-genders", + "solutionLink": "#" + }, + { + "problemName": "1309. Decrypt String from Alphabet to Integer Mapping", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping", + "solutionLink": "#" + }, + { + "problemName": "1310. XOR Queries of a Subarray", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/xor-queries-of-a-subarray", + "solutionLink": "#" + }, + { + "problemName": "1311. Get Watched Videos by Your Friends", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/get-watched-videos-by-your-friends", + "solutionLink": "#" + }, + { + "problemName": "1312. Minimum Insertion Steps to Make a String Palindrome", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome", + "solutionLink": "#" + }, + { + "problemName": "1313. Decompress Run-Length Encoded List", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/decompress-run-length-encoded-list", + "solutionLink": "#" + }, + { + "problemName": "1314. Matrix Block Sum", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/matrix-block-sum", + "solutionLink": "#" + }, + { + "problemName": "1315. Sum of Nodes with Even-Valued Grandparent", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent", + "solutionLink": "#" + }, + { + "problemName": "1316. Distinct Echo Substrings", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/distinct-echo-substrings", + "solutionLink": "#" + }, + { + "problemName": "1317. Convert Integer to the Sum of Two No-Zero Integers", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers", + "solutionLink": "#" + }, + { + "problemName": "1318. Minimum Flips to Make a OR b Equal to c", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c", + "solutionLink": "#" + }, + { + "problemName": "1319. Number of Operations to Make Network Connected", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/number-of-operations-to-make-network-connected", + "solutionLink": "#" + }, + { + "problemName": "1320. Minimum Distance to Type a Word Using Two Fingers", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers", + "solutionLink": "#" + }, + { + "problemName": "1321. Restaurant Growth", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/restaurant-growth", + "solutionLink": "#" + }, + { + "problemName": "1322. Ads Performance", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/ads-performance", + "solutionLink": "#" + }, + { + "problemName": "1323. Maximum 69 Number", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/maximum-69-number", + "solutionLink": "#" + }, + { + "problemName": "1324. Print Words Vertically", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/print-words-vertically", + "solutionLink": "#" + }, + { + "problemName": "1325. Delete Leaves With a Given Value", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/delete-leaves-with-a-given-value", + "solutionLink": "#" + }, + { + "problemName": "1326. Minimum Number of Taps to Open to Water a Garden", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden", + "solutionLink": "#" + }, + { + "problemName": "1327. List the Products Ordered in a Period", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/list-the-products-ordered-in-a-period", + "solutionLink": "#" + }, + { + "problemName": "1328. Break a Palindrome", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/break-a-palindrome", + "solutionLink": "#" + }, + { + "problemName": "1329. Sort the Matrix Diagonally", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-the-matrix-diagonally", + "solutionLink": "#" + }, + { + "problemName": "1330. Reverse Subarray To Maximize Array Value", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/reverse-subarray-to-maximize-array-value", + "solutionLink": "#" + }, + { + "problemName": "1331. Rank Transform of an Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/rank-transform-of-an-array", + "solutionLink": "#" + }, + { + "problemName": "1332. Remove Palindromic Subsequences", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-palindromic-subsequences", + "solutionLink": "#" + }, + { + "problemName": "1333. Filter Restaurants by Vegan-Friendly, Price and Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance", + "solutionLink": "#" + }, + { + "problemName": "1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", + "solutionLink": "#" + }, + { + "problemName": "1335. Minimum Difficulty of a Job Schedule", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule", + "solutionLink": "#" + }, + { + "problemName": "1336. Number of Transactions per Visit", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-transactions-per-visit", + "solutionLink": "#" + }, + { + "problemName": "1337. The K Weakest Rows in a Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix", + "solutionLink": "#" + }, + { + "problemName": "1338. Reduce Array Size to The Half", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reduce-array-size-to-the-half", + "solutionLink": "#" + }, + { + "problemName": "1339. Maximum Product of Splitted Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1340. Jump Game V", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/jump-game-v", + "solutionLink": "#" + }, + { + "problemName": "1341. The K Weakest Rows in a Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix", + "solutionLink": "#" + }, + { + "problemName": "1342. Reduce Array Size to The Half", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reduce-array-size-to-the-half", + "solutionLink": "#" + }, + { + "problemName": "1343. Maximum Product of Splitted Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1344. Jump Game V", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/jump-game-v", + "solutionLink": "#" + }, + { + "problemName": "1345. List the Products Ordered in a Period", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/list-the-products-ordered-in-a-period", + "solutionLink": "#" + }, + { + "problemName": "1346. Break a Palindrome", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/break-a-palindrome", + "solutionLink": "#" + }, + { + "problemName": "1347. Sort the Matrix Diagonally", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-the-matrix-diagonally", + "solutionLink": "#" + }, + { + "problemName": "1348. Reverse Subarray To Maximize Array Value", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/reverse-subarray-to-maximize-array-value", + "solutionLink": "#" + }, + { + "problemName": "1349. Rank Transform of an Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/rank-transform-of-an-array", + "solutionLink": "#" + }, + { + "problemName": "1350. Remove Palindromic Subsequences", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-palindromic-subsequences", + "solutionLink": "#" + }, + { + "problemName": "1351. Filter Restaurants by Vegan-Friendly, Price and Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance", + "solutionLink": "#" + }, + { + "problemName": "1352. Find the City With the Smallest Number of Neighbors at a Threshold Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", + "solutionLink": "#" + }, + { + "problemName": "1353. Minimum Difficulty of a Job Schedule", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule", + "solutionLink": "#" + }, + { + "problemName": "1354. Number of Transactions per Visit", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-transactions-per-visit", + "solutionLink": "#" + }, + { + "problemName": "1355. The K Weakest Rows in a Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix", + "solutionLink": "#" + }, + { + "problemName": "1356. Reduce Array Size to The Half", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reduce-array-size-to-the-half", + "solutionLink": "#" + }, + { + "problemName": "1357. Maximum Product of Splitted Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1358. Jump Game V", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/jump-game-v", + "solutionLink": "#" + }, + { + "problemName": "1359. List the Products Ordered in a Period", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/list-the-products-ordered-in-a-period", + "solutionLink": "#" + }, + { + "problemName": "1360. Break a Palindrome", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/break-a-palindrome", + "solutionLink": "#" + }, + { + "problemName": "1361. Sort the Matrix Diagonally", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-the-matrix-diagonally", + "solutionLink": "#" + }, + { + "problemName": "1362. Reverse Subarray To Maximize Array Value", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/reverse-subarray-to-maximize-array-value", + "solutionLink": "#" + }, + { + "problemName": "1363. Rank Transform of an Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/rank-transform-of-an-array", + "solutionLink": "#" + }, + { + "problemName": "1364. Remove Palindromic Subsequences", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/remove-palindromic-subsequences", + "solutionLink": "#" + }, + { + "problemName": "1365. Filter Restaurants by Vegan-Friendly, Price and Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance", + "solutionLink": "#" + }, + { + "problemName": "1366. Find the City With the Smallest Number of Neighbors at a Threshold Distance", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", + "solutionLink": "#" + }, + { + "problemName": "1367. Minimum Difficulty of a Job Schedule", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule", + "solutionLink": "#" + }, + { + "problemName": "1368. Number of Transactions per Visit", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/number-of-transactions-per-visit", + "solutionLink": "#" + }, + { + "problemName": "1369. The K Weakest Rows in a Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix", + "solutionLink": "#" + }, + { + "problemName": "1370. Reduce Array Size to The Half", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/reduce-array-size-to-the-half", + "solutionLink": "#" + }, + { + "problemName": "1371. Find the Longest Substring Containing Vowels in Even Counts", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts", + "solutionLink": "#" + }, + { + "problemName": "1372. Longest ZigZag Path in a Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1373. Maximum Sum BST in Binary Tree", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-sum-bst-in-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1374. Generate a String With Characters That Have Odd Counts", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts", + "solutionLink": "#" + }, + { + "problemName": "1375. Bulb Switcher III", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/bulb-switcher-iii", + "solutionLink": "#" + }, + { + "problemName": "1376. Time Needed to Inform All Employees", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/time-needed-to-inform-all-employees", + "solutionLink": "#" + }, + { + "problemName": "1377. Frog Position After T Seconds", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/frog-position-after-t-seconds", + "solutionLink": "#" + }, + { + "problemName": "1378. Replace Elements with Greatest Element on Right Side", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side", + "solutionLink": "#" + }, + { + "problemName": "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", + "solutionLink": "#" + }, + { + "problemName": "1380. Lucky Numbers in a Matrix", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/lucky-numbers-in-a-matrix", + "solutionLink": "#" + }, + { + "problemName": "1381. Design a Stack With Increment Operation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/design-a-stack-with-increment-operation", + "solutionLink": "#" + }, + { + "problemName": "1382. Balance a Binary Search Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/balance-a-binary-search-tree", + "solutionLink": "#" + }, + { + "problemName": "1383. Maximum Performance of a Team", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/maximum-performance-of-a-team", + "solutionLink": "#" + }, + { + "problemName": "1384. Count Good Nodes in Binary Tree", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-good-nodes-in-binary-tree", + "solutionLink": "#" + }, + { + "problemName": "1385. Find the Distance Value Between Two Arrays", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-the-distance-value-between-two-arrays", + "solutionLink": "#" + }, + { + "problemName": "1386. Cinema Seat Allocation", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/cinema-seat-allocation", + "solutionLink": "#" + }, + { + "problemName": "1387. Sort Integers by The Power Value", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/sort-integers-by-the-power-value", + "solutionLink": "#" + }, + { + "problemName": "1388. Pizza With 3n Slices", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/pizza-with-3n-slices", + "solutionLink": "#" + }, + { + "problemName": "1389. Create Target Array in the Given Order", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/create-target-array-in-the-given-order", + "solutionLink": "#" + }, + { + "problemName": "1390. Four Divisors", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/four-divisors", + "solutionLink": "#" + }, + { + "problemName": "1391. Check if There is a Valid Path in a Grid", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid", + "solutionLink": "#" + }, + { + "problemName": "1392. Longest Happy Prefix", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/longest-happy-prefix", + "solutionLink": "#" + }, + { + "problemName": "1393. Capital Gain/Loss", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/capital-gainloss", + "solutionLink": "#" + }, + { + "problemName": "1394. Find Lucky Integer in an Array", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/find-lucky-integer-in-an-array", + "solutionLink": "#" + }, + { + "problemName": "1395. Count Number of Teams", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/count-number-of-teams", + "solutionLink": "#" + }, + { + "problemName": "1396. Design Underground System", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/design-underground-system", + "solutionLink": "#" + }, + { + "problemName": "1397. Find All Good Strings", + "difficulty": "Hard", + "leetCodeLink": "https://leetcode.com/problems/find-all-good-strings", + "solutionLink": "#" + }, + { + "problemName": "1398. Customers Who Bought Products A and B but Not C", + "difficulty": "Medium", + "leetCodeLink": "https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c", + "solutionLink": "#" + }, + { + "problemName": "1399. Count Largest Group", + "difficulty": "Easy", + "leetCodeLink": "https://leetcode.com/problems/count-largest-group", + "solutionLink": "#" + } +] + + + +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. \ No newline at end of file