DoorDash and big tech seem to skew young from what I see, but I realize that isn't the same as having actual age data.

For people who've worked in tech into their 40s and beyond, what did your career look like? Did you stay in an IC role, move into management, switch to a smaller company, or leave the industry?

I'm especially interested in people who stayed technical. Are older engineers less visible because they're concentrated in certain teams or levels, or do the demands of these jobs push people toward other options?

I don't want to assume everyone disappears at 40. I'd like to understand the paths that aren't as visible in early-career conversations.

A completely subjective tech company aura list. This is outside perception—comp reputation, interesting-looking work and how well the marketing has worked on me. It isn't a ranking of team quality.

S: Anthropic, OpenAI, Ramp, Nvidia

A: Netflix, Google, Notion, Apple, LinkedIn, Databricks, Airbnb

B: Capital One, Bloomberg, Uber, DoorDash, Stripe, Roblox

C: Amazon, Meta, ByteDance, Tesla, Snap

D: Microsoft, Walmart, Salesforce, Intuit, Atlassian

F: Oracle, Adobe, IBM

For the AI companies especially, I'm curious how much “aura” comes from the actual work versus proximity to whatever everyone is talking about.

A version ranked by interview questions and difficulty could look very different. So could one based on day-to-day work.

Which placement is most wrong? And which company has the biggest gap between its public reputation and what it's actually like to work there?

Like many career switchers and job seekers, I used to get completely stuck in my head during technical and behavioral interviews. Deep down, I knew it wasn't a lack of knowledge—it was pure lack of practice.

Mock interviews were the obvious answer, but:

• Scheduling with friends felt like asking for a huge favor every time.
• Paid coaching services cost hundreds of dollars for a single session.

While brainstorming with a friend, we asked: What if candidates had a low-pressure way to practice realistic interviews anytime, anywhere?

Here's the problem with existing tools:

• Recruiter-focused: Most AI tools are designed to filter candidates, adding more pressure instead of reducing it (often a stressful, one-and-done recorded voice test).
• Vague feedback: Generic AI bots give fluff answers or glitch out, leaving you with zero actionable advice on how to improve.

So, I built LandOffer.ai.

It simulates 15–20 minute voice mock interviews customized specifically to your resume and the target job description. The goal is simple: help you get your reps in, build muscle memory, and lower your anxiety before the real thing.

We’re actively tweaking the interview models and feedback depth. If you’re preparing for interviews right now, I’d love for you to try a practice run and let me know:

1. What kind of feedback is most useful to you (e.g., STAR framework, pacing, answer depth)?
2. What’s the hardest part of interviewing for you right now?

Most PMs (probably over 90%) don’t realize there’s a big difference between being a good PM and being a good PM candidate. Take it from someone who's failed and then aced a google interview.

I used to think that lots of experience meant I could wing the process with little prep and it backfired, so second time around I took it by the horns or whatever they say. Thought I’d share the three things I did differently this time which led to an offer letter to pay it forward to the community on here that's been helpful at different stages of my journey.

Referrals–In this hiring market, referrals definitely matter. There are two levels on which referrals are evaluated. The first is the seniority of the person referring. A referral from a Product VP carries a lot more weight than a referral from an APM. The second is how the referral knows you. If the person referring you can vouch for having worked with you in the past, that will carry more weight than someone who says they know you socially. If you don’t have any friends who you’ve worked with in the past at your dream company, you might have luck finding relatively senior strangers on Blind or LinkedIn who are willing to refer you. After all, they get a referral bonus if you get the job so everyone wins. It doesn't hurt to have multiple referrals either. For companies like Google that value culture fit, having 2 or 3 referrals can be the difference between getting an interview or not.

Interview Prep–My biggest mistake when it came to prepping for PM interviews in the past was thinking that given my almost a decade-long product management experience, I could just wing the interview. That's just not true at top companies with standardized hiring processes.

Actual Interview–There’s two key mistakes I have made in the past during interviews. The first is I just jump straight into my answer without taking a minute to think and write down some ideas so I can have more structure in my response. For virtual interviews, I even have the frameworks written in my notebook as a reference if necessary. You don't lose any points for taking a minute to think but you do lose points for unorganized rambling.

The second is something one of my friends who is a hiring manager at Coinbase taught me. When you are asked if you have any questions at the end, that’s part of the interview. I used to just ask basic questions like what’s the culture like or how much autonomy do you have as a PM here. Wrong and wrong. If you want to be really memorable as a candidate, come prepared with some interesting product idea for that company and ask the interviewer if their company considered pursuing said opportunity. This is something almost no candidates do that can really make you stand out. One of my interviews at Google actually went 10 minutes over because we were both geeking out about a potential AI play for Google that I proposed at the end of the interview. I think that dude went from a borderline hire to strong hire simply business we geeked out together and he liked the idea I proposed even though it wasn’t officially part of the interview.

Okay, that’s all I got. Although my interview was at Google, I think all the same tips and tricks apply at every other top company. Hope this helps someone

US SUSPENDS IMMIGRATION PROGRAM FOR COGNIZANT, INFOSYS, TATA

For H1b sponsor roles, you can find it on LandOffer.ai

#workvisa
#h1b
#rfe

Let's be real: The golden decade of the Seattle tech boom is officially over.

For the past decade, Seattle had all the starts aligned:
- Infinite headcount: Amazon and Microsoft were hiring basically anyone with a pulse.
- Cloud dominance: If you did anything with cloud or infrastructure, this was the absolute best place on earth to be.
- Financial advantage: No state income tax plus cheap housing.

Its all broken now, and we're in a massive doomsday spiral.
- The hiring engine stalled: AMZN and MSFT are just doing rolling layoffs and hiring freezes.
- Seattle completely missed the AI boat: SF totally ate Seatle lunch on generative AI. It sucked up all the VC money and startup talent.
- Too expense: Housing prices are absolutely brutal now, and with the new taxes, the financial incentive to move here is gone.

Also the guy who will bring up "we have satellite offices" to save us, stop the copium. Startups are not going to open satellite offices in Seattle to scoop up laid-off cloud devs. Why would they pay Seattle commercial rent and high local salaries? If a startup wants talent outside of their HQ, they'll just go fully remote and hire across the entire US for way less overhead.

It was fun while it lasted. If you are unable to find job, just open to move around.

For anyone looking for fresh tech openings, check out LandOffer.ai.

A merit-based visa system should look like this.

For H1b sponsor roles, you can find it on LandOffer.ai

https://preview.redd.it/sw3dwnjihauh1.png?width=1200&format=png&auto=webp&s=a69ada0efe195845eb7185f3337349a7777c0d42

I’ve compiled a list of all the questions asked by Amazon over the last six months for the SDE-2 position. I went through various interview experiences and compiled this list based on them.
I thought it might be useful to others preparing for the role, so I’m sharing it here. Hope it helps!

Amazon SDE Questions

