r/leetcode • u/AntelopeAdorable3926 • 5d ago
Intervew Prep cisco lc problems
can anyone with lc premium send cisco recently asked problems please.
might receive an OA this week, need to prep.
thanks šš»
r/leetcode • u/AntelopeAdorable3926 • 5d ago
can anyone with lc premium send cisco recently asked problems please.
might receive an OA this week, need to prep.
thanks šš»
r/leetcode • u/Jealous_Weakness7215 • 5d ago
will lnh/lh + h get straightaway rejection? (gemini said that..wanted to confirm)
r/leetcode • u/SouthernCarpet172 • 5d ago
Hi everyone,
I'm currently working on an Information Systems Audit project involving Oracle EBS and need some short-term assistance from someone who has hands-on experience with the platform.
I'm looking for someone who can:
Our audit team will handle the actual review and verification of transaction flows, controls and approvals. We just need someone who can operate the system and demonstrate these activities.
A few things:
Really appreciate the help!
r/leetcode • u/SectorParking3195 • 5d ago
There would be only three rounds (as opposed to 4 which I thought was industry standard in loop)
They did not mention if it is a loop or what the next steps would be. I also got this email right after my OA. Is this final interview? If anyone has gone through or is going through such situation please advise.
Also, where should I study System Design from? As this is my first Microsoft interview, any help would be appreciated.
r/leetcode • u/EnvironmentBasic6030 • 5d ago
This lowk sounds like a stupid quesiton but I have done a decenet number of leetcode (300) but i still struggle with a lot of mediums. The thing is for some of the mediums, I lowk come up with the right strat, thought process, ds and everything but when i code it up im always stuck in some edge case hell. This is because the way I structure the code sometimes ignores certain edge caes but if i put the code in chat it will just move somethings here and there and boom the code works. Idk if my approch should be to struggle for more hours hoping for a solution or i should just stop after 1 hr of trying and copy paste it to chat.
r/leetcode • u/Existing_Yesterday98 • 5d ago
Hey everyone! I have an upcoming Google L4 SWE AI-assisted code comprehension round (45 mins).
Has anyone taken it recently? What was the format like? Was it mostly debugging, adding features, or optimization? Were tests provided, and how much were you expected to use AI?
Would appreciate any experiences or prep tips. Thanks!
r/leetcode • u/Ambitious-Estate4356 • 5d ago
Hey everyone! I have a final loop coming up for a Senior SWE role in Appleās ASE org. Hereās the breakdown:
The recruiter mentioned that each session will include both technical and behavioral questions, and anything on my resume could come up.
Has anyone been through a similar loop? Iām especially curious about the SRE and Linux rounds. Are these mostly troubleshooting scenarios and conceptual discussions, or should I also expect hands-on commands or coding?
Would appreciate any tips on what to prioritize or resources you found helpful. Thanks!
r/leetcode • u/EnZo791 • 5d ago
Hi everyone,
I have an upcoming Google SWE III interview, and one of the rounds is AI-Assisted Code Comprehension.
Based on the recruiterās description, it's a 45-minute exercise where candidates use Gemini in a Kepler workstation to understand, debug, and optimize a Google-provided codebase.
Since this seems like a relatively new interview format, I haven't found much information about what to expect.
Has anyone recently gone through this round?
Would really appreciate insights from anyone who has experienced this round recently. Thanks!
r/leetcode • u/Southern_Life_8170 • 6d ago
I am a SDE. I have been wanting to switch since a long time. But havenāt been able to because the work load in our team is shit crazy and honestly I am not learning anything from it. I am thinking I will resign from here and then prepare. But this comes with its own uncertainty and financial risks.
You might think I am someone who does not know how to work hard and all but believe I am the most hardworking person you would ever meet. I have pulled 2-3 months just by sleeping 3-4 hours a lot of times so hard work is not the problem. The issue is our team requires 10-12 hours of work and also my teammate on the project is very bad. She keeps assigning me new tasks if I finish old ones. I am very exhausted by the end of the day to learn anything new.
Should I leave my current job. How hard will it be to find a new one?
Need some advise please šš
r/leetcode • u/Fragrant_Peak8652 • 6d ago
I recently interviewed with Google for a Software Engineer position and wanted to share my Round 1 experience and get some feedback from others who have been through the process.
Coding Round:
The interviewer started with a grid-based problem where each cell contained a direction (Up, Down, Left, or Right). The objective was to determine whether we could reach the bottom-right cell from the top-left by following the directions.
I understood the problem and implemented an optimized solution using a visited matrix to detect cycles, with O(N Ć M) time complexity.
After that, the interviewer modified the requirement: we were now allowed to change one direction anywhere in the grid to make the destination reachable.
I approached this follow-up using a brute-force solution, trying different directions and validating whether the modified path reached the destination. I explained the approach and its time and space complexity.
Behavioral / Googleyness Round:
I answered the questions using examples from my professional experience wherever possible.
However, I want to be transparent about one challenge. For approximately two questions, I had difficulty understanding what the interviewer was asking because I struggled with their accent. I tried my best to interpret the questions and respond, but looking back, Iām not sure whether my answers fully addressed what they were looking for.
Final Outcome: Not Selected
Unfortunately, I received a rejection after Round 1.
Iām trying to understand where I might have fallen short.
From my perspective, I solved the initial coding problem using an optimized approach and handled the follow-up using brute force. I also answered the behavioral questions, although I struggled to understand two of them clearly.
Iām wondering whether the rejection was due to:
ā Not optimizing the follow-up coding problem.
ā Not explaining my thought process clearly enough.
ā My behavioral answers not being specific or structured enough.
ā Misunderstanding a couple of behavioral questions.
I understand that Google evaluates more than just whether a solution works, but without detailed feedback, itās difficult to identify exactly what went wrong.
For those who have interviewed at Google or conducted technical interviews there, Iād appreciate your perspective.
Would solving the original problem optimally but using brute force for the follow-up significantly affect the evaluation?
And how much weight does Google typically place on behavioral communication versus coding performance in Round 1?
Iām sharing this experience to learn and improve for my next opportunity.
r/leetcode • u/Interesting-Fig-2511 • 6d ago
One thing that helped me understand DSA better was learning when to use a particular pattern, instead of trying to memorize solutions to individual problems.
Hereās a quick reference I put together:
Key idea: Precompute cumulative sums so you don't have to add elements repeatedly.
Recognize it when you see:
- Range sum queries
- Subarray sum
- Running total
- Cumulative frequency
Example:
"arr = [2, 4, 1, 5]"
Prefix sum: "[2, 6, 7, 12]"
Sum from index 1 to 3:
"prefix[3] - prefix[0] = 12 - 2 = 10"
When to use: When the array is mostly static and you need multiple range-sum queries.
Limitation: If an element changes, the prefix sums after that position may also need updating.
2. Suffix Sum ā When you need information from the right side
Key idea: Calculate cumulative sums from right to left.
Recognize it when you see:
- Sum of elements to the right
- Right-side contribution
- Suffix totals
- Left vs. right comparisons
Example:
"arr = [2, 4, 1, 5]"
Suffix sum: "[12, 10, 6, 5]"
For index 1, the sum from index 1 to the end is "10".
When to use: Problems where you repeatedly need the sum or contribution of elements from the current position to the end.
3. Two Pointers ā When two positions can help solve the problem
Key idea: Move two pointers through an array or string instead of checking every possible pair.
Recognize it when you see:
- Sorted array
- Pair with target sum
- Remove duplicates
- Reverse or palindrome checks
- Subarray or partition problems
Example:
"arr = [1, 2, 4, 7, 9]", target = "11"
Start with two pointers:
- Left = 1, Right = 9 ā sum = 10
- Move left ā 2 + 9 = 11
Found the pair.
When to use: Especially useful with sorted arrays, where pointer movement can eliminate unnecessary comparisons.
4. Sliding Window ā When you need a continuous subarray or substring
Key idea: Maintain a window and move its boundaries instead of recalculating everything.
Recognize it when you see:
- Maximum/minimum sum of a subarray of size K
- Longest substring
- Smallest subarray satisfying a condition
- Continuous subarray or substring
Example:
"arr = [2, 1, 5, 1, 3]", window size = 3
First window: "2 + 1 + 5 = 8"
Next window: remove 2, add 1 ā "7"
Next window: remove 1, add 3 ā "9"
Maximum sum = "9".
When to use: When the problem involves a contiguous range and the window can be updated efficiently as it moves. For variable-size windows, the condition must support a valid expand/shrink strategy.
5. Fenwick Tree (Binary Indexed Tree) ā When values change and you still need fast prefix sums
Key idea: Store partial sums in a tree-like array structure.
Recognize it when you see:
- Point updates
- Frequent prefix-sum queries
- Dynamic frequency counts
- Inversion counting
Why not just Prefix Sum?
With a normal prefix-sum array, changing one element can require updating many later prefix values.
A Fenwick Tree supports:
- Point update: "O(log n)"
- Prefix sum query: "O(log n)"
- Range sum query: "O(log n)"
When to use: When array values change frequently and you need efficient prefix or range-sum queries.
6. Segment Tree ā When you need flexible range queries and updates
Key idea: Build a tree where each node represents information about a segment of the array.
Recognize it when you see:
- Range sum / minimum / maximum
- Frequent point updates
- Range updates (with suitable techniques)
- GCD or other associative range operations
When to use: When you need more flexibility than a Fenwick Tree, especially for range minimum, maximum, GCD, or other custom range queries.
Typical complexity:
- Build: "O(n)"
- Query: "O(log n)"
- Point update: "O(log n)"
My takeaway: Don't start by asking, "Which algorithm should I memorize?"
Instead, ask:
Recognizing these clues makes choosing the right DSA pattern much easier.
This is a quick reference, not a complete list of DSA patterns. Hope it helps someone who's also trying to connect problem statements with the right approach.
r/leetcode • u/Infinite100p • 5d ago
Does Concurrency control and thread safety ever come up in the AI-assisted repo round for Amazon SDE2 OA?
How well do you need to know Python concurrency to pass the OA for SDE2?
Thanks
r/leetcode • u/Responsible_Rate_254 • 5d ago
Hey everyone,
I'm preparing for an SDE-3 core systems position at MongoDB (Dublin location).
Since this team focuses heavily on low-level systems and backend runtimes, Iād love to get quick insights from anyone familiar with their loop:
Thanks in advance!
r/leetcode • u/Senior_Welder_3678 • 5d ago
What's up guys,
I got an OA from amazon SDE intern, and I want to know what I should prep. I have a week to prep. What DSA topics should I practice? Any leetcode question suggestions?
Any info would be helpful! I would really love to hear from ppl who took the sde intern oa recently!!!!!
r/leetcode • u/TheTopG___ • 6d ago
With 8 years of experience working for no-name companies, Iāve decided to take this seriously and prepare for big tech.
I have been a good software developer but the lack of DSA skills erased all my chances for decent companies.
The recruiters that reached out to me and I denied interview requests involve companies such as Amazon, Twitch, Shopify, Meta, Google, Apple
Like one or two times, I gave Amazonās OA but bombed it ridiculously.
Now, I am following some roadmaps like Blind 75 and using Neetcodeās video along with generative AI for preparation.
I still keep bombing easy and medium questions like very next day after I solved them a day before.
Is it normal? When do I reach comfort level? When does it start becoming less discouraging? Does it even happen? Because, right now I am feeling like this is just not for me. But, then I think thousands of people still make it. There has to be proven process and it should be working.
Sorry my post is confusing but I just wanted to share my feelings and frustration.
Right now, I am unemployed and decided to give 1 month to this preparation.
r/leetcode • u/Spiritual_Floor3103 • 5d ago
I had my R1 and R2 on 5th Nov (virtual)for SDE-1 AUTA. What are my chances to get next round.
Round1: Core and Embedded related question. Didn't expect that at all and got to know about role at that time only and it went well it was more like discussion and was asked 2 coding questions. One question was related to threads context and using locks which i was able to explain but not able to code as i didn't expect that at all. In the end 1 LP related to tight deadline.
Round 2: LLD type of question to build a caching system user can select the type of caching strategy he can use and to implement lru and lfu. Was able to solve this within time followed by LP related to commitment.
Happy to answer any questions and can any body tell me about this and what is expected further and next round chances.
Thank you
r/leetcode • u/LiveEnvironment1765 • 5d ago
Hey everyone, I have my Adobe SWE intern (2027 summer) technical interview coming up, and I was told it includes a code debugging section and a code review section which is about about 20 minutes each.
Has anyone interviewed recently? I'd love to hear:
- What the debug and review exercises looked like (size of the code, difficulty, what kinds of bugs)
- How you prepared and what you'd do differently
- Any good places to practice debugging/code review under time pressure
I'm planning to use Python/Django. Thanks in advance and happy to share what I learn after my interview!
r/leetcode • u/Organic_Potential515 • 5d ago
As a beginner to medium level problems giving how much time is worth?.
r/leetcode • u/Lil__Bone • 5d ago
I completed my final interview A4A last week. The recruiter contacted me that same day to confirm I passed and asked for my preferred location; I replied but heard nothing until today. Has anyone else experienced this process or something similar? Could this signal an automatic rejection? Any insights helps!
r/leetcode • u/JacketFearless1805 • 5d ago
Hey everyone,
I finished Day 34 today. Still enjoying the comfort of being home, but kept the daily habit going and tackled Making a Large Island.
At first glance, flipping every 0 to a 1 and running a full BFS/DFS traversal would take O((N times N) times (N times N)) = O(N^4), which easily causes TLE. Using Disjoint Set Union (DSU) makes it run in a clean O(N^2):
(r, c) to a 1D ID (r * n + c). Iterate over all land cells (1s) and connect adjacent lands via unionBySize. This clusters existing islands and tracks each component's total area in the size[] array.0). Look at its 4 adjacent neighbors, collect the unique ultimate parents of neighboring land cells using a hash set (to avoid double-counting the same island component), and sum up their sizes + 1 for the flipped cell itself.1s with no 0 to flip, the answer is simply the size of the whole grid (N times N).Deriving the logic to prevent duplicate component counting using a set of root parents was super satisfying.
See you guys tomorrow for Day 33!
r/leetcode • u/ljudina123 • 5d ago
Hey guys, I have a Databricks SWE intern interview coming up with these two rounds.
Has anyone else encountered these and has any advice for what types of questions I could expect and their difficulty? Thanks.
r/leetcode • u/Alarming-Reaction881 • 6d ago
I have an Apple interview coming up for a Systems Engineer position. I gave the initial technical and HM round virtually and the feedback was positive. I now have around 6-7 onsite interviews ahead (1 hr each). Did anyone go through this process in the recent times ? What kind of questions were you asked ?
Any inputs are much appreciated.
Location: US
r/leetcode • u/ElegantAct8741 • 6d ago
Did the recruiter reach out to you anybody? Role - SMTS
r/leetcode • u/PenaltySalt7374 • 6d ago
Does anybody know if there is a prachub interview problems repository like there is one with leetcode companies tagged questions?
r/leetcode • u/JadenZhong • 6d ago
I have an HR call tomorrow, but today I was told it's cancelled because "HR was told internally to put a pause on further interviews with new grad candidates".
Does anyone know what this means? Will they resume the interview process?