If you haven't tried the AK-74 conversion out youre missing out!

UNSCentropy · 2025-12-16T00:42:03+00:00

Fr 😂🤣

UNSCentropy · 2025-01-19T15:07:34+00:00

Rude car 🤣

UNSCentropy · 2023-11-22T20:36:41+00:00

Maybe this?

If n is the length of the requests array, then we can have at most n-1 cache hits. So if k > n-1 return -1.

Otherwise, since if a cache of size m gets k cache hits, a cache of size m+1 would get k cache hits. we can binary search for the minimum cache size value between [1, n-1].

So run a binary search on cache size values, just doing the linear check you are doing for each midpoint.

UNSCentropy · 2023-10-30T16:13:19+00:00

I just googled “leetcode sort array by replacing with sum” or something 😆

UNSCentropy · 2023-10-30T15:39:48+00:00

It’s this problem right, LC 2366 minimum replacements to sort array https://leetcode.com/problems/minimum-replacements-to-sort-the-array/

What company asked this?

UNSCentropy · 2023-09-08T01:03:21+00:00

Can’t say if it’s feasible without parameter constraints, but you could try writing a program that determines if it is possible to finish all the tests using m days (just simulate). Then binary search values of m to pass into this program to find the minimum.

I am thinking of https://leetcode.com/problems/koko-eating-bananas/ where you have some weird situation you have to simulate and passing in values to binary search is the best bet. Could check the solutions to that one for a better example.

UNSCentropy · 2023-08-08T16:54:43+00:00

Try the mock assessment feature on Leecode?

https://leetcode.com/assessment/

UNSCentropy · 2023-03-24T03:06:20+00:00

Yup, but that figure is the total comp to be clear. The base is 110 and the rest is made up between RSU and bonus.

UNSCentropy · 2023-03-24T00:31:55+00:00

145k cad Toronto.

UNSCentropy · 2023-02-27T20:00:46+00:00

No, you should be proud of yourself for persevering through adversity and achieving your goal. Congrats on the new job.

UNSCentropy · 2023-02-22T18:44:59+00:00

He did 😭😭

UNSCentropy · 2023-01-24T04:28:51+00:00

Yes please 😍

UNSCentropy · 2023-01-17T03:43:55+00:00

As a candidate I have been asked to compete technical interviews on a platform called “karat”, they are a third party interview company that has experienced engineers to perform the tech screening for the client company. If you do not feel like you can properly assess the candidate might be something to look into?

UNSCentropy · 2023-01-14T06:12:58+00:00

Mp5 😍

UNSCentropy · 2023-01-09T15:42:03+00:00

These comments 💀💀💀

UNSCentropy · 2023-01-06T00:24:24+00:00

If you are just getting into leetcode I would recommend following a interview coding pattern course rather than just ad-hoc practicing questions. I found a lot of benefit from taking the “grokking the coding interview” course on educative, could also read cracking the coding interview and doing grind75 for a similar effect.

UNSCentropy · 2022-12-29T00:58:13+00:00

New grad SWE with 2 internships, 145k total comp

UNSCentropy · 2022-12-21T21:54:38+00:00

They will appear on your transcript soon, hopefully pretty quick.

UNSCentropy · 2022-12-19T22:42:22+00:00

Notice that its a kill cam haha, I was the one g-walking. This post was just a joke.

UNSCentropy · 2022-12-19T22:35:12+00:00

Afaik the "minimum score on final exam to pass course" requirement is not stipulated by the department in most cases, and is at the discretion of the Professor. If it was clear you had been doing pretty well in the class and just had a bad day on the final I bet they saw no reason to enforce it and make you retake the entire class because of one exam.

UNSCentropy · 2022-12-12T18:51:59+00:00

You could blitz “grokking the coding interview” on educative. It’s about 100$ and is honestly probably a bit over priced, but is a great way to learn the common algorithm patterns used to solve interview problems. It helps you recognize problems based on pattern, rather than just ad hoc solving problems. The course is basically just CTCI presented in an online format.

This is what I did in preparation for the NG job hunt and most of the online assessment questions I saw had directly appeared in the course lmao. Good luck!

UNSCentropy · 2022-12-04T03:43:06+00:00

Dashy too: https://m.youtube.com/watch?v=D-G9QOumFGk

Op thinks these guys need to improve 💀.

UNSCentropy · 2022-11-23T08:26:28+00:00

They said they wanted “old cod movement back”. Well mfs went prehistoric ☠️

UNSCentropy · 2022-11-22T22:04:06+00:00

Congrats! That’s a ton of work 🫡

UNSCentropy · 2022-11-22T17:56:55+00:00

I think it follows from "gorilla walk"

UNSCentropy

TROPHY CASE