1. Topological sort and finding the cycle in the graph.
2. LLD question was to create a publisher subscriber kind of system where a publisher can send events related to a particular event type and all subscribers subscribed to that event type should receive that message. Subscribers can subscribe and unsubscribe to a particular event type
3. https://leetcode.com/problems/reorganize-string/description/
4. https://leetcode.com/problems/count-stepping-numbers-in-range/description/
5. https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/description/
6. Design an Inventory Management System for Amazon The interviewer went quite deep into concurrency-related scenarios, for example: There is only one unit of a product left in inventory and two users place an order simultaneously. How would you prevent both orders from succeeding? We discussed things around: • Race conditions •Concurrency • Inventory consistency • Concurrent updates • Preventing overselling • Locking/transaction approaches
7. https://leetcode.com/problems/container-with-most-water/description/
8. https://leetcode.com/problems/trapping-rain-water/description/
9. https://leetcode.com/problems/cheapest-flights-within-k-stops/description/
10. Design a Rate Limiter We discussed multiple approaches/algorithms for rate limiting, including: • Fixed Window • Sliding Window • Token Bucket • Distributed rate limiting • Redis • Locks/concurrency • Handling rate limiting across multiple application instances • Trade-offs between different approaches The interviewer also asked follow-up questions around distributed systems and consistency.
11. Course Schedule / Course Scheduler
12. Closest K Elements in a Sorted Array
13. Imagine you have a train route: G → U → H → K → I. Each segment travelled costs 1. So travelling from G to I would cost 4. The input was basically:calculateFare(start, stop)
14. he problem was somewhat similar to an Amazon Locker, but basically the reverse. Instead of the Amazon delivery person picking up a return package from the customer, the customer books a slot at the nearest drop store and physically goes there to drop the package. I took some time initially to clarify the requirements and then started writing the code. In the middle of it, the interviewer suddenly went in another direction: "How will you find the nearest drop store from the customer's location?" I said I'd use the concept of geosharding. That's basically the only thing I could come up with because, well... I've never done HLD before. 😅 He wanted to go deeper into it and even gave me a hint: "Think about how Uber does this." Unfortunately, I didn't know how Uber does it.
15. https://leetcode.com/problems/find-the-safest-path-in-a-grid/
16. She gave me a custom problem, which I believe was related to something the team was actually working on. The problem was somewhat similar to syncing configurations across different devices. She asked several design-related questions, and I was able to answer all of them.
17. Find distance between any two nodes in a tree. Parent pointers not given. Only have root, source, and target in input.
18. Designing a stack that supports push, pop, get middle, get top in O(1) time.
19. https://leetcode.com/problems/basic-calculator/description/
20. LLD question was to create a publisher subscriber kind of system where a publisher can send events related to a particular event type and all subscribers subscribed to that event type should receive that message. Subscribers can subscribe and unsubscribe to a particular event type
21. https://leetcode.com/problems/reorganize-string/description/
22. Rotten Oranges
23. Search in Rotated Sorted Array Given multiple currency conversion rates, determine the conversion rate from currency A to B. Example: • C = 10B • D = 9B • B = 110Z • A = 2Z Find the conversion rate from A to B. Follow-up Now suppose there are Q such conversion queries. I proposed using Disjoint Set Union (Union Find) with weighted relationships to answer repeated queries efficiently, and discussed the associated trade-offs.
24. Decode String
25. How do you use LLMs during development?
26. How do you verify whether an AI-generated solution is correct?
27. When do you trust an LLM and when do you not?
28. Two knights are placed on an infinite chessboard. Their starting coordinates are given, and both move using standard knight moves. They move alternately. Find the minimum total number of moves required for both knights to converge at the same position. Given a binary string: • Every 0 becomes 00 • Every 1 becomes 10 After performing this transformation k times, determine the value at the i-th index of the final string.
29. Minimum Window Substring
30. Design Artifact Repository(like JFrog, adding an artifact and fetching an artifact) - Interviewer was interested in each part of my HLD, and then probed on scalability, metrics monitoring, reliability, extensibility (like dealing with a malicious artifact).
31. Design Unix File Search API, and its extensibility to support various filters and combination of filters. First Unique Character in a string. Then extend to stream of characters.
32. Task Scheduler
33. Design a playlist from the DJservice and the Recommendation service to mix the songs . Given the list of 10 requirements printed on paper . The core idea is to mix the songs coming from the Djservice and the recommendation service , in a custom proportion or in a equal proportion . Filters can be applied based on the user preferances . Expectation is to write the production ready classes with proper syntax on paper .
34. Given two boxes of A[] , B[] with size n , where each elements represents the sweetness , Given the M students , distribute the sweetness of A , B to each children and you should minimize the total sweetness .
35. Find the unoccupied seat position with the maximum distance to the occupied site . Seats[] = {'O','U','U','U','O','O'}; Answer - 2nd indexed seat
36. Given the 2 D array with 2 colours validate if it is a valid chessborad .
37. LCS (longest common subsequence)
38. https://leetcode.com/discuss/post/8434443/count-the-uni-valued-subtrees-in-a-binar-tqi2/
39. Longest Strictly Increasing Subsequence with Maximum Adjacent Difference Constraint
40. Given an array of integers and an integer k, find the length of the longest subsequence such that:
41. The elements are strictly increasing
42. The difference between any two consecutive elements in the subsequence is at most k
43. The relative order of elements in the original array is maintained (it's a subsequence, not a subarray) Example 1: Input: arr = [7, 1, 4, 5, 8, 8, 10, 6, 7, 7, 7, 8], k = 4 Output: 6 Explanation: The longest valid subsequence is [1, 4, 5, 6, 7, 8] • 4 - 1 = 3 ≤ 4 ✓ • 5 - 4 = 1 ≤ 4 ✓ • 6 - 5 = 1 ≤ 4 ✓ • 7 - 6 = 1 ≤ 4 ✓ • 8 - 7 = 1 ≤ 4 ✓ All elements appear in the same relative order as in the original array. Example 2: Input: arr = [3, 1, 2, 6, 10, 11, 4, 5], k = 3 Output: 4 Explanation: One valid subsequence is [1, 2, 4, 5] • 2 - 1 = 1 ≤ 3 ✓ • 4 - 2 = 2 ≤ 3 ✓ • 5 - 4 = 1 ≤ 3 ✓ Example 3: Input: arr = [5, 4, 3, 2, 1], k = 2 Output: 1 Explanation: No two elements form a strictly increasing pair in subsequence order, so the longest valid subsequence has length 1. Approach: This is a variation of the Longest Increasing Subsequence (LIS) problem with an additional constraint on the maximum allowed difference between adjacent elements in the subsequence. Largest Subset of Binary Strings with Bounded Ones and Zeroes Given an array of binary strings and two integers m and n, find the size of the largest subset such that:
44. The total number of 1s across all strings in the subset is at most m
45. The total number of 0s across all strings in the subset is at most n Example 1: Input: strs = ["100", "10", "1", "11", "111"], m = 3, n = 0 Output: 2 Explanation: The largest valid subset is ["1", "11"] • Total 1s = 1 + 2 = 3 ≤ 3 ✓ • Total 0s = 0 + 0 = 0 ≤ 0 ✓ Note: ["111"] also satisfies constraints (1s = 3, 0s = 0) but has only 1 element. Design a Facebook-like News Feed System at Scale Problem Statement: Design a social media feed system (similar to Facebook) that supports millions of users who can post, view, and like content. Functional Requirements: • Users should be able to post any type of media (text, images, videos) • Users should be able to view posts in their feed • Like counts and view counts should be visible in real-time • Users should be able to like and view posts with minimal latency Non-Functional Requirements / Key Focus Areas: • Scale: Handle massive traffic — millions of concurrent users posting, liking, and viewing • Feed Loading Speed: The feed should render almost instantly upon login, even if the user has cleared their browser/app cache Discussion Points & Follow-ups:

• API design
• Push vs. Pull model for feed generation — trade-offs of each
• Choice of databases — SQL vs. NoSQL vs. a combination and trade-offs
• Caching strategy — what to cache, invalidation policies, CDN usage for media
• Handling Viral Content (Celebrity Problem):
• A celebrity's post goes viral with millions of likes and views in seconds — how do you prevent this from becoming a bottleneck?
• Rate limiting, sharding/parition strategies, async processing of likes/view counters
• Monolithic vs. Microservices — and why?
• Service boundaries — how would you split responsibilities?

1. Tell me about a time you used Generative AI to solve a business problem and the measurable results it delivered.
2. Design a Music Streaming Application (like Spotify) Problem Statement: Design a music streaming platform that allows millions of users to discover, search, and stream music seamlessly. Functional Requirements: • Users should be able to search for songs, artists, and albums • Users should be able to create and manage playlists • Users should be able to like/save songs and see their library Non-Functional Requirements: • Low latency playback — music should start playing within milliseconds of pressing play • High availability — the service should be up 99.99% of the time • Scale — support millions of concurrent listeners streaming simultaneously Discussion Points & Follow-ups:

• API design
• How do you serve audio files efficiently to millions of concurrent users?
• CDN strategy for audio content distribution across geographies
• How and where to store millions of audio files (object storage, metadata DB)
• Choice of database for song metadata, user data, playlists
• Storing listening history and user preferences for recommendations
• How to design a fast search system across millions of songs, artists, and albums
• Indexing strategies, full-text search (Elasticsearch/similar)
• Load balancing and horizontal scaling of streaming servers
• Monolithic vs. Microservices — service boundaries (streaming service, search service, recommendation service, user service, playlist service)

1. Tell me about a time you used Generative AI to automate or streamline a workflow.
2. Search an Element in a Sorted Rotated Array. Given a sorted array that has been rotated at some pivot point, search for a target element and return its index. Return -1 if not found.
3. How do you be a compitent software engineer in this era of Gen AI?
4. Design HLD (30 mins) for device backup scheduler and restore Should backup device settings, files, media, etc Restore on new devices
5. Unorthodox question around String Manipulation to find next palindromic time of given time "HH:MM". (MEDIUM)
6. Variation to find kth smallest sum of integers in row wise sorted m*n matrix . Only pick 1 element from each row (HARD)
7. Design and implement Meeting Room Scheduler.
8. Aggressive cows
9. https://leetcode.com/problems/find-median-from-data-stream/ Design a notification router for an ecommerce website
10. The user should have a preferred channel (EMAIL, SMS, PUSH)
11. Notification has a priority attribute (URGENT, NORMAL)
12. If the notification is urgent, it should be sent to all channels otherwise it should only be sent to the user's preferred channel.
13. The notification handlers need not to be implemented, only routing logic was needed.
14. Find unique permutations of a given string - For example, s = "xxyy"
15. First permutation = "xxyy" Second permutation = "xxyy" -> Swap the 0th and 1st index "x" characters
16. But the output should contain "xxyy" only once. I had to return the list containing all the unique permutations
17. 3Sum closest
18. Number of Islands II
19. https://leetcode.com/problems/course-schedule-ii/
20. https://leetcode.com/problems/merge-intervals/
21. https://leetcode.com/problems/product-of-array-except-self/
22. Design: Google Docs (Collaborative Document Editing) Key areas discussed: • Real-time collaboration o Operational Transformation (OT) vs CRDTs for conflict resolution o WebSocket connections for low-latency sync • Storage and versioning o Delta-based storage for document history o Snapshot + diff strategy for efficient retrieval • Scalability — sharding by document ID, regional replication • Presence indicators (who's editing what, cursor positions) • Permissions and access control model
23. Design: Uber (Ride-Hailing System) Key areas discussed: • Class design — Rider, Driver, Trip, Payment, Location entities • Trip state machine: requested → accepted → in_progress → completed / cancelled • Driver matching algorithm — geospatial indexing (quadtree / geohash) • Surge pricing logic and fare calculation service • Payment service integration — idempotency, retries, failure handling • API design — REST endpoints for booking, tracking, and cancellation
24. https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/
25. https://leetcode.com/problems/reorganize-string/ Amazon receives transfer notifications whenever money moves between accounts. Transfers form a chain, for example: A → B → C → D Input is provided as pairs: [A, B] meaning money moved from A to B. Task: Find: • Initial source account • Final destination account Example: numberOfTransfers = 3 transferList = [ (222, 111), (111, 333), (444, 222) ] Output: start = 444 end = 333 Explanation: 444 → 222 → 111 → 333
26. Design Amazon Locker System Requirements discussed: • Delivery driver deposits package • Customer receives code • Customer unlocks locker using code • Locker allocation • OTP/code validation • Expiry handling • Multiple locker sizes • Scalability • Availability • Failure handling Topics interviewer focused on: • API design • Database schema • Concurrency handling • Distributed locking • Scalability • Performance optimization • Notification flow • State transitions
27. Secure the Network by Disconnecting One Facility Center A company has a network of Facility Centers (FCs) represented as a graph. Some FCs are compromised. If a compromised FC is connected to other FCs, the compromise spreads to all directly or indirectly connected nodes. You are allowed to disconnect exactly one compromised FC. Find which FC to remove such that the maximum number of clean FCs are saved. (If multiple FCs save the same number of nodes, return the FC with the smallest ID). • Similar to: Minimize Malware Spread Key Discussion Areas: • Connected components • DFS / Union Find • Edge cases and constraints • Time and Space Complexity
28. Design a Shipping Cost Calculator. Design a system to calculate shipping costs based on multiple dynamic conditions, including weight, distance, delivery type, priority shipping, region-based pricing, and special handling.
29. Given an array of delivery times, output the median of all values seen so far after each new delivery time arrives. Input: [5, 17, 100, 11] Output: [5, 5, 17, 11] Approach: Solved using the Two Heaps pattern (Max-Heap and Min-Heap).
30. Given values in houses arranged in a line, find the maximum value that can be stolen without robbing two adjacent houses. Input: [6, 7, 1, 3, 8, 2, 4] Output: 19
31. Design the core architecture for a food delivery platform like Zomato. Key Discussion Areas: • Restaurant onboarding & Menu management • Search & Discovery • Order placement & Payments • Delivery assignment & Real-time tracking • Notifications
32. Employee Ratings Management System A company maintains ratings for employees and needs to process operations in real time. Operations:
33. 1 x : Add an employee with rating x.
34. 2 : Print the highest rating AND the index of the employee having the highest rating (If multiple employees have the same highest rating, return the first occurrence).
35. 3 i : Delete the employee at index i (Note: Indices shift after deletion). Challenge: Designing an efficient data structure supporting Insert, Delete-by-index, and Query-max + first-occurrence simultaneously.
36. https://leetcode.com/problems/binary-tree-cameras/description/
37. Given a string s, remove duplicate letters so every letter appears exactly once. Remove Duplicate Letters BUT with a twist. Original LC 316 asks for: smallest lexicographical Amazon changed it to: largest lexicographical That means same monotonic stack pattern, but reverse comparison logic. Return the largest lexicographical possible result.
38. given the n sorted list and merge them.
39. given a list of Nodes in a N-ary tree, and given a level you have to return the nodes at the level.
40. Trapping rain water
41. Max consecutive ones III - https://leetcode.com/problems/max-consecutive-ones-iii/
42. maximum profit in job scheduling - https://leetcode.com/problems/maximum-profit-in-job-scheduling/
43. Given two strings str and pattern, return an array of all the start indices of pattern's anagrams in str. Input: str = "acbadabcaa", pattern = "aabc" Output: [0,5,6] Explanation: The substring with start index = 0 is "acba", which is an anagram of "aabc". The substring with start index = 5 is "abca", which is an anagram of "aabc". The substring with start index = 6 is "bcaa", which is an anagram of "aabc".
44. Given an m x n grid of 0 (Water) and 1 (Land), the task is to count the number of islands. An island is a group of adjacent 1 cells connected horizontally, vertically, or diagonally, and it is surrounded by water or the grid boundary. The goal is to determine how many distinct islands exist in the grid. Input: grid[][] = [[1, 1, 0, 0, 0], [0, 1, 0, 0, 1], [1, 0, 0, 1, 1], [0, 0, 0, 0, 0], [1, 0, 1, 1, 0]] Number of Islands = 4
45. There are N poles of various heights, and you have a machine whose saw blade can be set at a specific height "h" and it cuts all poles till that height, such that all of them have height "h" after the cut. (Poles with height less than "h" remain uncut). You take away the cut portions of all poles with you.

Your task is to take at least M length of poles with you in total after the cut.
What is the maximum height 'h' where you can set your blade to achieve this.

N = 4
M = 7
arr = [20, 15, 10, 17]

1. Proper time and space complexity asked
2. Find the number of unique pairs in a 2d matrix whose sum = target (Numbers are unique)
3. Dijkstra algortihm
4. Binary search
5. First positive missing - https://leetcode.com/problems/first-missing-positive/description/
6. Word break II - https://leetcode.com/problems/word-break-ii/description/
7. https://leetcode.com/problems/word-break/description/
8. Given a grid whose cells are 'O' and 'X', latter being a blokcer. Given source and destination, find if there is a path exists between source and destination. You can only travel down or take a right turn.
9. Course schedule 2
10. Binary tree right view
11. Next permutation
12. Construct the tree with level order and inorder traversal
13. Longest happy prefix - https://leetcode.com/problems/longest-happy-prefix/description

Here is the collection of the Top 50 list of frequently asked interviews question on Tree. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.

Practice these Leetcode Problem and PracHub Interview Questions before your next interview

Level 1

Problems

• Height of Binary Tree
• Determine if two trees are identical Solve
• Mirror tree Solve
• Symmetric Tree Solve
• Diameter of tree Solve
• Checked for Balanced tree Solve
• Children Sum Parent Solve
• Check for BST Solve
• Array to BST Solve
• Largest value in each level of binary tree Solve
• Maximum GCD of siblings of a binary tree Solve
• Zigzag Tree Traversal Solve
• Inorder Successor in BST Solve
• Kth Largest Element in a BST Solve

Level 2

Problems

• Check if subtree Solve
• Single Valued Subtree Solve
• Unique BSTs Solve
• Inorder Traversal (iterative) Solve
• Preorder Traversal (iterative) Solve
• Postorder Traversal(iterative) Solve
• Vertical Traversal of a Binary Tree Solve
• Boundary Traversal Solve
• Construct Binary Tree from Parent array Solve
• Construct Binary Tree from Preorder and Inorder Traversal Solve
• Preorder Traversal and BST Solve
• Construct tree from preorder traversal Solve
• Minimum distance between two given nodes Solve
• Maximum sum leaf to root path Solve
• Odd Even Level Difference Solve
• Lowest Common Ancestor of a Binary Tree Solve
• Ancestors in Binary Tree Solve
• Remove BST keys outside the given range Solve
• Pair with given target in BST Solve
• Sum Tree Solve
• BST to greater sum tree Solve
• BST to max heap Solve
• Clone binary tree with random pointer Solve
• Maximum sum of non adjacent nodes Solve
• Largest BST in a Binary Tree Solve
• Extreme nodes in alternate order Solve

Level 3

Problems

• Connect nodes at same level Solve
• Nodes at given distance in a Binary Tree Solve
• Sorted Linked List to BST Solve
• Binary Tree to Doubly Linked List Solve
• Maximum sum path between two leaf nodes Solve
• K-Sum Paths Solve
• Number of turns in a binary tree Solve
• Merge two BST’s Solve
• Fixing two nodes of a BST Solve
• Burn Binary Tree Solve

**Save For later !! **

If you find this helpfull plz upvote it !
I will provide top 50 of each topic if got demand thanks !!

I'm pretty happy with my job. I'm about 3 years in now and the pay is good, WLB is great, and my manager/team are all pretty chill. I also generally like SWE work too, even after AI has come along.

Just because things are good right now though doesn't mean they'll be good in like, 15, 10, 5 or even 2 years at the rate things are going. I'm wondering if you all are also thinking of backup plans away from SWE work because longer term, I'd like to have some semblance of a job lol.

Any advice on if I should consider a real escape plan?

If so, are there AI resilient career paths that I should be considering What type of extra schooling would I need to do? Or am I just overreacting?

This is a collection of Google interview experiences from various candidates across different locations and levels (L3, L4, L5, etc.). These posts cover phone screens, onsite rounds, and overall hiring experiences. Good luck preparing!

📌 L3 & L4 Interview Experiences:

Google L3/L4 - Passed: https://leetcode.com/discuss/interview-experience/1879225/Google-L3or-L4-(L3-passed)

Google L3/L4: https://leetcode.com/discuss/interview-experience/1895002/Google-L3-or-L4

Google L4 - Bangalore - Reject: https://leetcode.com/discuss/interview-experience/1900084/Google-L4-or-Bangalore-or-Reject

Google L3 - Munich: https://leetcode.com/discuss/interview-experience/1941615/Google-or-L3-or-Munich

Google L4 - Reject, L3 Offer - Bangalore: https://leetcode.com/discuss/interview-experience/2001716/Google-or-L4-Reject-L3-Offer-or-Bangalore-or-March-2022

Google L4 SWE III - San Bruno, CA - Reject: https://leetcode.com/discuss/interview-experience/2049667/Google-or-L4-SWEIII-or-San-Bruno-CA-or-2022-05-03-Reject

Google L3 - Bangalore - May 2022 - Reject: https://leetcode.com/discuss/interview-experience/2072074/Google-or-Software-Engineer-L3-or-Banglore-or-May-2022-Reject

Google L4 - India: https://leetcode.com/discuss/interview-experience/2085058/Google-or-L4-or-India

Google L4 - Bangalore - June 2022 - Offer: https://leetcode.com/discuss/interview-experience/2327406/Google-or-L4-or-Bangalore

Google L4 - California - May 2022 Reject: https://leetcode.com/discuss/interview-experience/2189533/Google-or-Software-Engineer-L4-or-California-or-May-2022-Reject

Google L4 - Warsaw Poland - July 2022 - Rejected: https://leetcode.com/discuss/interview-experience/2315084/Google-or-L4-or-Warsaw-Poland-or-July-2022-or-Result%3A-Rejected

Google L4 experience (India): https://leetcode.com/discuss/interview-experience/2328945/Google-L4-experience-(India)

Google L4 - India: https://leetcode.com/discuss/interview-experience/2352261/Google-or-L4-or-India

Google L4 - India: https://leetcode.com/discuss/interview-experience/2369115/Google-or-L4-or-India

Google Onsite Round L4 India: https://leetcode.com/discuss/interview-experience/2543903/Google-Onsite-Round-L4-Experience-or-India

Google L4 interview experience: https://leetcode.com/discuss/interview-experience/2543199/Google-L4-interview-experience

Google L4 Bad Experience: https://leetcode.com/discuss/interview-experience/2626025/Google-L4-or-Bad-Experience

Google L4 Oct 2022: https://leetcode.com/discuss/interview-experience/2774774/Google-or-L4-or-Oct-2022

Google L4 Bangalore Oct 2022 Offer: https://leetcode.com/discuss/interview-experience/2785652/Google-or-L4-or-Bangalore-or-October-2022-or-Offer

Google L4 Phone Interview 5050: https://leetcode.com/discuss/interview-experience/4151431/Google-L4-Phone-Interview-or-5050

Google Interview Experience L4 downleveled to L3: https://leetcode.com/discuss/interview-experience/4325990/Google-Interview-Experience-or-L4-downleveled-to-L3-or-Bengaluru-or-Passed

Google India L3 interview experience: https://leetcode.com/discuss/interview-experience/4544743/Google-India-L3-interview-experience

Google L4 Seattle January 2024 Hiring Freeze: https://leetcode.com/discuss/interview-experience/4630516/Google-or-L4-or-Seattle-or-January-2024-Hiring-Freeze

Google SDE-2 L3 Interview Experience - Reject: https://leetcode.com/discuss/interview-experience/4788905/Google-SDE-2-L3-Interview-Experience-or-Reject

Google SDE-2 (L3) Interview Experience India: https://leetcode.com/discuss/interview-experience/4778433/Google-or-SDE-2-(L3)-or-Interview-Experience-India

Google L3 Bangalore: https://leetcode.com/discuss/interview-experience/4854843/Google-or-L3-or-Bangalore

Google SDE2 India Mar 2024 Selected: https://leetcode.com/discuss/interview-experience/4892806/Google-or-SWE2-or-India-or-Mar-2024-Selected

Google L4 Bangalore Jan 2024 Offer: https://leetcode.com/discuss/interview-experience/4999647/Google-or-L4-or-Bangalore-or-Jan-2024-Offer

GOOGLE L3 INDIA REJECT: https://leetcode.com/discuss/interview-experience/5063892/GOOGLE-or-L3-or-INDIA-or-REJECT-or-DUMB-GOOGLE-INTERVIEWER-RUINED-MY-ONSITE

Google L4 Interview Exp Banglore Downlevel: https://leetcode.com/discuss/interview-experience/5115779/Google-L4-Interview-Exp-Banglore-or-Downlevel

Google L4 Hyderabad Apr 2024 Reject: https://leetcode.com/discuss/interview-experience/5117851/Google-or-L4-or-Hyderabad-or-Apr-2024-Reject

Google L3 Interview India Offer: https://leetcode.com/discuss/interview-experience/5120651/Google-or-L3-Interview-or-India-Offer

Google L4 April 2024 Offer: https://leetcode.com/discuss/interview-experience/5160156/Google-or-L4-or-April-2024-or-Offer

Google L3 (Phone + Onsite): https://leetcode.com/discuss/interview-experience/5193138/Google-L3-(Phone-%2B-Onsite)

Chances Google L4 Banglore: https://leetcode.com/discuss/interview-experience/5220080/Chances-Google-L4-or-Banglore

Google L3 Bangalore: https://leetcode.com/discuss/interview-experience/5231412/Google-or-L3-or-Bangalore

Google L4 May 2024: https://leetcode.com/discuss/interview-experience/5242146/Google-or-L4-or-May-2024

Google L3 Onsite: https://leetcode.com/discuss/interview-experience/5272684/Google-L3-Onsite

Google L4 Offer: https://leetcode.com/discuss/interview-experience/5387760/Google-or-L4-or-Offer

Google L4 Selected: https://leetcode.com/discuss/interview-experience/5362987/Google-or-L4-or-Selected

Google Software engineer core: https://leetcode.com/discuss/interview-experience/5474046/Google-or-Software-engineer-core

Google Interview Experience L4 (Rejected): https://leetcode.com/discuss/interview-experience/5482171/Google-or-Interview-Experience-or-L4-(Rejected)

Google Interview Experience L3 Rejected: https://leetcode.com/discuss/interview-experience/5484676/Google-or-Interview-Experience-or-L3-or-SDE-2-or-Rejected-or-Hyderabad-or-2024

Google L3 ChancesExperience: https://leetcode.com/discuss/interview-experience/5499901/Google-L3-ChancesExperience

Google Software Engineer Bangalore: https://leetcode.com/discuss/interview-experience/5576685/Google-or-Software-Engineer-or-Bangalore

Google Bangalore L4 Phonescreen Aug 2024: https://leetcode.com/discuss/interview-experience/5660936/Google-or-Bangalore-or-L4-or-Phonescreen-or-Aug-2024

Google SDE(L3) BangaloreHyd Aug 24: https://leetcode.com/discuss/interview-experience/5720580/Google-or-SDE(L3)-or-BangaloreHyd-or-Aug-24

Google L4 (Backened) Bangalore Hyderabad Aug 2024 Reject: https://leetcode.com/discuss/interview-experience/5741664/Google-or-L4-(Backened)-or-Bangalore-or-Hyderabad-or-Aug-2024-Reject

Google L4 India Rejected: https://leetcode.com/discuss/interview-experience/5807042/Google-or-L4-or-India-or-Rejected

Google London L4 Aug-Oct 24 Offer accepted: https://leetcode.com/discuss/interview-experience/5979952/Google-London-or-L4-or-Aug-Oct-24-Offer-accepted

Google L3 Interview Experience Oct 2024: https://leetcode.com/discuss/interview-experience/6033289/Google-L3-or-Interview-Experience-or-Oct-2024

Google L3 Nov 2024 Offer: https://leetcode.com/discuss/interview-experience/6084576/Google-or-L3-or-Nov-2024-Offer

Google L4 interview expereince: https://leetcode.com/discuss/interview-experience/6084864/Google-L4-interview-expereince

Google SWE(L3) India Dec 2024 Reject: https://leetcode.com/discuss/interview-experience/6115417/Google-or-SWE(L3)-or-India-or-Dec-2024-Reject

Google L3 Onsite Interview Question: https://leetcode.com/discuss/interview-experience/6138690/Google-L3-Onsite-Interview-Question

Google L3 Bangalore Offer: https://leetcode.com/discuss/interview-experience/6181697/Google-or-L3-or-Bangalore-Offer

Google L4 Interview Experience: https://leetcode.com/discuss/interview-experience/6251197/Google-or-L4-or-Interview-Experience

📌 L5 & Above Interview Experiences:

Google L5 - London - Offer: https://leetcode.com/discuss/interview-experience/2366805/Google-or-L5-or-London-or-Offer

Google L5 - Offer: https://leetcode.com/discuss/interview-experience/2417227/Google-or-L5-or-Offer

Google L6 - Seattle - Offer: https://leetcode.com/discuss/interview-experience/2475534/Google-or-L6-or-Seattle-or-Offer

Google L6 - Interview Experience: https://leetcode.com/discuss/interview-experience/2510406/Google-or-L6-or-Interview-Experience

Google L5 - Munich - Offer: https://leetcode.com/discuss/interview-experience/2548121/Google-or-L5-or-Munich-or-Offer

Google L5 - Zurich - Offer: https://leetcode.com/discuss/interview-experience/2558955/Google-or-L5-or-Zurich-or-Offer

Google L5 Bay Area: https://leetcode.com/discuss/interview-experience/2559774/Google-or-L5or-Bay-Area-or-Phone-Screen-and-Onsite

Google London Oct 2022 Onsite: https://leetcode.com/discuss/interview-experience/2800966/Google-or-London-or-Oct-2022-or-Onsite

Google L5 Bengaluru: https://leetcode.com/discuss/interview-experience/2902800/Google-or-L5-or-Bengaluru

Google SDE3 Role: https://leetcode.com/discuss/interview-experience/4274878/Google-SDE3-Role

Google Cloud Senior Software Engineer India: https://leetcode.com/discuss/interview-experience/4309679/Google-Cloud-or-Senior-Software-Engineer-or-India

Google Onsite L5: https://leetcode.com/discuss/interview-experience/4761322/Google-or-Onsite-or-L5

Google Onsite L5: https://leetcode.com/discuss/interview-experience/4986696/Google-Onsite-L5

Google L5 Android Offer: https://leetcode.com/discuss/interview-experience/5597647/Google-or-L5-Android-or-Offer

Google L5 Reject: https://leetcode.com/discuss/interview-experience/6222532/Google-L5-or-Reject

📌 Internship Experiences:

Google Internship - India - Offer: https://leetcode.com/discuss/interview-experience/2497266/Google-or-Internship-or-India-or-Offer

Google SW intern Interview BangaloreHyderabad: https://leetcode.com/discuss/interview-experience/2675700/Google-or-SW-intern-or-Interview-or-BangaloreHyderabad

Google Winter Internship 2023 Rejected: https://leetcode.com/discuss/interview-experience/2704779/Google-Interview-oror-Winter-Internship-2023-oror-Rejected

Google on campus interview experience Dec 2023: https://leetcode.com/discuss/interview-experience/4771929/Google-on-campus-interview-experience-Dec-2023

Google Intern Oncampus Interview Experience: https://leetcode.com/discuss/interview-experience/5910608/Google-Intern-Oncampus-Interview-Experience

Google SWE Intern 2025 Interview Experience: https://leetcode.com/discuss/interview-experience/6034578/Google-SWE-Intern-2025-Interview-Experience

Google Intern India JULY 2024: https://leetcode.com/discuss/interview-experience/5727153/Google-or-Intern-or-India-or-JULY-2024

📌 Phone Screens:

Google Phone Screen Dublin Offer: https://leetcode.com/discuss/interview-experience/2050509/Google-or-Dublin-or-Offer

Google Phone Screen India: https://leetcode.com/discuss/interview-experience/2279548/Google-or-Phone-Screen-or-Question-or-India

Google L5 USA phone screen Bad recruiter: https://leetcode.com/discuss/interview-experience/2311998/Google-or-L5or-USAor-phone-screen-or-Bad-recruiteror

Google New Grad Passed Phone Screen: https://leetcode.com/discuss/interview-experience/2693488/Google-New-Grad-or-Phone-Screen-or-Passed

Google PASSED Phone Screen Interview: https://leetcode.com/discuss/interview-experience/2698118/Google-Phone-Screen-Interview-or-PASSED

Google Technical Phone Screen questions: https://leetcode.com/discuss/interview-experience/3510797/Google-Technical-Phone-Screen-questions

Google Phone Screen Experience Reject: https://leetcode.com/discuss/interview-experience/3910856/Google-Phone-Screen-Experience-Reject

Google Virtual Phone Screen or Google Meet Interview: https://leetcode.com/discuss/interview-experience/4209006/Google-Virtual-Phone-Screen-or-Google-Meet-Interview

Google phone screen rejected: https://leetcode.com/discuss/interview-experience/5131998/Google-phone-screen-rejected

Google Phone Screen Reject: https://leetcode.com/discuss/interview-experience/5216327/Google-Phone-Screen-or-Reject

Google London L3 Phonescreen: https://leetcode.com/discuss/interview-experience/5273441/Google-London-L3-Phonescreen

Google L3 phone screening: https://leetcode.com/discuss/interview-experience/5864776/Google-L3-phone-screening

Google Phone Screen L4: https://leetcode.com/discuss/interview-experience/6011543/Google-Phone-Screen-L4

Google SWE grad 2025 Held from JULY 2024: https://leetcode.com/discuss/interview-experience/6167705/Google-SWE-grad-2025-or-Held-from-JULY-2024

Google Phone Screen L3l4: https://leetcode.com/discuss/interview-question/5386347/Google-Phone-screen-L3l4

Google Phone Screen Reject: https://leetcode.com/discuss/interview-question/1641096/Google-or-Phone-Screen-or-Reject

• Google Phone String Substitutor: https://leetcode.com/discuss/interview-question/1678945/Google-or-Phone-or-String-Substitutor
• Google Phone Screen Number of Islands in a Tree: https://leetcode.com/discuss/interview-question/1682632/Google-or-Phone-Screen-or-Number-of-Islands-in-a-Tree
• Google Phone Screen Job Sequencing Problem: https://leetcode.com/discuss/interview-question/1706591/Google-or-Phone-Screen-or-Job-Sequencing-Problem
• Google Phone Screen SWE L3 Gmail Label Strings: https://leetcode.com/discuss/interview-question/1717614/Google-or-Phone-Screen-or-SWE-L3-or-Gmail-Label-Strings
• Google Phone Time for turn: https://leetcode.com/discuss/interview-question/2199394/Google-or-Phone-or-Time-for-turn
• Google Phone Screen L3 June 2022: https://leetcode.com/discuss/interview-question/2245766/Google-or-Phone-Screen-or-L3-or-June-2022
• Google SWE phone screen interview question: https://leetcode.com/discuss/interview-question/2273601/Google-SWE-phone-screen-interview-question
• Google Phone Interiew: https://leetcode.com/discuss/interview-question/2279055/Google-or-Phone-Interiew
• Google Phone Screening Tiling Problem: https://leetcode.com/discuss/interview-question/2337763/Google-or-Phone-Screening-or-Tiling-Problem
• Google L5 Phone Screening: https://leetcode.com/discuss/interview-question/2346914/Google-or-L5-or-Phone-Screening
• Google Phone Screen Brazil Reject: https://leetcode.com/discuss/interview-question/2670001/Google-or-Phone-Screen-or-Brazil-or-Reject

Google telephonic round:https://leetcode.com/discuss/interview-question/2771105/Googleor-telephonic-round

Google phone screen: https://leetcode.com/discuss/interview-question/2798039/Google-phone-screen

Google Phone interview Matching APKs to Devices in Google Play: https://leetcode.com/discuss/interview-question/2813059/Google-or-Phone-interview-or-Matching-APKs-to-Devices-in-Google-Play

Google Phone Screen 1-Dimensional array: https://leetcode.com/discuss/interview-question/2903981/Google-or-Phone-Screen-or-1-Dimensional-array

Google Phone Screen Software Engineer December 2022: https://leetcode.com/discuss/interview-question/2926214/Google-Phone-Screen-or-Software-Engineer-or-December-2022

GoogleorPhone-screenorCut a cake vertically without destroying toppings: https://leetcode.com/discuss/interview-question/2929756/GoogleorPhone-screenorCut-a-cake-vertically-without-destroying-toppings

Google Phone Screen Senior Software Developer Mountain View March 2023: https://leetcode.com/discuss/interview-question/3327144/Google-or-Phone-Screen-or-Senior-Software-Developer-or-Mountain-View-or-March-2023

Google Telephonic Interview Question: https://leetcode.com/discuss/interview-question/3526286/Google-or-Telephonic-Interview-Question

Google telephonic interview: https://leetcode.com/discuss/interview-question/3687050/Google-telephonic-interview

Google Screening Interview L5: https://leetcode.com/discuss/interview-question/3882795/Google-Screening-Interview-L5

Google phone screen 2: https://leetcode.com/discuss/interview-question/4041891/Google-phone-screen-2

Google interview Question First Round: https://leetcode.com/discuss/interview-question/4060331/Google-interview-Question-First-Round

Google Phonescreen for 2024 newgrad role Video relation: https://leetcode.com/discuss/interview-question/4128520/Google-or-Phonescreen-for-2024-newgrad-role-or-Video-relation

Google Phone Screen L5: https://leetcode.com/discuss/interview-question/4130644/Google-or-Phone-Screen-or-L5

Google Interview Round 1: https://leetcode.com/discuss/interview-question/4271223/Google-Interview-Round-1

Google Phone Screen (Easy): https://leetcode.com/discuss/interview-question/4288827/Google-Phone-Screen-(Easy)

Google Phone Screen Interview: https://leetcode.com/discuss/interview-question/4426050/Google-Phone-Screen-Interview

Google phone interview round: https://leetcode.com/discuss/interview-question/4553820/Google-phone-interview-round

Google Telephonic round: https://leetcode.com/discuss/interview-question/4654572/Google-Telephonic-round

Google Phone Screening Remove common elements from array from prefix of length K in two arrays: https://leetcode.com/discuss/interview-question/4749105/Google-or-Phone-Screening-or-Remove-common-elements-from-array-from-prefix-of-length-K-in-two-arrays

google screening question: https://leetcode.com/discuss/interview-question/5131934/google-screening-question

📌 Miscellaneous Experiences (More General/Uncategorized):

Google Software Engineer - August 2022: https://leetcode.com/discuss/interview-experience/2677042/Google-or-Software-Engineer-or-August-2022

Google Software Engineer India May 2022 Reject: https://leetcode.com/discuss/interview-experience/2094439/Google-or-Software-Engineer-or-India-or-May-2022-or-Reject

Google Graduate Software Engineer Warsaw Reject: https://leetcode.com/discuss/interview-experience/2240651/Google-or-Graduate-Software-Engineer-or-Warsaw-or-Reject

Google EMEA Spring 2022 Accepted: https://leetcode.com/discuss/interview-experience/2254156/Google-or-EMEA-or-Spring-2022-or-Accepted

Google 9 months Experience Software Engineer: https://leetcode.com/discuss/interview-experience/2293724/Google-or-9-months-Experience-or-Software-Engineer

Google SWE ML(L5) Remote (US) July 2022 Reject: https://leetcode.com/discuss/interview-experience/2328462/Google-or-SWE-ML-(L5)-or-Remote-(US)-or-July-2022-Reject

Interview Experience: https://leetcode.com/discuss/interview-experience/2440525/Interview-Experience

Google Canada(Remote) Sep 2022 Reject: https://leetcode.com/discuss/interview-experience/2639889/Google-or-Software-Engineer-or-Canada(Remote)-or-Sep-2022-Reject

Google SDE US July 2023: https://leetcode.com/discuss/interview-experience/3917297/Google-or-SDE-or-US-or-July-2023

Google SWE 23 Offer Warsaw: https://leetcode.com/discuss/interview-experience/5421358/Google-or-Warsaw-or-SWE-23-or-Offer

Google New Grad 2025 India Interview Experience: https://leetcode.com/discuss/interview-experience/6022505/Google-New-Grad-2025-or-India-or-Interview-Experience-or-Tech-%2B-Googleyness

📌 Interview Questions (Focus on specific questions asked):

Google Interview Question Data structure 7yoe: https://leetcode.com/discuss/interview-experience/2402978/Google-Interview-Question-Data-structure-7yoe

Google Onsite Interview Experience: https://leetcode.com/discuss/interview-experience/2434569/Google-Onsite-Interview-Experience

Google Phone Interview Question 2022 Graphs: https://leetcode.com/discuss/interview-experience/2701782/Google-Phone-Interview-Question-2022-Graphs

Google Interview Round 1: https://leetcode.com/discuss/interview-question/4271223/Google-Interview-Round-1

Google interview question: https://leetcode.com/discuss/interview-question/4137303/Google-Interview-Question

Google On Site or L4: https://leetcode.com/discuss/interview-question/4152152/Google-On-Site-or-L4

Phone Screen Interview Question: https://leetcode.com/discuss/interview-question/4159271/Phone-Screen-Interview-Question

Google Interview Experience: https://leetcode.com/discuss/interview-question/4223067/Google-Interview-Experience

Google Interview Round 1: https://leetcode.com/discuss/interview-question/4181496/Google-Interview-Round-1

Google Technical Interview: https://leetcode.com/discuss/interview-experience/5744509/Google-Technical-Interview

Google L3 Onsite Interview Question: https://leetcode.com/discuss/interview-experience/6138690/Google-L3-Onsite-Interview-Question

Google Interview Experience: https://leetcode.com/discuss/interview-experience/6022505/Google-New-Grad-2025-or-India-or-Interview-Experience-or-Tech-%2B-Googleyness

Specific Interview Questions (Potentially useful for practice):

Google Create a tree Jan '22: https://leetcode.com/discuss/interview-question/1693351/Google-or-Create-a-tree-or-Jan-'22

Google Onsite Recursively delete leave nodes in a multi-tree: https://leetcode.com/discuss/interview-question/1693416/Google-or-Onsite-or-Recursively-delete-leave-nodes-in-a-multi-tree

Google Interview question 2022 phone onsite graph DP: https://leetcode.com/discuss/interview-question/1718834/Google-Interview-question-2022-or-phone-onsite-or-graph-DP

Google interview: https://leetcode.com/discuss/interview-question/1725461/Google-interview

Google Tech Screen Design SpreadSheet Python: https://leetcode.com/discuss/interview-question/1745472/Google-or-Tech-Screenor-Design-SpreadSheet-Python

GoogleOnsiteUSAorfeb-2022: https://leetcode.com/discuss/interview-question/1776950/GoogleorOnsiteorUSAorfeb-2022

Google Onsite Find the IDs of activities that have timed out: https://leetcode.com/discuss/interview-question/1789446/Google-or-Onsite-or-Find-the-IDs-of-activities-that-have-timed-out

Google Onsite Burst Balloons: https://leetcode.com/discuss/interview-question/1792788/Google-or-Onsite-or-Burst-Balloons

Google Onsite Virtual Results Pending: https://leetcode.com/discuss/interview-question/1838215/Google-or-Onsite-or-Virtual-or-Results-Pending

Google Tokyo Chaining Broadcast Signals: https://leetcode.com/discuss/interview-question/1888559/Google-Tokyo-or-Chaining-Broadcast-Signals

Google Onsite Question: https://leetcode.com/discuss/interview-question/1918329/Google-Onsite-Question

Google US Onsite April 5th 2022: https://leetcode.com/discuss/interview-question/1920806/Google-US-Onsite-April-5th-2022

Google SDE (L4L5) Virtual Onsite PASSED: https://leetcode.com/discuss/interview-question/1930341/Google-or-SDE-(L4L5)-or-Virtual-Onsite-or-PASSED

Google Onsite Implement match method for Regular Expression Tree: https://leetcode.com/discuss/interview-question/1946698/Google-or-Onsite-or-Implement-match-method-for-Regular-Expression-Tree

Google SE Full-stack screening round: https://leetcode.com/discuss/interview-question/1984426/Google-SE-Full-stack-screening-round

Google Onsite Coding Interview question: https://leetcode.com/discuss/interview-question/2002748/Google-Onsite-Coding-Interview-question

Google Onsite Banglore May 2022 Patient Queue: https://leetcode.com/discuss/interview-question/2072047/Google-or-Onsite-or-Banglore-or-May-2022-or-Patient-Queue

Google Onsite Banglore May 2022 Count House in the Circle: https://leetcode.com/discuss/interview-question/2074673/Google-or-Onsite-or-Banglore-or-May-2022-or-Count-House-in-the-Circle

Google Interview Experience SE Full Stack Virtual Interview: https://leetcode.com/discuss/interview-question/2104997/Google-or-Interview-Experience-or-SE-Full-Stack-or-Virtual-Interview

Google Screening: https://leetcode.com/discuss/interview-question/2122202/Google-or-Screening

Google Stage Onsite Reject: https://leetcode.com/discuss/interview-question/2128417/Google-or-Stage-Onsite-or-Reject

Google Virtual Onsite L3 SWE Question: https://leetcode.com/discuss/interview-question/2180421/Google-or-Virtual-Onsite-L3-SWE-or-Question

Google onsite interview coding question bipartite graph: https://leetcode.com/discuss/interview-question/2189957/Google-onsite-interview-coding-question-bipartite-graph

Google Onsite Generic language translator: https://leetcode.com/discuss/interview-question/2199392/Google-or-Onsite-or-Generic-language-translator

Google Onsite Flow water to cities: https://leetcode.com/discuss/interview-question/2199393/Google-or-Onsite-or-Flow-water-to-cities

Google IN5 Onsite Find First Missing sub-sequence: https://leetcode.com/discuss/interview-question/2199816/Google-or-IN5-or-Onsite-or-Find-First-Missing-sub-sequence

Google Onsite LinkedList Question: https://leetcode.com/discuss/interview-question/2274143/Google-Onsite-LinkedList-Question

Google Onsite Currency Arbitrage 2022: https://leetcode.com/discuss/interview-question/2298787/Google-Onsite-or-Currency-Arbitrage-or-2022

Google Onsite London: https://leetcode.com/discuss/interview-question/2304772/Google-or-Onsite-or-London

Google Onsite Find Group of 3 Numbers Within a Distance-'d': https://leetcode.com/discuss/interview-question/2337836/Google-or-Onsite-or-Find-Group-of-3-Numbers-Within-a-Distance-'d'

Google interview question Implement touchscreen keyboard.: https://leetcode.com/discuss/interview-question/2352175/Google-interview-question-Implement-touchscreen-keyboard.

Google India L3 Onsite Questions: https://leetcode.com/discuss/interview-question/2356382/Google-India-L3-or-Onsite-Questions

Google L3 onsite question 2022: https://leetcode.com/discuss/interview-question/2371832/Google-L3-onsite-question-2022

Google Onsite Fixed sorted array: https://leetcode.com/discuss/interview-question/2375984/Google-or-Onsite-or-Fixed-sorted-array

Google Onsite Word from the board: https://leetcode.com/discuss/interview-question/2419256/Google-or-Onsite-or-Word-from-the-board

Google L4L3 India 2022: https://leetcode.com/discuss/interview-question/2474580/Google-or-L4L3-or-India-or-2022

Google L3 Bangalore Aug 2022: https://leetcode.com/discuss/interview-question/2483765/Google-or-L3-or-Bangalore-or-Aug-2022

Google Onsite Bengaluru L4: https://leetcode.com/discuss/interview-question/2499179/Google-or-Onsite-or-Bengaluru-or-L4

Google Onsite London: https://leetcode.com/discuss/interview-question/2526280/Google-Onsite-London

Google India On Campus Aug 22: https://leetcode.com/discuss/interview-question/2526619/Google-India-or-On-Campus-or-Aug-22

Google Onsite Bengaluru L4: https://leetcode.com/discuss/interview-question/2504930/Google-or-Onsite-or-Bengaluru-or-L4

Google Matrix Question: https://leetcode.com/discuss/interview-question/2609016/Google-Matrix-Question

Google Onsite:https://leetcode.com/discuss/interview-question/2697412/Google-Onsite

Google Final Interview Elevator Question DP: https://leetcode.com/discuss/interview-question/2723912/Google-or-Final-Interview-or-Elevator-Question-DP

Google recent ref:https://leetcode.com/discuss/interview-question/2784988/Google-recent-ref

Google Onsite Coding Round India: https://leetcode.com/discuss/interview-question/3179899/Google-or-Onsite-Coding-Round-or-India

Google onsite India: https://leetcode.com/discuss/interview-question/3199858/Google-onsite-or-India

Google SDE:https://leetcode.com/discuss/interview-question/3215881/Google-SDE

Google Onsite Apartment Hunting: https://leetcode.com/discuss/interview-question/4017756/Google-or-Onsite-or-Apartment-Hunting

Google Interview Round 1:https://leetcode.com/discuss/interview-question/4181496/Google-Interview-Round-1

Google Interview Round 1: https://leetcode.com/discuss/interview-question/4263604/Google-or-Onsite-or-Round-1

Google onsite or L3: https://leetcode.com/discuss/interview-question/4701657/Google-or-onsite-or-L3

Google L3 All rounds:https://leetcode.com/discuss/interview-question/4970761/Google-or-L3-or-All-rounds

Specific LeetCode Problems Asked:

Rearrange Spaces Between Words:https://leetcode.com/problems/rearrange-spaces-between-words/description/

Sequence Reconstruction:https://leetcode.com/problems/sequence-reconstruction/description/

Maximum Number of Visible Points:https://leetcode.com/problems/maximum-number-of-visible-points/description/

My Calendar I: https://leetcode.com/problems/my-calendar-i/description/

Longest String Chain:https://leetcode.com/problems/longest-string-chain/description/

📌 Miscellaneous Experiences (More General/Uncategorized):

Google Software Engineer - August 2022: https://leetcode.com/discuss/interview-experience/2677042/Google-or-Software-Engineer-or-August-2022

Google Software Engineer India May 2022 Reject: https://leetcode.com/discuss/interview-experience/2094439/Google-or-Software-Engineer-or-India-or-May-2022-or-Reject

Google Graduate Software Engineer Warsaw Reject: https://leetcode.com/discuss/interview-experience/2240651/Google-or-Graduate-Software-Engineer-or-Warsaw-or-Reject

Google EMEA Spring 2022 Accepted: https://leetcode.com/discuss/interview-experience/2254156/Google-or-EMEA-or-Spring-2022-or-Accepted

Google 9 months Experience Software Engineer: https://leetcode.com/discuss/interview-experience/2293724/Google-or-9-months-Experience-or-Software-Engineer

Google SWE ML(L5) Remote (US) July 2022 Reject: https://leetcode.com/discuss/interview-experience/2328462/Google-or-SWE-ML-(L5)-or-Remote-(US)-or-July-2022-Reject

Interview Experience: https://leetcode.com/discuss/interview-experience/2440525/Interview-Experience

Google Canada(Remote) Sep 2022 Reject: https://leetcode.com/discuss/interview-experience/2639889/Google-or-Software-Engineer-or-Canada(Remote)-or-Sep-2022-Reject

Google SDE US July 2023: https://leetcode.com/discuss/interview-experience/3917297/Google-or-SDE-or-US-or-July-2023

Google SWE 23 Offer Warsaw: https://leetcode.com/discuss/interview-experience/5421358/Google-or-Warsaw-or-SWE-23-or-Offer

Google New Grad 2025 India Interview Experience: https://leetcode.com/discuss/interview-experience/6022505/Google-New-Grad-2025-or-India-or-Interview-Experience-or-Tech-%2B-Googleyness

Background

College: Tier 1.5
Education: B. Tech (CSE)
YoE: 1 year, 2 months

Offer Details

Company: Flexport (formerly Shopify Logistics)
Base: 33 LPA
Joining Bonus: 3 LPA
Fixed yearly Bonus: 3.3LPA (10% of base) given on a quarterly basis
ESOPs: ~21.6L/year ($7.5/unit for 3000 RSUs/year according to internal stock price)
Total first year comp: ~61 LPA

Location: Remote / Hybrid (Blr) depending on team
Benefits: Flexible hours, leaves, WFH setup

Note

This offer was from last year, decided to post now, might or might not be relevant today.

My interview prep journey — what worked for me

In the last 1 month, I went through interviews with Nielsen, New Relic and Crunchyroll and received offers from all.

I had been struggling with interviews for quite some time, so I wanted to share what worked for me. There wasn't one magic resource — it was a combination of a few things.

1. DSA

I focused more on patterns rather than solving hundreds of questions.

Arrays, HashMap, sliding window, two pointers, binary search, trees, graphs, heaps, DP, etc.

During practice, I also started explaining my approach out loud — brute force → optimization → complexity → edge cases.

This helped a lot during actual interviews.

1. LLD

LLD was initially one of my weaker areas.

I practiced problems like Parking Lot, BookMyShow, Elevator, Vending Machine, Splitwise, etc.

Instead of memorizing solutions, I focused on SOLID, design patterns, composition/inheritance, interfaces and extensibility.

The goal was to be able to design something I hadn't seen before.

1. HLD / System Design

I practiced systems like URL Shortener, Rate Limiter, Notification System, File Storage, WhatsApp, etc.

The biggest improvement was learning to explain why I was choosing something, rather than just saying "use Kafka/Redis/Elasticsearch."

I prepared for scaling, failures, retries, consistency, caching, partitioning and trade-offs.

1. Project Deep Dive

This was probably the most important part for me.

I went extremely deep into my projects — architecture, data flow, Kafka, MongoDB, Elasticsearch, LLM integration, retries, DLQs, scaling, monitoring, failures, etc.

I also made sure I could clearly explain what I personally built, not just what the overall team built.

This helped significantly in HM and technical deep-dive rounds.

1. Java / Backend

I revised the fundamentals rather than trying to learn new frameworks.

Java Collections, HashMap internals, concurrency, JVM basics, Spring Boot, Kafka, Redis, databases and distributed systems.

Since these were technologies I had actually worked with, going deeper into the fundamentals was much more useful than learning something completely new.

1. Behavioral / HM

I prepared a few real stories around ownership, conflict, production issues, failure, ambiguity and cross-team collaboration.

I used STAR as a structure but didn't memorize answers word-for-word.

For experienced candidates, I think being able to clearly explain what you did, why you did it and what happened afterward matters a lot.

1. Mock Interviews

One thing that helped me was actually speaking through answers.

I'd pick a topic and ask myself follow-up questions:

Why Kafka?
What happens if a consumer crashes?
Why MongoDB instead of PostgreSQL?
How would you scale this?

This exposed gaps much faster than just reading notes.

Final takeaway

There wasn't one resource or trick that got me through the interviews.

For me, it was:

DSA + LLD + HLD + strong project knowledge + Java/backend fundamentals + mock interviews.

And probably the biggest lesson I learned:

Don't just prepare to solve interview questions. Prepare to explain the engineering decisions you've made in your actual work.

Hope this helps someone who's currently preparing. All the best! 🚀

I was verbally informed that I was selected for an Oracle IC3 role over a month ago, but I’m still waiting for the official offer letter. And now they have extended the timelines to one more month while initially the HR conveyed it'll hardly take 3 to 4 days.

For people who have recently gone through the Oracle hiring process:

• How long did it take for you to receive the formal offer after the verbal confirmation?
• Is a delay of 4 to 6+ weeks common for IC3?
• Is anyone else currently experiencing a similar delay?

Would really appreciate any recent experiences or timelines, especially from candidates who joined/received offers recently.

Thank you!

Oracle Interview Questions

He somehow found a way to mention he had two offers already, when I did not ask or care. Called my opening question a classic, solved it too, fast, narrating like a lecturer, pausing to say things like "there's a cuter way but I'll keep it readable for us."

When I pushed a harder follow-up he went "ooh, spicy," and cracked his knuckles. I cannot even begin to explain how much that infuriated me. Then ended the call with good luck with the rest of your candidates. I fucking hate this kid.

It’s pretty boring here. I’m making decent $ as a Staff Eng working fully remote and 20 hr workweeks but that’s where it ends. Work doesn’t excite me, it’s actually deteriorating my skills, I’m not learning anything new.

Any remote friendly companies that would pay $650k+ for Staff+ roles? Reddit and Figma don’t even reply to me ever, Netflix seems like another Airbnb, with no upwards trajectory.

- I love working until 2am every night
- I love learning Chinese to keep up in meetings
- I love our lucrative biannual stock buybacks
- I love the high ownership 24/7 oncall culture
- I love the politics, it’s so exciting

Most of all, I love the upbeat positive culture ❤️. DM for referrals

Bytedance Interview Questions

- I love working until 2am every night
- I love learning Chinese to keep up in meetings
- I love our lucrative biannual stock buybacks
- I love the high ownership 24/7 oncall culture
- I love the politics, it’s so exciting

Most of all, I love the upbeat positive culture ❤️. DM for referrals