|
| 1 | +[ |
| 2 | + { |
| 3 | + "title": "Two Sum", |
| 4 | + "difficulty": "Easy", |
| 5 | + "topic": "Arrays", |
| 6 | + "description": "Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input has exactly one solution.", |
| 7 | + "examples": [ |
| 8 | + { "input": "nums = [2,7,11,15], target = 9", "output": "[0,1]", "explanation": "nums[0] + nums[1] == 9" } |
| 9 | + ], |
| 10 | + "templates": [ |
| 11 | + { "language": "JAVASCRIPT", "starterCode": "var twoSum = function(nums, target) { }" }, |
| 12 | + { "language": "PYTHON", "starterCode": "def two_sum(nums: List[int], target: int) -> List[int]: pass" } |
| 13 | + ], |
| 14 | + "link": "https://leetcode.com/problems/two-sum/" |
| 15 | + }, |
| 16 | + { |
| 17 | + "title": "Reverse Linked List", |
| 18 | + "difficulty": "Easy", |
| 19 | + "topic": "Data Structures", |
| 20 | + "description": "Reverse a singly linked list and return the reversed list.", |
| 21 | + "examples": [ |
| 22 | + { "input": "head = [1,2,3,4,5]", "output": "[5,4,3,2,1]" } |
| 23 | + ], |
| 24 | + "templates": [ |
| 25 | + { "language": "JAVASCRIPT", "starterCode": "var reverseList = function(head) { }" }, |
| 26 | + { "language": "PYTHON", "starterCode": "def reverseList(head: Optional[ListNode]) -> Optional[ListNode]: pass" } |
| 27 | + ], |
| 28 | + "link": "https://leetcode.com/problems/reverse-linked-list/" |
| 29 | + }, |
| 30 | + { |
| 31 | + "title": "Binary Tree Level Order Traversal", |
| 32 | + "difficulty": "Medium", |
| 33 | + "topic": "Data Structures", |
| 34 | + "description": "Given the root of a binary tree, return the level order traversal of its nodes' values (from left to right, level by level).", |
| 35 | + "examples": [ |
| 36 | + { "input": "root = [3,9,20,null,null,15,7]", "output": "[[3],[9,20],[15,7]]" } |
| 37 | + ], |
| 38 | + "templates": [ |
| 39 | + { "language": "JAVASCRIPT", "starterCode": "var levelOrder = function(root) { }" }, |
| 40 | + { "language": "PYTHON", "starterCode": "def levelOrder(root: Optional[TreeNode]) -> List[List[int]]: pass" } |
| 41 | + ], |
| 42 | + "link": "https://leetcode.com/problems/binary-tree-level-order-traversal/" |
| 43 | + }, |
| 44 | + { |
| 45 | + "title": "Longest Increasing Subsequence", |
| 46 | + "difficulty": "Medium", |
| 47 | + "topic": "Algorithms", |
| 48 | + "description": "Given an integer array nums, return the length of the longest strictly increasing subsequence.", |
| 49 | + "examples": [ |
| 50 | + { "input": "nums = [10,9,2,5,3,7,101,18]", "output": "4", "explanation": "The LIS is [2,3,7,101]" } |
| 51 | + ], |
| 52 | + "templates": [ |
| 53 | + { "language": "JAVA", "starterCode": "class Solution { public int lengthOfLIS(int[] nums) { return 0; } }" }, |
| 54 | + { "language": "PYTHON", "starterCode": "def lengthOfLIS(nums: List[int]) -> int: pass" } |
| 55 | + ], |
| 56 | + "link": "https://leetcode.com/problems/longest-increasing-subsequence/" |
| 57 | + }, |
| 58 | + { |
| 59 | + "title": "Valid Parentheses", |
| 60 | + "difficulty": "Easy", |
| 61 | + "topic": "String", |
| 62 | + "description": "Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.", |
| 63 | + "examples": [ |
| 64 | + { "input": "s = '()[]{}'", "output": "true" }, |
| 65 | + { "input": "s = '(]'", "output": "false" } |
| 66 | + ], |
| 67 | + "templates": [ |
| 68 | + { "language": "JAVASCRIPT", "starterCode": "var isValid = function(s) { }" }, |
| 69 | + { "language": "PYTHON", "starterCode": "def isValid(s: str) -> bool: pass" } |
| 70 | + ], |
| 71 | + "link": "https://leetcode.com/problems/valid-parentheses/" |
| 72 | + } |
| 73 | +] |
0 commit comments