---
title: "Michael Peattie (@physics2comp) | Hashnode"
description: "Michael Peattie (@physics2comp) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@physics2comp"
---

@physics2comp

# Michael Peattie

@physics2comp · Joined June 2025

### [Intro to Dynamic Programming - Problem 2771](https://learncodedaily.hashnode.dev/intro-to-dynamic-programming-problem-2771?utm_source=hashnode&utm_medium=feed)

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...

5 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/intro-to-dynamic-programming-problem-2771?utm_source=hashnode&utm_medium=feed)

[Jun 30, 2025](https://hashnode.com/posts/intro-to-dynamic-programming-problem-2771/68622eaefe316c6c0ddcd905)

### [Impulse Response Project Log 1: Raytracing around a Ring](https://learncodedaily.hashnode.dev/impulse-response-project-log-1-ray-tracing-around-a-ring?utm_source=hashnode&utm_medium=feed)

Goal 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...

4 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/impulse-response-project-log-1-ray-tracing-around-a-ring?utm_source=hashnode&utm_medium=feed)

[Jun 24, 2025](https://hashnode.com/posts/impulse-response-project-log-1-ray-tracing-around-a-ring/685a4f56edc7aff26d8c9d80)

### [Problem 167. Two Sum II \[Medium\]](https://learncodedaily.hashnode.dev/problem-167-two-sum-ii-medium?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/problem-167-two-sum-ii-medium?utm_source=hashnode&utm_medium=feed)

[Jun 24, 2025](https://hashnode.com/posts/problem-167-two-sum-ii-medium/685a1b90ced96660bb9eef1e)

### [Problem 49. Group Anagrams \[Medium\] - Hash Maps](https://learncodedaily.hashnode.dev/problem-49-group-anagrams-medium-hash-maps?utm_source=hashnode&utm_medium=feed)

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 ...

1 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/problem-49-group-anagrams-medium-hash-maps?utm_source=hashnode&utm_medium=feed)

[Jun 24, 2025](https://hashnode.com/posts/problem-49-group-anagrams-medium-hash-maps/685a16181aeddb1f0bdfa2b4)

### [Problem 34. Find First and Last Position of Element in Sorted Array \[Medium\]](https://learncodedaily.hashnode.dev/problem-34-find-first-and-last-position-of-element-in-sorted-array-medium?utm_source=hashnode&utm_medium=feed)

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...

3 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/problem-34-find-first-and-last-position-of-element-in-sorted-array-medium?utm_source=hashnode&utm_medium=feed)

[Jun 24, 2025](https://hashnode.com/posts/problem-34-find-first-and-last-position-of-element-in-sorted-array-medium/685a0eea9296b43ed2ce4935)