As a Software Engineer at Kotak 811, you are at the forefront of India’s digital banking revolution. You will be responsible for building, scaling, and maintaining the infrastructure that powers a high-growth, customer-centric mobile banking platform. Your work directly impacts the financial accessibility of millions of users, requiring a balance between high-performance engineering and the rigorous security standards expected of a leading financial institution. This role is critical because Kotak 811 operates at a massive scale, processing complex transactions while maintaining seamless user experiences. You will collaborate with cross-functional teams to solve challenging problems related to high-concurrency systems, API integrations, and data-driven feature development. For an engineer, this is an opportunity to influence the architecture of a product that is central to the daily lives of its users, offering both technical depth and significant business impact. ##### Tip You will be expected to demonstrate a deep understanding of how your code impacts system stability and user security in a highly regulated banking environment.
Technical Screening
reportedInitial assessments to evaluate technical knowledge and skills.
What to demonstrate
- Initial assessments to evaluate technical knowledge and skills
- Depth in Offer Evaluation
How to prepare
- Answer aloud and timed: Explain the difference between synchronous and asynchronous processing in high-concurrency systems.
- Answer aloud and timed: How do you ensure data consistency in a distributed microservices architecture?
Architectural Discussion
reportedIn-depth discussions focusing on system architecture and design.
What to demonstrate
- In-depth discussions focusing on system architecture and design
- Depth in Offer Evaluation
How to prepare
- Answer aloud and timed: Describe your experience with API security and handling sensitive user data.
- Answer aloud and timed: How do you approach database optimization for high-read/high-write banking applications?
Behavioral Discussion
reportedConversations to assess cultural fit and behavioral competencies.
What to demonstrate
- Conversations to assess cultural fit and behavioral competencies
- Depth in Offer Evaluation
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the behavioral discussion above and write down what you would ask to confirm before it.
Final Evaluation
reportedComprehensive review of candidate performance across all stages.
What to demonstrate
- Comprehensive review of candidate performance across all stages
- Depth in Offer Evaluation
How to prepare
- Answer aloud and timed: Given a set of requirements, design a rate-limiting algorithm for an API.
- Answer aloud and timed: Optimize a specific algorithm to reduce time and space complexity.
PracHub editorial advice for the preparation topics above.
Prioritize clarity
When solving a coding problem, explain your approach before writing a single line of code.
Focus on edge cases
In banking software, edge cases are critical; always mention how you would handle errors, invalid inputs, or system failures.
Understand the business
Research Kotak 811 and its product offerings to show you understand who the end-user is and what they need.
Be ready for trade-offs
Whenever you propose a solution, be prepared to explain why it is better than the alternatives and what the potential downsides might be.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Explain the difference between synchronous and asynchronous processing in high-concurrency systems.
Explain the difference between synchronous and asynchronous processing in high-concurrency systems.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Implement a solution for handling concurrent transaction requests.
Implement a solution for handling concurrent transaction requests.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Optimize a specific algorithm to reduce time and space complexity.
Optimize a specific algorithm to reduce time and space complexity.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
How would you handle a scenario where a third-party payment gateway experiences latency?
How would you handle a scenario where a third-party payment gateway experiences latency?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Write a function to validate complex user input data according to specific security constraints.
Write a function to validate complex user input data according to specific security constraints.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
Explain why the owner filter ignores the listing index
The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.
Approach
- Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
- For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
- Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
- Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.
Follow-up
- 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
- A dashboard runs this for 40 owners in one page load. What changes about the design?
How do you ensure data consistency in a distributed microservices architecture?
How do you ensure data consistency in a distributed microservices architecture?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you approach database optimization for high-read/high-write banking applications?
How do you approach database optimization for high-read/high-write banking applications?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
What strategies do you use for error handling and logging in a production-grade environment?
What strategies do you use for error handling and logging in a production-grade environment?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Given a set of requirements, design a rate-limiting algorithm for an API.
Given a set of requirements, design a rate-limiting algorithm for an API.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Every query on one table stalls for forty seconds mid-deploy
During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.
Approach
- Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
- Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
- Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
- Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.
Follow-up
- The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
- Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?
Built from the rounds and topics Kotak 811 candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Kotak 811 loop
- Write out the reported sequence: Technical Screening, Architectural Discussion, Behavioral Discussion, Final Evaluation.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.
02Work Offer Evaluation
- Spend the session on Offer Evaluation, which Kotak 811 candidates report being tested on.
- Write one worked example in Offer Evaluation and time yourself on it.
Deliverable: One timed worked example in Offer Evaluation.
03Work Offer Negotiation
- Spend the session on Offer Negotiation, which Kotak 811 candidates report being tested on.
- Write one worked example in Offer Negotiation and time yourself on it.
Deliverable: One timed worked example in Offer Negotiation.
04Work Software Engineering Role Alignment (SDE-2)
- Spend the session on Software Engineering Role Alignment (SDE-2), which Kotak 811 candidates report being tested on.
- Write one worked example in Software Engineering Role Alignment (SDE-2) and time yourself on it.
Deliverable: One timed worked example in Software Engineering Role Alignment (SDE-2).
05Answer out loud: Technical & Domain Expertise
- Answer aloud, timed: Explain the difference between synchronous and asynchronous processing in high-concurrency systems.
- Answer aloud, timed: How do you ensure data consistency in a distributed microservices architecture?
Deliverable: Spoken answers to 2 reported Technical & Domain Expertise question(s), under time.
06Answer out loud: Coding & Problem Solving
- Answer aloud, timed: Implement a solution for handling concurrent transaction requests.
- Answer aloud, timed: Given a set of requirements, design a rate-limiting algorithm for an API.
Deliverable: Spoken answers to 2 reported Coding & Problem Solving question(s), under time.
07Dry run for Kotak 811
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe your experience with API security and handling sensitive user data.
Describe your experience with API security and handling sensitive user data.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Narrate an outage you owned from page to postmortem
Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.
Approach
- Open on the signal rather than the cause: which metric at which percentile moved, on which service, at what time, so the listener follows the same evidence you had rather than a conclusion you already reached.
- Separate mitigation from diagnosis out loud. State what you did to stop the bleeding (flag off, shed traffic, drain a lease, roll back a deploy) and say plainly that you did it before the mechanism was known, because those are two jobs with different deadlines.
- Establish blast radius in countable terms: how many tenants, how many writes, and crucially whether the effect was loss or only delay. An append-only revision table or a pending outbox row means the change survived and the projection was merely behind, which is a repair rather than a data-loss incident.
- Prove the mechanism instead of asserting it. Name the trace span that grew, the plan that flipped to a sequential scan, the lease that expired, plus one alternative you ruled out and the signal that stayed flat while you ruled it out.
Follow-up
- What would you do differently in the first five minutes, given the same dashboard and no more information?
- Which follow-up action did you deliberately not take, and why was dropping it the right call?
Argue against a design, lose, and commit anyway
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
Approach
- State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
- Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
- Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
- Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.
Follow-up
- What threshold on that alert would have proved you right, and did anyone ever look at it?
- If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?
- 01
Describe your experience with API security and handling sensitive user data.
- 02
Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.
- 03
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
How long should I prepare for the interview?
Most successful candidates dedicate 3 to 6 weeks of focused preparation, depending on their current familiarity with system design and algorithm patterns.
Kotak 811 Software Engineer candidate reports ↗What is the most important trait for success in the interview?
Beyond technical skill, interviewers value candidates who can communicate their thought process clearly and demonstrate a logical, structured approach to problem-solving.
Kotak 811 Software Engineer candidate reports ↗How is the culture at Kotak 811?
The culture is professional and fast-paced, with a strong emphasis on delivering high-quality, reliable solutions for users.
Kotak 811 Software Engineer candidate reports ↗What is the timeline from the first screen to an offer?
While timelines can vary, the process is generally efficient, often moving from screen to final offer within a few weeks for successful candidates.
Kotak 811 Software Engineer candidate reports ↗What topics does Kotak 811 test in interviews?
Kotak 811 interviews most often cover Offer Evaluation, Offer Negotiation, Software Engineering Role Alignment (SDE-2), Technical Interview Process, and Career Leveling (SDE-2). The exact emphasis depends on the specific role you apply for.
Kotak 811 Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Kotak 811 Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.
Scale Ai Software Engineer Interview Guide
Data structures and algorithms practice for Scale Ai candidates, where stating a bound means stating its precondition: constant-time hash lookup is an average case over keys that spread.
Ramp Software Engineer Interview Guide
Systems practice for Ramp software engineer candidates, weighted toward payments and lending work: the load that actually arrives, the failure modes that matter there, and the invariants a partial outage must not break.