string
Add to Array-Form of Integer ( LeetCode ) Problem Solution.
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] ,…
string
Plus One ( LeetCode ) Problem Solution.
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…
python code
Find N Unique Integers Sum up to Zero ( LeetCode ) Problem Solution.
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,-…
python code
Minimum Absolute Difference ( LeetCode ) Problem Solution.
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…
string
Minimum Remove to Make Valid Parentheses ( LeetCode ) Problem Solution.
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)…
python code
Convert Integer to the Sum of Two No-Zero Integers ( LeetCode ) Problem Solution.
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…
python code
Search in Rotated Sorted Array II ( LeetCode ) Problem Solution.
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: …
python code
Search in Rotated Sorted Array ( LeetCode ) Problem Solution.
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…
python code
Find Minimum in Rotated Sorted Array ( LeetCode ) Problem Solution.
Find Minimum in Rotated Sorted Array ( LeetCode ) Problem Solution. Find the minimum element. You may assume no duplicate exists within the array. Example 1: Input: [3,4,5,1,2] Output: …
python code
Create Target Array in the Given Order ( LeetCode ) Problem Solution.
Create Target Array in the Given Order ( LeetCode ) Problem Solution. Example 1: Input: nums = [0,1,2,3,4], index = [0,1,2,2,1] Ou…
java
Sorting: Bubble Sort HackerRank Problem Solution
Sorting: Bubble Sort Solution :- …
Social Plugin