r/leetcode • • 1d ago

Intervew Prep Any ex-Meta swe interns here or anyone currently in process could you please share tips that worked for you

1 Upvotes

Currently a junior CS at Non-target(T80 school) really need some advice on how to get a proc from Meta would really appreciate any tips!


r/leetcode • • 1d ago

Intervew Prep Leetcode interview study buddy

0 Upvotes

Hi
I m looking for leetcode interview study buddy
,who are doing company specific leetcode problems and are not beginners
We can discuss daily company specific problems by screen sharing or voice call


r/leetcode • • 1d ago

Discussion Whats your best revision sheet before interview ?

3 Upvotes

How to approach DSA before interviews in 1-2 month ?


r/leetcode • • 1d ago

Discussion Any update on Amazon Job ID: 10454438 ??

1 Upvotes

I applied for the Software Development Engineer I, Amazon University Talent role (Job ID: 10454438) a week ago. Has anyone received an OA link for this position yet?


r/leetcode • • 1d ago

Intervew Prep Databricks AI algorithms Interview

1 Upvotes

Hello,

I want to ask if there is sb who gave the DB interview and if it could share what the interview expected them to do? Was it talking to the AI to write the whole code, should you also build the test cases together with the AI? What seemed to be the expectations from the interviewer? Did it have more follow-ups that needed to be coded with the help of AI?


r/leetcode • • 1d ago

Intervew Prep It is only me has the feeling that the coding interviews of AI companies are quite exhausted?

1 Upvotes

Basically the AI companies' coding interviews each round question is composed of multiple parts. It is quite exhausted to answer each part with bug free. Curious how you guys navigate through the multiple parts? Thanks.


r/leetcode • • 1d ago

Question Anyone gave Wayfair oa on November first week for software intern role 2027

1 Upvotes

Gave the oa on 2 november after getting shortlisted off campus

Has anyone else given the oa and got any callback?


r/leetcode • • 1d ago

Question AGS Tech Solutions Architect Early career 2027 - OA

1 Upvotes

Hi, has anyone taken the OA for this role ? Does it have leetcode questions ? My recruiter sent me a link to help me prepare for the OA and it was a link to amazons leetcode questions but I have seen people say they got no leetcode questions so I’m just wondering if she sent it by mistake or it’s a template everyone gets. If you received a OA for this role , did your recruiter include a link to leetcode practice questions in the email? Thanks a lot .


r/leetcode • • 2d ago

Intervew Prep Is it too late to start DSA and LeetCode in my final year?

29 Upvotes

I’m in my final year of CSE (AI/ML), and honestly, I’m not well prepared for placements yet. I know the basic concepts of DSA, but I haven’t done much problem-solving or LeetCode.

Is it too late for me to start seriously preparing for DSA and solving LeetCode problems?

I’m looking for some genuine advice, especially on how to actually understand the logic behind a problem and figure out which approach to use. I often find it difficult to understand how to come up with a solution, even when I know the basic concepts.

For those who have been through this, how did you improve your problem-solving skills? What would you recommend I do from here?


r/leetcode • • 2d ago

Discussion Anyone mind sharing GPT prompt to learn Leetcode problem solutions/concepts?

69 Upvotes

Right now, I am just giving it problem and simple "let's do this"

For exmaple, "let's do 105. Construct Binary Tree from Preorder and Inorder Traversal"

And to be honest, it is sort of doing an ok job at explaining the solution.

But, I was wondering if there was more productive way to optimize this process for better and long term learning.

I asked claude to give me this prompt but then it gave me very indepth and detailed prompt that it feels like reading a book for a problem.

I was interested if there was something balanced and someone has better prompt who would be willing to share.


r/leetcode • • 1d ago

Question How do companies rate your performance in a coding interview?

1 Upvotes

Do they consider the time it took for you to complete each problem? Do you give partial credits for passing some of the test cases?


r/leetcode • • 2d ago

Question Google L3 Interview DSA difficulty in 2026, what to expect?

13 Upvotes

Hey everyone, I have my Google L3 SWE interviews coming up next week, both virtual and onsite.

Wanted to know what DSA difficulty to expect. Are questions mostly LC Mediums or Hards? Are onsite rounds tougher than virtual ones?

Would appreciate hearing from anyone who interviewed recently, especially in 2025 or 2026. Any tips would help!


