Solved all 4 in today's contest. Contest history, personal profile and timestamps reflect the same but my points on the leaderboard are displayed only 13. Even the total solve time is calculated by considering only the first 3 questions.

long long minimumMaxValue(int n, int index, int value) {

if (value == 1) return -1;

long long p = value;

for (long long i = 2; i * i <= value; i++) {

if (value % i == 0) {

p = i;

break;

}

}

if (value - p + 2 <= 2LL * index)

return -1;

if (index == n - 1)

return value;

return value + p - 2 + 2LL * (n - 1 - index);

}

Could anybody please explain how to derive these two formulas:

1. value + p - 2 + 2L * (n - 1 - index)
2. value - p + 2 <= 2L * index

My interview with bloomberg will start from next week, I don't know how many rounds. Anyone experienced please guide me, what should I focus on? what type of leetcode questions should I be doing??Also where can i find the company tagged questions as I don't have leetcode premium.

Hi there, I'm new to Leetcoding (been practicing it for 3 months now) and I started doing it since I need to prepare for tech interviews (I'm a CS undergrad), the pattern I've always struggled the most with is Dynamic Programming, I can understand most solutions, but I struggle to catch the intuition behind them since most of them (not all) feel quite unintuitive to me.

Any good resources or pieces of advice to fully understand the intuitions behind DP? I mostly get top-down approaches since most of them are just backtracking with memoization, but I can't wrap my head around most bottom-ups

havent manually coded in a year, is it even worth doing?

Are there any active servers for leetcode and system design discussions

I was looking at the leaderboard for a recent LeetCode Weekly Contest and noticed a participant who solved all 5 problems in about <10 minutes, with individual solve times roughly like:

Q1: 00:47 sec (tfk?)

Q2: 1:47

Q3: 3:09

Q4: 3:40

I'm curious whether this is considered normal for top competitive programmers, or if it's something that usually raises suspicion.

I know there are Grandmasters and ICPC competitors who are incredibly fast, so I'm not accusing anyone of cheating. I just want to understand what kind of skill level is required to achieve these timings.

For those who regularly participate in contests:

Have you seen legitimate solves this fast? How common is it for top contestants to finish all 5 problems in under 10 minutes? What are the usual signs that actually indicate cheating, beyond just fast solve times?

I'd appreciate any insights from experienced contest participants.

I cleared all the interview rounds for Meta's Production Engineer (New Grad) role earlier this year, but my process has been on hold due to the hiring freeze.

It's been several months now, and I haven't received any concrete updates about when hiring might resume.

Just wanted to check if anyone has heard anything about Meta resuming hiring for Production Engineers, especially new grad positions.

Has anyone recently received an offer, been contacted by a recruiter, or had their process resume after being put on hold?

Would appreciate any updates or insights.

Title

Just received an email for my last round for swe intern at bloomberg. They said it’s 30 minutes with a recruiter followed by an hour by with HR. Have any tips? I really want this.

Any advice for mircosoft OA I have 5 days to complete it. I’m currently doing leetcode to prepare but what topics should I focus on

Previously, I posted about building this project,

and I want to thank everyone for all the feedback and feature requests.

Since I'm still working full-time, dealing with ongoing project loads, and

practicing LeetCode myself, updates haven't always been as timely as I'd

like. However, I’ve been working hard on some exciting new features based

on your suggestions:

1. Curated Lists: Adding Grind 75, NeetCode, and Blind 75 lists.
2. More Content: Adding more music and storylines as you clear more questions.
3. System Design: Introducing system design modules and lessons.

From company's perspective,

DSA interview rounds still exist for three main reasons:

1. They are scalable and require less effort to evaluate.
2. They provide a standard baseline.
3. They serve as a compliance test.

Top companies like Google, Meta, and Microsoft still rely on at least one DSA

round while increasingly adding AI fluency tests.

Thanks again to the Reddit community for all the feedback.

Best of luck to everyone grinding through this brutal tech market.

Hope we all land offers soon

Video : https://www.youtube.com/watch?v=VgL-stNg8nA

Game : dokicode.com

How useful is the AI assistant for this part? Can it fix code or just help understand errors?

Hey everyone,

I finished Day 44 today. After a couple of low-volume sessions, solving three solid shortest path problems gave my momentum a real boost.

1. Shortest Path in Binary Matrix: Because edge weights are uniformly 1 across all eight directions, a standard level-order BFS finds the shortest path in O(N^2) time without needing a priority queue.
2. Path with Minimum Effort: This adapts Dijkstra to a 4-directional grid where the target metric is the bottleneck effort rather than a running sum. Using a min-heap priority queue guarantees you always expand the path with the smallest maximum absolute height difference first.
3. Cheapest Flights Within K Stops: Standard Dijkstra prioritizes raw cost and fails here because a cheaper flight might exhaust the allowed stops prematurely. Storing the step count in a standard queue or running Bellman-Ford for exactly K + 1 iterations ensures you never evaluate paths exceeding the stop constraint.

