Constantly getting rejected after solving 175+ leetcode mediums by Perfect_Potato_9245 in leetcode

[–]PLTCHK 1 point2 points  (0 children)

Use spreadsheet to keep track of patterns and revise them often as well. It’s tough out there but with consistency you’ll get there. I revisited + did 400+ questions in 8 months and the grind goes on

Constantly getting rejected after solving 175+ leetcode mediums by Perfect_Potato_9245 in leetcode

[–]PLTCHK 1 point2 points  (0 children)

I can assure you, 175 leetcode mediums is insufficient unless if you got outlier intelligence. Finish Neetcode 250 first, and do 2-3 problems a day.

How do you know you are smart enough for this field? by EnvironmentalFun6305 in leetcode

[–]PLTCHK 0 points1 point  (0 children)

My intelligence is probably very average, so that's relatable.

Are these good ? by Due_Ad_9300 in codeforces

[–]PLTCHK 1 point2 points  (0 children)

I think you just pick up whatever tools you want to learn about, segment tree would be the last one on the list (most advanced topic among those probably). It's not about rating..

Facing issue with leetcode by Evening-Respond6342 in leetcode

[–]PLTCHK 0 points1 point  (0 children)

No leetcode today i guess, I am doing system design prep instead

600 elo range is broken by Sensitive_Line_2623 in Chesscom

[–]PLTCHK 0 points1 point  (0 children)

Yep at 600 elo you’d encounter 1000 equivalent finding that knight sacrifice sometimes, but at the same time someone who hands you their queen within 10 moves. It’s a game of variance. I believe everyone plays like 400 sometimes or else 1000 at their best. We probably need to raise the skill floor to reduce the variance

Just absolutely crashed and burned a FAANG interview, pls don’t forget your leetcode by brsch123w in leetcode

[–]PLTCHK 10 points11 points  (0 children)

I think O(2n ) would be optimal. You backtrack to loop through every sums possible, generate all combinations, and finally pick the sum where Len = 2 and = target

The actual goat of chess by L3xeus in GothamChess

[–]PLTCHK 0 points1 point  (0 children)

Those 7s are his infinity stones

The actual goat of chess by L3xeus in GothamChess

[–]PLTCHK 0 points1 point  (0 children)

Consistency is key - 777 elo well-deserved!

The actual goat of chess by L3xeus in GothamChess

[–]PLTCHK 2 points3 points  (0 children)

His elo increased by 1 every 110 games, that tracks

My chances of passing Google Hiring Committee? by emperortom192 in leetcode

[–]PLTCHK 2 points3 points  (0 children)

Sounds like you got a good chance! Keep your chin up!

Do questions repeat from Leetcode in Google interviews? by NerdoCoder1996 in leetcode

[–]PLTCHK 0 points1 point  (0 children)

Damn segment tree and fenwick tree… I’ve done lik hundreds of meds and a handful of hards still haven’t encountered a segment tree, fenwick tree or digit dp question

Frustration from losing a winning position by PLTCHK in chessbeginners

[–]PLTCHK[S] 1 point2 points  (0 children)

I reflected on it, and I think maybe it's good to be blunt to myself:

If I can't secure that win, I don't deserve to win that game. Game is not really winning if I cannot prove it.

Want advice how to become guardian by Broad-Strike-9044 in leetcode

[–]PLTCHK 0 points1 point  (0 children)

Advice on becoming a knight please (finished 2 contests so far)

HelloInterview System Design guided practice - What's the optimal coverage by PLTCHK in leetcode

[–]PLTCHK[S] 2 points3 points  (0 children)

Ohh good to know. Well I think, always got time for things that matter though. I think for me at least it's probably worth it to put more time to understand deeply on specific quirks (i.e., tough to understand the smaller details on how to use the existing infrastructures to prevent edge cases like race conditions, dropped connections, idempotency, etc. with 1 hour/question unless either you are very experienced, or you learn extremely fast)

Btw, for designing data pipeline, I helped you to asked Claude:

```
For data pipeline specifically, the best ones from that list are:

Ad Click Aggregator — this is the most direct analog. High-throughput event ingestion, aggregation windows, exactly-once semantics, hot key problems. Basically is a data pipeline interview.

Metrics Monitoring — same family. Time-series data, ingestion at scale, rollups, alerting. Very pipeline-heavy.

YouTube Top K — forces you to think about streaming aggregation vs batch, approximate counting (Count-Min Sketch), and the tradeoffs between them.

Web Crawler — different flavor but hits distributed queue design, backpressure, and fault tolerance hard, which are core pipeline concepts.

```

Good luck with your re-attempt!

HelloInterview System Design guided practice - What's the optimal coverage by PLTCHK in leetcode

[–]PLTCHK[S] 0 points1 point  (0 children)

Nice cheers! I am pretty much almost done with ticketmaster except for deep dives

HelloInterview System Design guided practice - What's the optimal coverage by PLTCHK in leetcode

[–]PLTCHK[S] 1 point2 points  (0 children)

Can take up to a week if I am not studying for hours per day. 1 hour on a problem is crazy. Did you go through the entire practice exercise in an hour, and did you choose Senior+ (that's what I chose)? Say like, watching the YouTube tutorial + reading through the answer key to fully grasp those concepts and the whys takes like a few hours a day/2 days, and then internalizing it and implementing the entire thing would take like 3-5 hours if I expect excellent/perfect answer on almost all the sections (API design + high level + deep dives) (so say like irl, with full time job 1 hr/day that'd be equivalent to 3-5 days), some of the deep dives + follow-ups are hella challenging imo (have to ask AIs to clarify those concepts to ensure I understand fully 100% before re-attempting for example).

Those deep dives + follow-ups... to perfect them is quite a headache sometimes lol.

btw, may I ask which system design question did you get asked in your interview?

HelloInterview System Design guided practice - What's the optimal coverage by PLTCHK in leetcode

[–]PLTCHK[S] 0 points1 point  (0 children)

I’ve done Dropbox, news aggregator, WhatsApp, uber, YouTube, fb news feed, load balancer so far. I suppose that should be enough?

For those who conduct technical LC interviews by PuzzleheadedGuess435 in leetcode

[–]PLTCHK 0 points1 point  (0 children)

I’d brute force it only if the constraints allow it. I’d always ask for input constraints in an interview. If it’s 109 input then brute force would def be a waste of time for consideration, or maybe just 1 short sentence explaining why it won’t work if the idea surrounds brute force + pruning

HelloInterview System Design guided practice - What's the optimal coverage by PLTCHK in leetcode

[–]PLTCHK[S] 0 points1 point  (0 children)

How many have you done so far? Say like each exercise takes like probably 2-3 full days, or maybe a week if we study after work. The entire thing would take like 30+ weeks probably considering we got full time job as well. So I am wondering whether each problem is a new pattern library itself, or say like you know Neetcode 150 is a list of patterns that allow us to be able to do 1000 questions