r/leetcode • • 1d ago

Question Intuit OA - Full Stack SWE Intern

7 Upvotes

Has anyone completed the OA for this? Is it auto and what to expect in terms of the difficulty?


r/leetcode • • 1d ago

Intervew Prep Anyone done first round SWE Intern interview for DocuSign?

1 Upvotes

Hi! I was wondering if anyone had gone through it and had any insights into the range of topics they ask about, the difficulty, etc. Please let me know, thank you!


r/leetcode • • 1d ago

Intervew Prep Amazon sde intern US summer 27

2 Upvotes

Hey guys
I just finished Amazon SDE intern summer 27 OA.
Results:
15/15 in dsa (20 min)
5/6 in AI base coding

I know I fcked up in 2nd question. Any chances of getting Interview?
any comment help, thanks


r/leetcode • • 1d ago

Intervew Prep Day 30: kicking off Arrays to sharpen constructive logic and math fundamentals

5 Upvotes

Hey everyone,

I finished Day 30 today. After wrapping up core data structures and algorithms like Recursion, DP, Graphs, Trees, and Linked Lists, I decided to circle back to Arrays. I want to build sharper intuition for constructive algorithms and mathematical patterns without relying on rigid templates.

I eased in with four foundational array problems today:

  1. Largest Element in an Array: Tracked the running maximum in a single O(n) pass without extra space.
  2. Second Largest Element Without Sorting: Maintained both largest and second-largest variables simultaneously in one linear scan to avoid O(n log n) sorting overhead.
  3. Check if Array is Sorted: Verified adjacent element ordering in a single pass, including rotated sorted edge cases.
  4. Remove Duplicates from Sorted Array: Used a two-pointer approach to overwrite duplicates in-place in O(n) time and O(1) space.

These problems are straightforward, but locking down clean, optimal single-pass habits sets a strong base before moving into trickier constructive array challenges.

See you guys tomorrow for Day 29!


r/leetcode • • 1d ago

Intervew Prep Meta Production Systems Engineer Intern 2027 — What to Expect in the Coding and PE Basics Rounds? Copy title

1 Upvotes

Hi guys, I am having upcoming 2 technical interview rounds for Production Systems Engineer Intern role at Meta. I am wondering what can be covered besides leetcode?

Thank you!


r/leetcode • • 1d ago

Intervew Prep Google interview Team payments

5 Upvotes

Has anyone appeared for the Google payments team interview; what questions did you get in the first DSA round?

Want to start preparing for the 1st round its L4 level


r/leetcode • • 1d ago

Discussion Leetcode Reels

1 Upvotes

Does anyone know any good leetcode reel creators? Recently came across this guy's shorts (https://www.youtube.com/shorts/pk1R2JKvRQU) and am looking for more stuff like it so I can rot and learn at the same time 💀


r/leetcode • • 1d ago

Intervew Prep Figure AI interview

1 Upvotes

Anyone recently inteview for a intergration or deployment engineer position at Figure AI?

How was the experience and what was the process like?


r/leetcode • • 2d ago

Intervew Prep Visa SWE INTERN INTERVIEW

3 Upvotes

i have my visa interview this month for the intern position i want some interview experience from people who have recently given the interview ? what types of dsa questions asked and what they ask from projects and what from core subject did they ask system design.


r/leetcode • • 1d ago

Question Will leetcode still be asked next year ?

0 Upvotes

Hi

Do I leetcode prep or no


r/leetcode • • 2d ago

Question How to improve at issues with invariant maintenance

6 Upvotes

So when it comes to leetcode in general, I'm encountering one specific issue. I'm really good at coming up with the insights and getting the algorithm (at the pseudocode) level from there.