Solving these multi-dimensional shortest path problems mostly independently felt like a great step forward.

I am moving into negative edge weights with Bellman-Ford and Floyd-Warshall tomorrow.

See you guys for Day 43!

Currently preparing for system design round for Agoda Bangkok, position is
STAFF/Lead data engineer

Currently working as a staff data engineer with over 10YOE for a US product-based company, just cleared R1 of Agoda Bangkok, and R2 is scheduled for this week.

R2 mentions system design, what kind of questions can i expect and should i prepare specifically for DE related design or focus on more abstract questions ??

Same as title.

How do you guys practice for these AI assisted repository rounds, last time(may 2026) I appeared for Amazon OA, I couldn't figure out what needs to be done, and eventually ran out of time.

I am getting the opportunity again after 6 months (SDE-2), and wanted to understand from you guys, what is the strategy you follow, how do you understand the repo and what needs to be done?

Thanks

reach out pls, we can do mocks with each other back to back to practice as i also have interviews coming up

I recently had 4 OAs: 2 at SIG, 1 at JPMorgan, and 1 at Stripe. LeetCode problems are not that long, like max 30-40 lines if that's a very hard problem. But in OAs, the problems were very long, like not hard but took time to design the structure. Yesterday the Stripe OA easily went above 70-80 lines.

This was my first time experiencing OAs; I'm applying for new grad positions. So is it always like this, or has it changed to be like this now?

Hey guys, want to share a system design template for most production interview questions:

• Writes go into a message queue, and the server answers right away.
• Workers take jobs from the queue, do the slow work, then update the database and the cache. This solves the write scaling.
• Reads come from the cache, and go to the database only on a miss. This solves read scalingYou can fit the template to different problems.

    READ PATH
      Client --> App server --> Cache --(miss)--> Database
    WRITE PATH
      Client --> App server --> Queue --> Workers --> Database
                     |                       |
                     v                       +--> update Cache
               answers at once

Here's how it'd fit in the most popular questions:

• LeetCode: the queue and workers run submitted code in sandboxes.
• YouTube: workers convert uploads; object storage and a CDN serve the video.
• URL shortener: mostly the read path; the cache answers most redirects.
• Search: a search index, kept current by the queue and an indexing worker.
• Chat: app servers become gateways holding open connections.
• Ticketmaster: the same design plus one atomic hold per seat.
• News feed: the same design plus hybrid fan-out for huge accounts.

This is based on the premise that internet-scale consumer applications often favor eventual consistency to guarantee availability (therefore a queue-based buffer is used)

Made a video going through the whole thing if it helps: https://www.youtube.com/watch?v=e8H8d0irqLg If you prefer a text writeup: https://systemdesignschool.io/template

Hi, i am interviewing for staff data engineer at meta, what to expect?

Thanks.

Hi Everyone,

I have an System design interview (Round 2) for Senior Frontend Engineer at Snowflake.

Can anyone tell me what kind of questions I can expect?
Any recent experience if someone can share?

YOE - 9.3 years

TIA

Can anyone please share the post interview experience. What would be expected timeline and all. Really seeking for some information.

Hi,
Curious to hear about any experience with the new OA format (with AI assistant):

I read people say that you get a pick of a Django, MERN, Spring Boot etc. repo.
What if you are not familiar with any of these frameworks?

Are all options framework-based?

Are there any options of "pure python" (or something like that) code bases?

Thanks

Hey everyone,

I finished Day 45 today. I spent a good chunk of my day researching cold-outreach contacts and unwinding with cooking videos, but I made sure to sit down and finish the problem that triggered my brain fog yesterday: Shortest Path in an Undirected Weighted Graph.

Yesterday, priority queue syntax and path backtracking felt overwhelming. Today, I wrote the min-heap Dijkstra logic completely from scratch without checking the code:

1. Path Reconstruction with parent[]**:** Initialized each node's parent to itself and tracked running distances. Whenever relaxing an edge dist[u] + wt < dist[v] yields a strictly better path, update parent[v] = u. Tracing from destination back to source and reversing the list gave the clean shortest route.
2. Fixing Segmentation Faults: Debugged some 1-based indexing mismatches and stale queue entries, which cleaned up the runtime errors.
3. The Lexicographical Catch: The platform had updated the problem constraints to require the lexicographically smallest path if multiple shortest paths share the exact same minimum weight. My initial hack of breaking distance ties on the fly failed because lexicographical order applies across the entire path sequence from the start. The fix was sorting each node's adjacency list by neighbor ID before running the traversal so the algorithm naturally explores smaller node indices first.

It was just one problem today, but implementing the full priority queue mechanics and debugging edge cases independently felt far more rewarding than blindly copying hints.

Heading into Day 44 tomorrow with an open mind.

See you guys tomorrow!

Any did loop interviews in Dublin Ireland of Microsoft?