MPMichael Peattieinlearncodedaily.hashnode.dev·Jun 30, 2025 · 5 min readIntro to Dynamic Programming - Problem 2771Description 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...00
MPMichael Peattieinlearncodedaily.hashnode.dev·Jun 24, 2025 · 4 min readImpulse Response Project Log 1: Raytracing around a RingGoal Simulate acoustic impulse responses (IRs) for convolutional reverb in different geometries. Start with a simple ring geometry, then move on to more exotic spaces like a Möbius strip. What I Did Set up a ring geometry with a listener/microph...00
MPMichael Peattieinlearncodedaily.hashnode.dev·Jun 24, 2025 · 1 min readProblem 167. Two Sum II [Medium]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...00
MPMichael Peattieinlearncodedaily.hashnode.dev·Jun 24, 2025 · 1 min readProblem 49. Group Anagrams [Medium] - Hash MapsDescription 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 ...00
MPMichael Peattieinlearncodedaily.hashnode.dev·Jun 24, 2025 · 3 min readProblem 34. Find First and Last Position of Element in Sorted Array [Medium]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...00