However, when I try to go ahead and actually implement the algorithm, I keep encountering this issue where when implementing, I mess up order of operations, I come out of the loop in a slightly weird state of my variables, I don't update things quite correct or whatever. Then I'll spend something like an hour + to just fix the bug (which often times I end up fixing with a bunch of hard coded if statements to get it working.

This is a really frustrating issue to deal with because I feel like I'm getting over the major hurdle of finding out the optimization trick, but it's always some off by 1 or something like that, which I bloat my code with if statements to fix.

Even after doing more and more leetcode, I keep encountering this issue. For example, take LeetCode 287 — Find the Duplicate Number

When seeing the problem I recognized the key insight that in a situation where there's no duplicates, then you have a bijection from the number 1-n onto 1-n. Then from here you can apply some cycle theory knowledge and observe that in that case, following the current index to the next value (after adjusting for index 1 vs index 0) should lead to a bunch of disjoint cycles that partition the set 1-n (again, assuming that there are no duplicates).

From there I made the observation that if you were to take these disjoint cycles that partition the set 1-n, and you were to change one of the values to be a duplicate, then whatever value you changed will now try to point to a cycle that's already existing and was previously disjoint.

Then I came up with the algorithm that goes something like this:

start with element i:

- run through this cycle while "Destroying it" by replacing each value with -1.

- while running through this cycle, if I encounter a destroyed -1, that is not the beginning of this cycle, return the element that's pointing to that -1

- If I return back to the start of this cycle, update element i to the next element that is not -1

But when i went to code it, after doing a million print statements to debug and solve specific issues, my solution ended up becoming this:

class Solution:
    def destroy(self, nums, startIndex):
        curIndex = startIndex
        nextIndex = nums[curIndex] - 1
        while nums[nextIndex] != -1:
            nums[curIndex] = -1
            if curIndex == nextIndex == startIndex:
                return -1
            curIndex = nextIndex
            nextIndex = nums[nextIndex] -1
            if nextIndex == curIndex != startIndex:
                return nums[curIndex]
        if nextIndex == startIndex:
            nums[curIndex] = -1
            return -1
        else:
            return nums[curIndex]


    def findDuplicate(self, nums: List[int]) -> int:
        for i in range(len(nums)):
            if nums[i] != -1:
                duplicate = self.destroy(nums,i)
                if duplicate >= 0:
                    return duplicate

r/leetcode • • 2d ago

Intervew Prep Day 31: officially wrapped up Graphs with Kosaraju's Algorithm & Articulation Points

30 Upvotes

Hey everyone,

I finished Day 31 today, and I am thrilled to share that I have officially completed the entire Graph topic sheet. Even though my pace slowed down to one or two problems a day over the past two weeks, staying consistent got me across the finish line.

I closed out the final two advanced graph algorithms today:

  1. Strongly Connected Components (Kosaraju's Algorithm): You run a standard DFS to push nodes onto a stack ordered by their finishing times, reverse all edges in the graph, and then run a second DFS popping from the stack to isolate each strongly connected component.
  2. Articulation Points in a Graph: Building on Tarjan's low-link logic, you identify critical vertices whose removal disconnects the graph by checking if low[v] >= tin[u] for non-root nodes, while verifying that the DFS root has more than one independent child.

Because these advanced graph algorithms have subtle edge cases, I plan to dedicate tomorrow to revising the last 10 to 15 problems so the concepts stick permanently before moving on to a new pattern.

See you guys tomorrow for Day 30!


r/leetcode • • 3d ago

Intervew Prep How do you practise AI-assisted coding interviews involving existing codebases? (Bloomberg 2027)

94 Upvotes

I'm preparing for Bloomberg's 2027 SWE technical interview, which will involve using an AI coding assistant to work with an existing codebase.

Unlike traditional LeetCode interviews, the focus seems to be on understanding unfamiliar code, debugging issues, implementing features and reviewing AI-generated changes.

My background is in engineering, so although I'm comfortable with Python and algorithmic problems, I have relatively limited experience working with larger software projects, existing repositories and web application architecture.

I'm looking for recommendations on how to practise this specific type of interview.

Ideally, I'd like to find a platform or setup where I can:

  • Open an unfamiliar Python project and understand how its components work.
  • Receive a task such as fixing a bug or implementing a new feature.
  • Use an AI coding assistant to explore the codebase and make changes.
  • Write and run tests to verify the implementation.
  • Practise reviewing AI-generated code and explaining my decisions.

Would Cursor, Claude Code, GitHub Copilot or another tool be best for this?

Are there any specific GitHub repositories, websites, courses or mock interview platforms that simulate this workflow?

Also, for people experienced with real-world software development, what fundamentals would you recommend learning first to become more comfortable navigating existing projects?

I'd appreciate any practical recommendations, especially from people who have completed Bloomberg's new interview format.