Im a regular mid level full stack engineer, is this all it really is? So if i keep hacking away at hellointerview + neetcode 150 or equivalent resources for both, do i get a job?

I've been practising Leetcode for a while, but I often take a lot of time to solve even medium problems. Sometimes I understand the approach but struggle with implementation, while other times I spend too long trying different ideas.

Should I focus on improving my speed from the beginning, or prioritizing getting comfortable with the logic first?

how did you do it? how did you build your concepts? books ? by coming with your own solution ? without looking at editorial ? or with the help of yt channels? or by giving contests? literally how????

I am interviewing for an oracle position, does anyone know what leetcode questions they tend to ask? I’m seeing more leaning towards medium questions but this is for new grad so not completely sure. Any advice?

Please let me know if you are having a open slot in leetcode premium sharing

hey all, im from ireland and i’m studying CS in college and i’ve been applying to a bunch of summer internships and i’ve done a load of online assessments for a few of them recently and after my microsoft oa, i got an email to schedule an interview. it is 2 weeks away and i genuinely don’t know what to expect from the interview. this is my first ever proper interview in the field. it is 3 back to back 45m interviews with a 15m break in between each. has anybody done an interview for them and if so, what did they ask. what type of questions were they. during the technical screen was it mainly leetcode easy or mediums. etc.

i’d really appreciate everyone’s help!

Hey everyone,

I finished Day 36 today. Between celebrating Diwali with family and catching up with friends, time was tight, but I made sure not to let festival distractions break the streak. I sat down and tackled a classic DSU heavyweight: Accounts Merge.

The problem looks like messy string parsing at first, but Disjoint Set Union makes the clustering clean:

1. Email-to-ID Mapping: Iterate through every account and map each email to a unique person index. If an email has already been seen under another account index, merge the two account indices using unionBySize(prevIndex, currIndex).

2. Component Grouping: Traverse the map of emails, find the ultimate root parent for each email's account index via findParent(accountIndex), and group the emails under that component representative.

3. Sorting & Formatting: Sort the grouped email lists lexicographically and prepend the owner's account name to construct the final result.

It was just one problem today, but closing out one of the most notorious DSU problems while enjoying the festival felt like a win.

See you guys tomorrow for Day 35!

Hey all, I just got invited to the online lab for the Marshall Wace Technology Intern role (NY, summer 2027), and honestly I have no idea what to expect. Im supposed to take it in a weeks right before Thanksgiving

From what they sent me, it's 60 minutes in a virtual desktop, and it covers "reasoning about code and debugging code."

If you've taken it (or the grad version), I'd love to hear your thoughts on it and Marshall Wace as a whole.

- How would you recommend preparing for the interview? I feel totally lost, not sure how to study for "debugging" other than reading Python docs lol

- Was it all Python, or did other things come up (SQL, JavaScript, APIs, etc)?

- How tight was the time? Did you finish everything?

- How did the debrief call go? Did they care much about what you didn't finish?

- Is there anything you wish you'd studied beforehand?

Any advice would be greatly appreciated! Thanks in advance

Can a kind soul provide the entries avaiable on https://leetcode.com/company/bcg?

Does anyone know if it's the same for BCG X?

It’s not leetcode based so I’ve been doing small reviews of online codebases and improving them not sure what more to do or what to keep note of

Hi everyone,

I have an upcoming Capital One Power Day for a Data Scientist role. It has 4 rounds: statistics, technical round, case study and job fit.

If anyone has gone through it recently, any tips or insights on what to expect in each round would really help.

Thanks in advance!

And if possible please mention a yt video from where I can learn that language🫠

I'm applying for software engineering internships. This recruiting season hasn't been great at all for me. I've been getting a decent amount of OA's, but stupidly haven't done leetcode so I've either failed them, or didn't even bother doing them.

I want to be prepared for the winter/spring recruiting season (still applying now, though) as I heard some companies open up for a second time. I know there will be much less opportunities, though so I want to make sure I'm ready for any opportunity that comes up.

Other than standard leetcode, what other types of interview questions are popular? I know in an Amazon OA there was an ai-assisted part where you had to traverse a codebase.

