Category : Easy Problem Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Follow up: Could you solve it without converting the integer to a string? https://leetcode.com/problems/palindrome-number/ Examples Example 1: Example 2: Example 3: Example 4: Constraints -231 <= x <= 231 – 1 Solution Approach To check if the number is […]
Category : Easy Problem Given the array nums consisting of 2n elements in the form [x1,x2,…,xn,y1,y2,…,yn]. Return the array in the form [x1,y1,x2,y2,…,xn,yn]. https://leetcode.com/problems/shuffle-the-array/ Examples Example 1:
1 2 3 4 | Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7] Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. |
Example 2:
1 2 | Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] |
Example 3:
1 2 | Input: nums = [1,1,2,2], n = 2 Output: [1,2,1,2] |
Constraints: 1 <= n <= 500 nums.length == 2n 1 <= nums[i] <= 10^3 Solution Approach The solution is pretty straight forward you just need to find
Category : Easy Problem Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. leetcode.com/problems/valid-parentheses/ Examples: Example 1
1 2 | Input: s = "()" Output: true |
Example 2
1 2 | Input: s = "()[]{}" Output: true |
Example 3
1 2 | Input: s = "(]" Output: false |
Example
