Search for a command to run...
Series
This series covers my progress through Leetcode problems. I add to it almost daily discussing my attempts at solutions, time and space complexities and the most optimal solution to the problem.
Description You are given two 0-indexed integer arrays nums1 and nums2 of length n. Let's define another 0-indexed integer array, nums3, of length n. For each index i in the range [0, n - 1], you can assign either nums1[i] or nums2[i] to nums3[i]. Yo...
Description Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index<sub>1</sub>] and numbers[index<sub>2</s...
Description Given an array of strings strs, group the anagrams together. You can return the answer in any order. First Solution [Time: O(n*k), Space O(n*k)] def groupAnagrams(self, strs: List[str]) -> List[List[str]]: # initialise hash map ...
Description Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complex...
Description Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. First Solution [Time: O(n), Space: O(n)] def sortArrayByParity(self, n...
Description 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 close...