The process, round by round
Reported by candidates and, where we found one, the company itself. Each round shows how well it is reported. Processes change by team, level and year.
- 1
Proctored HackerRank test with three problems in one guide; another guide says two to three medium-to-hard problems, sometimes with MCQs. One campus report in a guide has about 200 test takers and about 20 advancing.
- greedy reasoning
- bitmask DP
- combinatorics
Varies: One campus report in a guide describes a CGPA eligibility filter before the test; the other guide lists CGPA cutoffs as eligibility without tying them to the test.
What can be asked in a online assessment round
A timed test on a coding platform, taken alone. Usually two or three coding problems, sometimes with multiple-choice questions on CS basics, aptitude or SQL.
Array and string problems that need a hash map, two pointers or a sliding window
Read the constraints first, because they point to the technique. If n is 100,000, an O(n^2) scan will time out, so look for a hash map, two pointers on a sorted array, or a window that moves forward only. Sketch the brute force, find the repeated work, then remove it. For two-sum style pairs you might say: I store each value's index as I scan, so the complement lookup is O(1) and the whole pass is O(n).
DSA course →Greedy and sorting problems with a catch in the constraints
Greedy problems hide behind a sort. Ask what ordering makes the locally best choice safe, then try to argue why swapping two adjacent choices never helps. Interval scheduling is the classic case: sort by end time and take every interval that starts after the last chosen one. Check the catch in the constraints, such as overflow, ties or equal values, and test a tiny case by hand before submitting.
DSA course →A medium dynamic programming or graph-on-a-grid problem
Decide whether the problem is a graph walk or a recurrence. On a grid, a shortest path with equal step cost is breadth-first search from the start, with a visited set so each cell is processed once, giving O(rows x cols). For dynamic programming, define the state in one sentence, write the transition, set the base cases, then see if only the previous row is needed to save space.
DSA course →SQL queries with joins and group by
Start from the table that holds the thing being counted, join the others on their keys, filter rows with WHERE, group, then filter groups with HAVING. Remember that WHERE runs before grouping and HAVING after. Use LEFT JOIN when rows with no match must still appear, and COUNT of a column rather than star when nulls matter. Example: customers with more than three orders is GROUP BY customer_id HAVING COUNT(*) > 3.
Databases →Multiple-choice questions on OOP, operating systems, databases and networks
These reward quick, accurate recall rather than long reasoning, so revise the short list of definitions that recur. Know the difference between a process and a thread, the four ACID properties, what an index trades for faster reads, TCP against UDP, and the four pillars of OOP. Eliminate two wrong options first, then choose. Do not spend more than a minute on any single question, and flag it to return to if time remains.
Mock interviews →
Prepare with: Book · Online assessmentDSA course
2 sources for this round
- 2
Build a working program within a fixed window, then have it reviewed. The 2024 SDE-2 account describes a Java payment-processing package judged on design patterns, error handling and test coverage; a guide adds that running code, class structure and ease of adding requirements are judged. Durations differ between sources.
- object-oriented design
- design patterns
- error handling
- unit tests
- extensibility
Varies: The only candidate account read is an SDE-2 loop from July 2024.
Practise for this round
- ReportedBuild a payment-processing module with patterns, errors and tests Machine-coding task in Java; time went from 60 to 90 minutes (the page is unsure whether the extension was requested or offered).Candidate write-up ↗
- ReportedBuild a cache as a machine-coding task One of several machine-coding problems named in a guide.Prep guide ↗
- ReportedBuild a file manager as a machine-coding task Named in the same guide, without a first-hand account.Prep guide ↗
Reported prompts have no written answer yet. Read the linked page for context.
What can be asked in a machine coding round
You build a small working system in your own editor in 60 to 120 minutes, then walk through it. Clean entities, extensibility, a runnable demo and tests matter more than clever algorithms.
Parking lot, library or inventory system with several entity types
Spend the first ten minutes on requirements and entities, not code. For a parking lot you might list Vehicle, Slot, Ticket and Lot, with slot types as an enum and the allocation rule hidden behind an interface so a nearest-slot strategy can be swapped. Keep the code runnable early, write a small demo in main, and add a few tests. Say what you would add with more time, such as pricing rules.
Whiteboard →Splitwise-style expense sharing, a wallet or a ledger
The core of expense sharing is a balance ledger: for each pair or each user, store the net amount owed. An expense has a payer, an amount and a split type such as equal, exact or percent, handled by a split strategy per type. Validate that exact splits sum to the total and handle rounding explicitly. To simplify debts, compute each person's net balance and match the largest creditor with the largest debtor.
Snake and ladder, tic-tac-toe, chess or another game engine
Model the board, players, dice or moves, and a game controller that owns the turn loop, with rules kept out of the board class. For tic-tac-toe, keep counters per row, column and both diagonals, so a win check is O(1) per move instead of scanning the grid. For snake and ladder, store jumps in a map from square to destination. Make board size and number of players configurable rather than hard coded.
An in-memory cache, key-value store, rate limiter or job scheduler
Start with the public interface and the invariants. For a rate limiter, a token bucket stores tokens and a last refill time per key, refills lazily on each call and allows the request if a token remains. For an LRU or key-value store, say the data structure and the complexity. For a scheduler, a priority queue ordered by run time with a worker that waits for the earliest job.
Elevator, vending machine or ATM as a state machine
Draw the states and transitions before coding. An elevator is idle, moving up, moving down or doors open, and each event such as a button press or arrival is handled by the current state. A vending machine moves through idle, has money, dispensing and out of stock. Implement it with a state interface or an enum and a transition table, so invalid actions are rejected in one place instead of with scattered if statements.
Follow-ups: add a new rule without rewriting, make it concurrent, add persistence
Show that your design bends without a rewrite. For a new rule, say you add a new class that implements the existing interface and register it, leaving old code unchanged. For concurrency, name the shared state and protect it with a lock per resource, or atomic operations, keeping check-and-update in one critical section. For persistence, put a repository interface in front of storage so an in-memory version can be replaced by a database.
Mock interviews →
2 sources for this round
- 3
Two medium problems framed practically; the 2024 SDE-2 candidate called it an onsite round and the easiest stage. A guide describes video rounds where problems may be talked through rather than fully coded.
- sliding window
- hash maps and sets
- heaps
- explaining trade-offs
What can be asked in a data structures and algorithms round
A live coding round of 45 to 60 minutes with one or two problems. You are judged on how you clarify, reason, code, test and state the complexity, not on the answer alone.
Arrays, strings and hashing: pairs, windows, frequency counts, prefix sums
Name the pattern from the shape of the question. Pairs with a target use a hash map of seen values. A contiguous range with a condition uses a sliding window that grows on the right and shrinks on the left, so each element enters and leaves once, giving O(n). Range sums over many queries use a prefix sum array so each query is O(1) after O(n) setup. Count characters with a fixed-size array or map.
DSA course →Linked lists, stacks and queues, including design-a-structure problems such as an LRU cache
For an LRU cache, combine a hash map from key to node with a doubly linked list ordered by recency. Get moves the node to the front, put inserts at the front, and when over capacity you remove the tail node and its map entry. Both operations are O(1), and you say why: the map finds the node, the list reorders it without a scan. For stacks, mention a monotonic stack for next greater element.
DSA course →Trees and BSTs, graphs (BFS, DFS, topological sort, shortest paths) and grids
Decide the traversal from what is asked. Level by level or shortest path in an unweighted graph is BFS with a queue. Exploring all paths, components or cycles is DFS. A dependency order is topological sort: Kahn's algorithm repeatedly removes nodes with in-degree zero, and leftover nodes mean a cycle. Weighted shortest path with non-negative edges is Dijkstra with a heap, O((V + E) log V). On a BST, an in-order walk is sorted.
DSA course →Heaps and top-K, intervals, binary search on the answer
For the K largest items keep a min-heap of size K: push each element and pop the smallest when the heap exceeds K, so the cost is O(n log K) and memory is O(K). For intervals, sort by start, then merge by comparing the next start with the current end. For binary search on the answer, define a yes or no check that is monotonic, such as can ship within D days, and search the capacity range.
DSA course →Dynamic programming from one dimension up to knapsack and string DP
Define the state in a sentence, write the recurrence, fix the base cases, and decide the order of filling. Start with the recursive version with memoisation, then convert to a table. For 0/1 knapsack, dp[w] is the best value at capacity w, and in the one dimensional form you loop capacity downward so each item is used once. For string problems such as edit distance, the state is a pair of prefix lengths.
DSA course →Follow-ups: optimise space, handle streaming input, make it thread-safe
Treat follow-ups as a chance to show depth, and answer in the same calm order each time. To save space, ask which previous rows or values the recurrence actually reads and keep only those. For streaming input, say what summary you can keep, such as a heap of size K or a running count. For thread safety, name the shared state, guard it with a lock, and keep the critical section short.
Prepare with: Book · DSA roundDSA course
2 sources for this round
- 4
The 2024 SDE-2 account describes a Dropbox-like design where the interviewer kept adding constraints. A guide says this second technical interview is low-level design, or system design at senior levels.
- system design
- low-level design
- handling added constraints
- fault tolerance
Varies: Per a guide, senior levels get system design and lower levels get low-level design; the guide gives no level thresholds.
What can be asked in a system design round
A 45 to 60 minute discussion of how to build a system at scale: requirements, numbers, APIs, data model, components, bottlenecks and trade-offs.
Short links, chat, news feed, notifications, search, rate limiting
Use one repeatable path: clarify scope and scale, estimate load, define the API, sketch the data model, draw the main components, then probe bottlenecks. For short links, store a mapping from a generated short id to the long url, generate ids with a counter encoded in base 62, cache hot links, and note reads far outnumber writes. For chat, mention persistent connections and a store ordered per conversation.
System design course →Payments, wallets and ledgers where money must never be lost or doubled
Money systems put correctness before speed. Use a double-entry ledger where entries are append-only and every transfer writes a debit and an equal credit in one transaction. Protect against doubled charges with an idempotency key stored with the result, so a retry returns the original outcome. For lost updates use a database transaction, and reconcile with the payment provider's records on a schedule.
System design course →Ride matching, maps and anything with live location
Split the problem into location ingestion, a geospatial index and matching. Drivers send updates every few seconds to a write-optimised store, often in memory, keyed by a grid cell such as a geohash or S2 cell. To find nearby drivers, query the rider's cell and its neighbours, then rank by distance and estimated time. Say how you handle a stale location and a driver who accepts two rides.
System design course →File storage and sync, video streaming and content delivery
For file sync, split files into chunks, hash each chunk and upload only chunks the server lacks, so a small edit transfers a small amount. Keep metadata in a database and chunks in object storage. For video, upload the original, transcode into several resolutions, store segments and serve them through a content delivery network with adaptive bitrate streaming, so the player switches quality as bandwidth changes.
System design course →Fundamentals: caching, sharding, replication, queues, consistency, failure handling
Treat each as a tool with a cost. A cache cuts read latency but adds staleness and invalidation. Sharding spreads write load but makes cross-shard queries hard. Replication gives availability and read scale but introduces lag. Queues smooth spikes and decouple services but require idempotent consumers. For failures, name timeouts, retries with backoff and a fallback. State what you give up whenever you choose.
System design course →Back-of-envelope estimates and what they decide
Estimates are there to choose a design, so finish each one with a decision. Use round numbers: a day has about 100,000 seconds, so 10 million requests a day is roughly 100 per second on average, with a peak of a few times that. Multiply object size by count for storage, and compare against one machine's capacity. If one database handles the load, say so and avoid sharding.
Capacity estimation →
Prepare with: Book · System designSystem design course
2 sources for this round
- 5
Past-project deep dive, behavioral questions, and in the 2024 SDE-2 account a lighter design problem. A guide adds schema design and failure handling can appear.
- project depth
- ownership and teamwork
- behavioral answers
- light design
What can be asked in a hiring manager round
A conversation about your past work and how you would fit the team: depth on projects, ownership, decisions and trade-offs, sometimes a design problem.
Pick a project and go deep: why this design, what broke, what you would change
Choose a project you can discuss at every layer. Explain the problem and who it served, the options you considered, why you chose one, what broke and what you would change now. Be clear which parts you did and which the team did. Admitting a flaw earns trust. Opening line: the main constraint was latency, so I chose a cache in front of the database, and I would now add an invalidation strategy.
Resume grilling chapter →A time you disagreed with a teammate or pushed back on a decision
Use situation, task, action, result, and keep the disagreement about the work, never the person. The listener is checking that you can hold a view with evidence, listen, and commit once the decision is made. Describe what you proposed, the data or reasoning you used, how you reached agreement or accepted the other path, and what happened. Do not invent a story: use a real one, even a small one.
Behavioural chapter →How you prioritise when everything is urgent
Show a method rather than a claim of being busy. Describe how you judge impact and deadline, ask who needs the result and when, and say no or renegotiate scope early when two things clash. Mention communicating the trade-off to stakeholders so nobody is surprised. A sentence you could adapt: I list what is blocking others first, then what has a fixed date, then what moves a metric.
Behavioural chapter →What you want from the next role and the team
Answer honestly and tie it to what the role offers. Say what you want to learn or own next, such as larger systems, more ownership of design, or mentoring, and what kind of team helps you do it. Then ask what the team is trying to achieve this year and how the work is reviewed. The listener checks that your wishes match the job and that you have thought about it.
Prepare with: Book · Resume grillingBook · Behavioural
2 sources for this round
- 6
General conversation on motivation, integrity and relocation, per one unsourced guide. No candidate account of it was read.
- motivation
- culture fit
- relocation
What can be asked in a hr and offer round
The closing conversation: motivation, expectations, notice period, compensation and how the offer is structured. Prepared answers and a clear number help here.
Current and expected compensation, and how to answer without boxing yourself in
Be honest and avoid giving a single number too early. Share your current pay only if you are comfortable, and make clear what is fixed and what is variable. For expectations, say you are flexible for the right role, and offer a researched range based on level and market. If pushed, state a figure you can justify. Never state a number you cannot support, because offers are often checked.
HR and the number chapter →Notice period, joining date and relocation
Give the facts exactly as they are in your contract. State the notice period, whether early release or a buy-out is truly possible, and the earliest honest joining date. Do not promise a date your employer has not agreed to. For relocation, say whether you can move, how soon, and whether you would need support. Clear, early information helps the recruiter plan and shows you are reliable.
HR and the number chapter →Why you are leaving and what you are looking for
Keep it positive and forward looking. Talk about what you want more of, such as larger scale, ownership or a stronger team, rather than criticising your current employer. The listener checks that you will not leave this job for the same reason. Opening line: I have learned a lot in the current role, and I now want to work on problems at a bigger scale.
Levels, equity and how the offer is built
Ask for the structure rather than only the total. Find out the level and title, base salary, bonus and whether it is guaranteed, equity amount, vesting schedule and cliff, joining bonus and any clawback. Compare offers on a yearly total with the same assumptions. If equity is in a private company, ask how it is valued and what happens on leaving. Asking calmly is normal and expected.
Levels and equity chapter →
Prepare with: Book · HR & the numberBook · Levels & equity
1 source for this round
Preparing for the people rounds at CRED
The hiring manager, behavioural and offer conversations. Candidate reports shape the themes; the answers and frames are written for this site, so use them as a structure and bring your own stories.
What CRED says it values
- Explaining your decisionsA guide quotes a CRED engineering leader on being ready to explain a decision and the reason behind it.
- OwnershipReported behavioural and managerial rounds cover ownership of what you have built.
- Teamwork and communicationA guide describes questions on teamwork and communication with an engineering lead.
- Career directionReported conversations include where you want your career to go.
Themes candidates report being probed
- Project deep dive
- Ownership and teamwork
- Behavioural questions
- Career direction
- Explaining the reason behind a decision
- A light design problem with schema and failure handling
Questions to rehearse
Walk me through a project you worked on, including the design decisions and your part in the team.One report
What is being checked. A write-up of a July 2024 SDE-2 account describes a 60 minute hiring manager round with a lighter design problem, a project deep dive with adversarial questions on trade-offs and behavioural questions on leadership and conflict. The listener is checking that the project is genuinely yours.
How to frame it. Give the goal, your contribution, two design decisions with the alternative you rejected and the result. Example opening: 'The aim was to cut settlement delays, I owned the ingestion service and the main decision was to make it idempotent.'
Worked example in the Interview book →Candidate write-up · 2024 ↗
For the design you just described, what does the schema look like and what happens when a step fails?One report
What is being checked. A guide says some reports include technical discussion of schema design and failure handling in this conversation. The listener is checking whether you think about partial failure and data consistency rather than only the happy path.
How to frame it. State the key entities, the status transitions and what is retried or reconciled when something breaks. Example opening: 'Each attempt gets its own record with a status, so a failure leaves a trail that a retry job can safely pick up.'
Candidate write-up · 2024 ↗
Pick a decision you made and explain why you made it, including what you knew at the time.Prep guides
What is being checked. A guide quotes a CRED engineering leader advising candidates to be ready to explain a decision and the reason behind it. The listener checks that your reasoning was sound given what you knew, not only that the result was good.
How to frame it. Separate the facts you had, the options, your choice and what you would decide differently now. Example opening: 'With the information we had, I chose the simpler path because it was reversible, and I would still make that choice.'
Prep guide ↗
How do you work with teammates and keep an engineering lead informed about your progress?Prep guides
What is being checked. A guide describes questions on teamwork and communication with an engineering lead. The listener is checking how early you surface risk and whether you communicate clearly.
How to frame it. Describe your actual cadence, such as short written updates, early flags when something slips and how you ask for help. Example opening: 'I send a short note when a plan changes, not at the end of the week, because the lead can still act on it then.'
Worked example in the Interview book →Prep guide ↗
Tell me about something you owned from start to finish, and what you would do differently.Prep guides
What is being checked. A guide lists ownership as part of the managerial round. The listener checks that you stayed responsible after delivery and can reflect honestly.
How to frame it. Cover the problem, your decisions, how you measured success and one improvement you would make now. Example opening: 'I owned the reconciliation job from design to on-call, and the thing I would change is how early I added monitoring.'
Worked example in the Interview book →Prep guide ↗
Where do you want your career to go over the next few years, and why does this role fit?Prep guides
What is being checked. A guide lists career direction as a topic with the engineering lead. The listener is checking that your goals are realistic and that the role helps you reach them.
How to frame it. Tie your direction to skills you are building, such as depth in one domain or leading a small group, and show how this role gives you practice. Example opening: 'I want to be the person who owns reliability for a payment flow, and this role would give me that scope.'
Worked example in the Interview book →Prep guide ↗
The offer conversation
- One July 2024 SDE-2 candidate received an offer, after which compensation negotiations did not work out and they did not join. The page is a write-up of a post by another author that was not itself read, and it gives no figures.
- No account of the HR conversation was found, so treat the rest as general advice: ask for the full breakdown of fixed pay, variable and equity in writing, and ask which level and band the role sits in.
- Check the base-versus-equity trade-off carefully before negotiating, and settle the notice period and any buy-out early.
What we could not verify. No official values page or process page was read, so the entries above are themes from reports and a guide. Only one candidate account is cited, as a secondary write-up of a post by another author that was not read, and the HR round has no candidate account.
What we could not verify. No specific CRED coding (DSA) problems could be verified: LeetCode, Naukri Code360 and Medium returned 403, so several 2021-2025 candidate reports seen in search results are excluded. The single candidate account is a secondary retelling (PapersAdda, 2026) of a Dec 2024 Medium post about a July 2024 SDE-2 loop. No SDE-1 or SDE-3 specifics, no SQL questions.