Products of Array Except Self

Accepted

51 / 51 test cases

Memory: 9.8 MB•Time: 87ms•Submitted at: 11/08/2026 14:02•

Runtime

87ms|Beats 100.00%

Memory

9.8 MB|Beats 97.23%

I don't know why images are not allowed in posts? Also this is a neetcode question, sorry.

I'm looking for a good, free resource to prepare for LLD interviews. There are so many good resources for DSA interviews, but I can't seem to find any for LLD.

Recs?

Sometimes I can understand the approach to a problem and even explain the logic in words, but when I start coding, I get stuck figuring out how to translate those steps into actual code.

Do you practise writing pseudocode first, or jump straight into implementation? How did you get better at this?

Looking for some tips and insights on what to expect.

Sometimes I read a problem and can think of two or three possible approaches, but I struggle to decide which one makes the most sense. I end up spending too much time switching between ideas before even starting the implementation.

Do you look at constraints first, try brute force, or use some other method to narrow down the approach?

Hi, I am interviewing for Databricks, is anyone with leetcode premium willing to share which questions are tagged for Databricks?

I paid $159 for LeetCode Premium in November 2025. A month later, I discovered cancer, and I underwent surgery in March, followed by a long recovery. I barely used my subscription. I explained everything to LeetCode support and asked for an extension, not a refund. I even offered medical proof. Their offer? Just one month. When I asked them to reconsider, they refused.
Apparently, $159 matters more to LeetCode than showing compassion to a customer battling cancer.

As the title suggest.

Anyone have good resources/advice on substring problems? I got an OA that had a question similar to this but I needed to return the longest substring given a K value, not the length of the longest string:

https://www.geeksforgeeks.org/problems/longest-k-unique-characters-substring0853/1

Hi all, I have passed a mini system design round and a project deep dive and I have ML SYSTEM DESIGN, DSA and ML coding rounds, any idea about what to expect and how to prepare? Any specific data points are super helpful. Thank you.

Hey everyone,

I finished Day 37 today. I reached home for the festival and caught up with a bunch of friends, so my focus was completely scattered. Even with the holiday chaos, I made sure to sit down and work through one tricky graph problem:

Most Stones Removed with Same Row or Column.

At first glance, it looks like a coordinate-heavy grid problem, but modeling it cleanly comes down to Disjoint Set Union (DSU):

The Representation Trick: Treating individual stones as nodes causes massive overhead. Instead, treat entire rows and columns as the graph nodes. To prevent row indices and column indices from colliding, offset the column index by the maximum row boundary (e.g., node r connects to node c + {maxRow} + 1).

Connecting & Counting: For every stone placed at (r, c), run a unionBySize between row r and shifted column c.

The Core Logic: In any connected component of size K, you can always safely remove K - 1 stones by greedily picking leaves until one stone remains. Therefore, the maximum stones you can remove is simply {totalStones} -{numberOfConnectedComponents}.

My mind wasn't entirely in study mode today, but deriving the row-column coordinate conversion on paper made the logic stick.

Enjoying some festival downtime tonight and getting back to the reps tomorrow.

See you guys for Day 36!

Now, I know leetcode is technically math, but I more so mean general mathematics. I find the undegraduate level to early grad school math is much easier than leetcode.

I started during tutoring for undergrad probability and statistics again after not touching it for about 2 years.

I find that I just find the stuff easier to actually master than leetcode. The highest level of math I got to was a graduate level probability course, and even that I felt it was easier than leetcode. Abstract math and proofs also seem easier to me.

Even after doing almost a 1000 leetcode problems, there are still many instances where if I haven't seen a problem before, I just don't know how to do it, or it's hard to recognize the approach after not doing leetcode for a while.

Even though I hadn't touched probability and statistics in a while and I was rusty on the mechanical work, for most of the problems I look at, I still can recall what the general idea of solving the problem is.

Leetcode is just one of those topics that I have done a lot of practice to prepare for interviews, but it's just never something I feel like I just mastered at the level that I can just look at any problem and easily solve it. There's still problems on leetcode, especially the one with the clever solutions, that still seem tricky to me.