| title | description | hide_table_of_contents | sidebar_position | keywords | ||||
|---|---|---|---|---|---|---|---|---|
Programming Skills (Basic) |
true |
10 |
|
export const problems = [ { "problemName": "1523. Count Odd Numbers in an Interval Range", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/count-odd-numbers-in-an-interval-range", "solutionLink": "../../solutions/1500-1599/count-odd-numbers-in-an-interval-range-easy" }, { "problemName": "1491. Average Salary Excluding the Minimum and Maximum Salary", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary", "solutionLink": "../../solutions/1400-1499/average-salary-excluding-the-minimum-and-maximum-salary-easy" }, { "problemName": "191. Number of 1 Bits", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/number-of-1-bits", "solutionLink": "../../solutions/0100-0199/number-of-1-bits-easy" }, { "problemName": "1281. Subtract the Product and Sum of Digits of an Integer", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer", "solutionLink": "../../solutions/1200-1299/subtract-the-product-and-sum-of-digits-of-an-integer-easy" }, { "problemName": "976. Largest Perimeter Triangle", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/largest-perimeter-triangle", "solutionLink": "../../solutions/0900-0999/largest-perimeter-triangle-easy" }, { "problemName": "1779. Find Nearest Point That Has the Same X or Y Coordinate", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate", "solutionLink": "../../solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate-easy" }, { "problemName": "1822. Sign of the Product of an Array", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/sign-of-the-product-of-an-array", "solutionLink": "../../solutions/1800-1899/sign-of-the-product-of-an-array-easy" }, { "problemName": "1502. Can Make Arithmetic Progression From Sequence", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence", "solutionLink": "../../solutions/1500-1599/can-make-arithmetic-progression-from-sequence-easy" }, { "problemName": "202. Happy Number", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/happy-number/", "solutionLink": "../../solutions/0200-0299/happy-number-easy" }, { "problemName": "1790. Check if One String Swap Can Make Strings Equal", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal", "solutionLink": "../../solutions/1700-1799/check-if-one-string-swap-can-make-strings-equal-easy" }, { "problemName": "589. N-ary Tree Preorder Traversal", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/n-ary-tree-preorder-traversal", "solutionLink": "../../solutions/0500-0599/n-ary-tree-preorder-traversal-easy" }, { "problemName": "496. Next Greater Element I", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/next-greater-element-i", "solutionLink": "../solutions/0400-0499/next-greater-element-i-easy" }, { "problemName": "1232. Check If It Is a Straight Line", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/check-if-it-is-a-straight-line", "solutionLink": "../../solutions/1200-1299/check-if-it-is-a-straight-line-easy" }, { "problemName": "1588. Sum of All Odd Length Subarrays", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays/", "solutionLink": "../../solutions/1500-1599/sum-of-all-odd-length-subarrays-easy" }, { "problemName": "283. Move Zeroes", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/move-zeroes/", "solutionLink": "../../solutions/0200-0299/move-zeroes-easy" }, { "problemName": "1672. Richest Customer Wealth", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/richest-customer-wealth", "solutionLink": "../../solutions/1600-1699/richest-customer-wealth-easy" }, { "problemName": "1572. Matrix Diagonal Sum", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/matrix-diagonal-sum", "solutionLink": "../../solutions/1500-1599/matrix-diagonal-sum-easy" }, { "problemName": "566. Reshape the Matrix", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/reshape-the-matrix", "solutionLink": "" }, { "problemName": "1768. Merge Strings Alternately", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/merge-strings-alternately", "solutionLink": "../../solutions/1700-1799/merge-strings-alternately-easy" }, { "problemName": "1678. Goal Parser Interpretation", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/goal-parser-interpretation", "solutionLink": "" }, { "problemName": "389. Find the Difference", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/find-the-difference", "solutionLink": "../../solutions/0300-0399/find-the-difference-easy" }, { "problemName": "709. To Lower Case", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/to-lower-case", "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": "953. Verifying an Alien Dictionary", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/verifying-an-alien-dictionary", "solutionLink": "" }, { "problemName": "1290. Convert Binary Number in a Linked List to Integer", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer", "solutionLink": "" }, { "problemName": "876. Middle of the Linked List", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/middle-of-the-linked-list", "solutionLink": "" }, { "problemName": "104. Maximum Depth of Binary Tree", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/maximum-depth-of-binary-tree/", "solutionLink": "../../solutions/0100-0199/maximum-depth-of-binary-tree-easy" }, { "problemName": "404. Sum of Left Leaves", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/sum-of-left-leaves", "solutionLink": "../../solutions/0400-0499/sum-of-left-leaves-easy" }, { "problemName": "1356. Sort Integers by The Number of 1 Bits", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits", "solutionLink": "../../solutions/1300-1399/sort-integers-by-the-number-of-1-bits-easy" }, { "problemName": "232. Implement Queue using Stacks", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/implement-queue-using-stacks", "solutionLink": "" }, { "problemName": "242. Valid Anagram", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/valid-anagram/", "solutionLink": "" }, { "problemName": "217. Contains Duplicate", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/contains-duplicate", "solutionLink": "../../solutions/0200-0299/contains-duplicate-easy" }, { "problemName": "1603. Design Parking System", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/design-parking-system/", "solutionLink": "" }, { "problemName": "303. Range Sum Query - Immutable", "difficulty": "Easy", "leetCodeLink": "https://leetcode.com/problems/range-sum-query-immutable", "solutionLink": "" } ]