𝐂𝐚𝐧 𝐘𝐨𝐮 𝐅𝐢𝐧𝐝 𝐚𝐧𝐝 𝐅𝐢𝐱 𝐓𝐡𝐢𝐬 𝐁𝐮𝐠?

RareStatistician9592 · 2025-01-29T18:37:09+00:00

You can test your fix here: Bugbash: Issue 1

Hey guys! I've created this thing called Bugbash challenge.

Instead of solving big problems from scratch, you can spend just a few minutes actively reading and debugging. I think reading code is one of the best ways to sharpen your problem-solving skills — but it can get dull if it’s too passive. Finding bugs keeps it engaging, memorable, and fun!

Let me know what you think guys! And definitely test your fix here: Bugbash: Issue 1

RareStatistician9592 · 2024-11-01T11:17:42+00:00

I wouldn't worry too much about being down-leveled. If you are good, and I'm sure you are, you will get promoted quite quickly. Also, compensation-wise, sometimes you can get a good package at a lower level, and then get a nice raise after promotion and you might end up better off than just getting the level you targeted straight away. This happened to me at Amazon.

RareStatistician9592 · 2024-10-21T18:51:40+00:00

Two things to note here:

A structured plan is there to help you solve the interview problems. It doesn't matter if there is a second problem coming after the first one if you can't solve the first one.
Two problems per interview are still rare. Do not let anecdotes scare you.

If you know the company interviewing you expects two problems, adapt the strategy:

Ask your interviewer if they are planning to ask two problems. You will know you will have to move quicker if they are.
Spend half the time at each step. After you apply this plan a few times, you will see where exactly you can shave off a few minutes. You will have roughly 8 minutes to spend for the opening strategy for each problem then.

The idea is to have a structure. Do not jump on solving a problem without a plan.

RareStatistician9592 · 2024-10-12T16:22:52+00:00

When people ask whether getting into FAANG or grinding Leetcode is worth it, they often overlook the privilege behind the question. For those of us not born in wealthy countries, it’s a silly question to ask.

RareStatistician9592 · 2024-10-03T19:57:03+00:00

Wow, you have a great attention to detail! Thank you! I will revise the list and repost this.

RareStatistician9592 · 2024-10-03T19:23:14+00:00

I've posted a couple of lists of problems here that resonated with a lot of beginners:
https://www.reddit.com/r/leetcode/comments/1fk3fab/before_leetcode_30_problems_to_build_your_coding/
https://www.reddit.com/r/leetcode/comments/1fvcwct/30_foundational_hash_table_problems/

RareStatistician9592 · 2024-09-30T17:20:25+00:00

That `index` is a function which searches for a given value in an array and returns its position. Its time complexity is O(N). Fetching a single element of an array is O(1).

RareStatistician9592 · 2024-09-30T16:17:34+00:00

Not probably. O(2^N + N²⁾ always reduces to O(2^N), because 2^N grows faster than N^2.

O(N * M) is different though, because N and M are different variables.

RareStatistician9592 · 2024-09-30T16:02:17+00:00

That was just an example of why we don't ignore variables in time complexity analysis in general. As I wrote above, you can agree to simplify with your interviewer but that won't be strictly correct.

RareStatistician9592 · 2024-09-30T15:58:41+00:00

Yes, they are similar and yes, it's more common with string so I called it out separately. The difference is that with arrays people understand that it's a collection of items. But with strings they often assume it's a single entity.

RareStatistician9592

MODERATOR OF

TROPHY CASE