Valid Anagram ( LeetCode ) Problem Solution. Given two strings s and t , write a function to see if t is an anagram of s . Example 1: Input: s = "anagram", t = "n…
Integer Replacement ( LeetCode ) Problem Solution. Example 1: Input: 8 Output: 3 Explanation: 8 -> 4 -> 2 -> 1 Example 2: Input: 7 Output: 4 Explanation: 7 -&g…
Add to Array-Form of Integer ( LeetCode ) Problem Solution. Example 1: Input: A = [1,2,0,0] , K = 34 Output: [1,2,3,4] Explanation: 1200 + 34 = 1234 Example 2: Input: A = [2,7,4] ,…
Plus One ( LeetCode ) Problem Solution. The digits are stored specified the foremost significant figure is at the pinnacle of the list, and every element within the array contain…
Excel Sheet Column Number ( LeetCode ) Problem Solution. For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 ... Example 1: I…
Find N Unique Integers Sum up to Zero (LeetCode ) Problem Solution. Example 1: Input: n = 5 Output: [-7,-1,1,3,4] Explanation: These arrays are also accepted [-5,-1,1,2,3] , [-3,-1,2,-…
Minimum Absolute Difference ( LeetCode ) Problem Solution. Example 1: Input: arr = [4,2,1,3] Output: [[1,2],[2,3],[3,4]] Explanation: The minimum absolute difference is 1. List all pair…
Minimum Remove to Make Valid Parentheses ( LeetCode ) Problem Solution. Example 1: Input: s = "lee(t(c)o)de)" Output: "lee(t(c)o)de" Explanation: "lee(t(co)de)…
Convert Integer to the Sum of Two No-Zero Integers ( LeetCode ) Problem Solution. Given an integer n . No-Zero integer could be a positive integer which does not contain any 0 in its de…
Search in Rotated Sorted Array II ( LeetCode ) Problem Solution. You are given a target value to to looking. If found within the array return true , otherwise return false . Example 1: …
Search in Rotated Sorted Array ( LeetCode ) Problem Solution. You are given a target value to look. If found within the array return its index, otherwise return -1 . You may assume no d…
Social Plugin