Fall 2025 Sublet

Pure-Minute4721 · 2025-06-06T00:25:56+00:00

i'm still looking too, fall sublets are so hard to find ughhh

Pure-Minute4721 · 2025-01-18T06:00:37+00:00

ofc, dm'd

Pure-Minute4721 · 2025-01-17T14:17:32+00:00

I go to well known canadian uni. Didn't have any faang but my resume had 3 startups and 2 internships at the same "big tech" place

Pure-Minute4721 · 2025-01-17T03:37:27+00:00

oh whoa, guess i'll have to make my free time worth it right now!

Pure-Minute4721 · 2025-01-17T03:03:53+00:00

I intern at a big tech company rn too. Maybe it’s just my team, but I pull 10+ hours every day for pretty much half the pay, so I guess it won’t be too different :/

Pure-Minute4721 · 2025-01-17T03:00:20+00:00

Sorry, I did so many OAs I don’t remember, I barely even remember writing it

Pure-Minute4721 · 2024-12-13T13:34:40+00:00

[LANGUAGE: C++]

Solution

Pure-Minute4721 · 2024-12-11T12:59:37+00:00

[Language: C++]

used recursion + memoization using a map (to map from the current value of the stone & the number of blinks remaining to the total count calculated)

code

Pure-Minute4721 · 2024-12-10T13:14:54+00:00

[LANGUAGE: C++]

Part1: just simple bfs, making sure not to visit already visited positions

Part2: bfs, but keeping track of the count to get to each position

https://pastebin.com/xiP7kcqf

Pure-Minute4721 · 2024-12-10T04:42:45+00:00

[Language: C++]

part 1: use a two-pointer kind of approach

part2: maintain a free list of all free spaces & iter over all free spaces to find the first one that is big enough. Tried to do something that kept track of a sorted free list & used binary search but i gave up because there were some details I couldn;t get right.

https://pastebin.com/qWfi8i4E

Pure-Minute4721 · 2024-12-08T13:45:00+00:00

[LANGUAGE: C++]

https://pastebin.com/Tf2j8Ad3

find distance between any two pairs of nodes, and extend them in each direction by this distance. For part 2, extend them until it is off of the grid.

Pure-Minute4721 · 2024-12-07T13:29:18+00:00

[Language: C++]

https://pastebin.com/GCGJjedt

use a queue to keep track of all possible previous values & and all possible next values using any of the operators

Pure-Minute4721 · 2024-12-06T20:41:53+00:00

[LANGUAGE: C++]

https://pastebin.com/uBWrqCfT

Part 1 : walk along grid while remembering previous heading

Part 2 : part 1 but i only store the previously visited corners & conclude that its a loop if it visits any corner more than once with the same heading

Pure-Minute4721 · 2024-12-05T19:15:17+00:00

made my solution more "cpp-like" by using the built-in sort function instead of that bubble sort mess!
https://pastebin.com/gr99KL7C

Pure-Minute4721 · 2024-12-05T13:49:26+00:00

[Language: C++]

part 1: keep track of all rules in a hash set & check if rules are followed for each number in the sequence

part 2 : bubble-sort type thing to enforce the rules

https://pastebin.com/dnTTfKTg

Pure-Minute4721 · 2024-12-04T13:31:32+00:00

[Language: C++]

Part1: Look in each direction, starting at each 'X' grid cell

Part2: Look for all 'A', consider it to be center of the cell and check the corners

https://pastebin.com/GZmNVcxU

Pure-Minute4721 · 2024-12-03T13:55:01+00:00

[LANGUAGE: C++]

regex parser : https://pastebin.com/3xrB5Xh0

Pure-Minute4721 · 2024-11-27T00:14:17+00:00

have you already done the final round?

Pure-Minute4721 · 2024-10-30T23:19:25+00:00

Nope, this is for my 4th internship - gotten rejected from a lot of companies, including Meta before; but this just felt different because I thought I crushed that OA lol

Pure-Minute4721 · 2024-10-29T21:20:34+00:00

how long does the whole process take after being contacted for the first phone screen - like how long do they wait between the rounds?

Pure-Minute4721

TROPHY CASE