As a Software Engineer at Kissht, you are at the core of one of India's leading fintech platforms. Kissht specializes in providing instant credit, personal loans, and buy-now-pay-later (BNPL) services to millions of customers. In this role, you will build and scale the robust financial technologies that power real-time credit underwriting, complex payment processing, and high-frequency transactions. The systems you design and maintain must operate with near-zero downtime and absolute data integrity. A single bottleneck in the API gateway or a slow database query can delay credit approval for a customer at checkout, directly impacting the business's bottom line. Consequently, engineers here work on complex microservices architectures, distributed databases, and sophisticated risk assessment engines. This position is ideal for engineers who thrive in fast-paced, high-scale environments. You will not only write code but also make critical architectural decisions regarding database selection, caching strategies, and system integration. Working at Kissht offers a unique opportunity to solve tangible financial challenges, making credit accessible and seamless for a massive user base.
Resume Screening
reportedInitial review of your resume to assess qualifications and fit for the role.
What to demonstrate
- Initial review of your resume to assess qualifications and fit for the role
- Depth in Data Structures and Algorithms (DSA)
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Technical Screening
reportedAssessment combining data structures, algorithms, and questions about your past experience.
What to demonstrate
- Assessment combining data structures, algorithms, and questions about your past experience
- Depth in Data Structures and Algorithms (DSA)
How to prepare
- Answer aloud and timed: Detect if a cycle exists in a directed graph.
- Answer aloud and timed: Implement a basic rate limiter using a sliding window or token bucket algorithm.
System Design Interview
reportedIn-depth discussion focused on system design and architectural potential.
What to demonstrate
- In-depth discussion focused on system design and architectural potential
- Depth in Data Structures and Algorithms (DSA)
How to prepare
- Answer aloud and timed: Find the lowest common ancestor (LCA) of two nodes in a binary tree.
- Answer aloud and timed: Design a scalable buy-now-pay-later (BNPL) transaction processing system.
Behavioral Interview
reportedEvaluation of cultural fit and behavioral scenarios to assess alignment with company values.
What to demonstrate
- Evaluation of cultural fit and behavioral scenarios to assess alignment with company values
- Depth in Data Structures and Algorithms (DSA)
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 interview above and write down what you would ask to confirm before it.
PracHub editorial advice for the preparation topics above.
Be Ready to Justify Your Tech Stack
Do not just say you used a technology because it was already in place. Explain the pros, cons, and trade-offs of the technologies you have worked with in your previous roles.
Brush Up on Database Internals
Expect deep dives into database transactions, indexing, and locking mechanisms. Since Kissht handles financial transactions, database integrity is a major focus area for interviewers.
Practice Live Coding
Ensure you can write clean, readable code without relying heavily on IDE auto-complete. Explain your thought process out loud as you write your solution.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Implement a function to find the middle element of a singly linked list in a single pass.
Implement a function to find the middle element of a singly linked list in a single pass.
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?
Given an array of integers, find the contiguous subarray which has the largest sum (Kadane's Algorithm).
Given an array of integers, find the contiguous subarray which has the largest sum (Kadane's Algorithm).
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?
Detect if a cycle exists in a directed graph.
Detect if a cycle exists in a directed graph.
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?
Find the lowest common ancestor (LCA) of two nodes in a binary tree.
Find the lowest common ancestor (LCA) of two nodes in a binary tree.
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?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Implement a basic rate limiter using a sliding window or token bucket algorithm.
Implement a basic rate limiter using a sliding window or token bucket algorithm.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Design a scalable buy-now-pay-later (BNPL) transaction processing system.
Design a scalable buy-now-pay-later (BNPL) transaction processing system.
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 would you design a distributed ledger or payment gateway integration that guarantees exactly-once processi
How would you design a distributed ledger or payment gateway integration that guarantees exactly-once processing?
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?
Explain how you would handle database scaling and replication for a system experiencing sudden traffic spikes.
Explain how you would handle database scaling and replication for a system experiencing sudden traffic spikes.
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?
Design a notification system that can reliably send SMS and push notifications to millions of users with prior
Design a notification system that can reliably send SMS and push notifications to millions of users with priority queuing.
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?
Explain the difference between optimistic and pessimistic locking, and when you would use each in a financial
Explain the difference between optimistic and pessimistic locking, and when you would use each in a financial transaction system.
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 are database indexes, how do they work internally (B-Trees vs. Hash indexes), and what are the trade-offs
What are database indexes, how do they work internally (B-Trees vs. Hash indexes), and what are the trade-offs of over-indexing?
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?
Describe how database transactions maintain consistency in a distributed microservices environment (e.g., Saga
Describe how database transactions maintain consistency in a distributed microservices environment (e.g., Saga pattern vs. Two-Phase Commit).
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?
Why did you choose your specific tech stack (e.g., Node.js, Java, or Python) for your last project? What were
Why did you choose your specific tech stack (e.g., Node.js, Java, or Python) for your last project? What were the limitations?
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?
Walk me through the most challenging bug you solved in production. How did you diagnose and mitigate it?
Walk me through the most challenging bug you solved in production. How did you diagnose and mitigate it?
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?
How did you handle database migrations in your previous role without causing system downtime?
How did you handle database migrations in your previous role without causing system downtime?
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?
Explain the concept of multithreading and how you would prevent deadlocks in an application.
Explain the concept of multithreading and how you would prevent deadlocks in an application.
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- Separate the trigger from the cause; the deploy is rarely the bug.
Follow-up
- What would you look at first, and what would it rule out?
- How would you tell a cause from a coincidence here?
Built from the rounds and topics Kissht candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Kissht loop
- Write out the reported sequence: Resume Screening, Technical Screening, System Design Interview, Behavioral Interview.
- 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 Data Structures and Algorithms (DSA)
- Spend the session on Data Structures and Algorithms (DSA), which Kissht candidates report being tested on.
- Write one worked example in Data Structures and Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures and Algorithms (DSA).
03Work System Design
- Spend the session on System Design, which Kissht candidates report being tested on.
- Write one worked example in System Design and time yourself on it.
Deliverable: One timed worked example in System Design.
04Work Coding Interviews
- Spend the session on Coding Interviews, which Kissht candidates report being tested on.
- Write one worked example in Coding Interviews and time yourself on it.
Deliverable: One timed worked example in Coding Interviews.
05Answer out loud: Data Structures & Algorithms
- Answer aloud, timed: Implement a function to find the middle element of a singly linked list in a single pass.
- Answer aloud, timed: Given an array of integers, find the contiguous subarray which has the largest sum (Kadane's Algorithm).
Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.
06Answer out loud: System Design & Architecture
- Answer aloud, timed: Design a scalable buy-now-pay-later (BNPL) transaction processing system.
- Answer aloud, timed: How would you design a distributed ledger or payment gateway integration that guarantees exactly-once processing?
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
07Answer out loud: Core CS Foundations (DBMS & OS)
- Answer aloud, timed: Explain the difference between optimistic and pessimistic locking, and when you would use each in a financial transaction system.
- Answer aloud, timed: What are database indexes, how do they work internally (B-Trees vs. Hash indexes), and what are the trade-offs of over-indexing?
Deliverable: Spoken answers to 2 reported Core CS Foundations (DBMS & OS) question(s), under time.
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.
Unblock an engineer without taking the keyboard
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
Approach
- Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
- Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
- Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
- Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.
Follow-up
- How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
- Their handler calls an external endpoint before recording that it did. What do you tell them to change first?
Reverse your own decision and price the reversal
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
Approach
- State the original rationale without irony, in the version you would still defend given what was known then. If it is not defensible, the story is about carelessness rather than judgement, and a different example serves you better.
- Give the measurement that moved with a before and after: the p99 that did not improve, the cache hit rate that sat at 40%, the plan that flipped to a sequential scan once the table passed a size you can name.
- Cost the reversal in steps, not adjectives: expand-and-contract deploys, the dual-write window, the callers who had to be notified, the rows already written in the wrong shape that had to be backfilled or abandoned.
- Distinguish reversal from rewrite by naming what you kept. Most good reversals preserve the schema or the interface and undo one decision inside it, which is also why they were affordable.
Follow-up
- What in that decision was irreversible, and did you know it was irreversible when you made it?
- How did you tell the people who had already built on top of the original decision?
Turn a code review disagreement into a decision
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
Approach
- Sort the disagreement before writing anything. A silently discarded write is a correctness claim about data; the choice between 409 and 412 is taste. Only the first justifies blocking a merge, and saying which one you are doing is most of the value of the comment.
- Make the claim reproducible in the comment itself with an interleaving rather than a principle: A reads version 7, B reads version 7, B commits version 8, A's predicate matches zero rows, A is told it succeeded and A's edit is gone.
- Offer the alternative with its cost attached: return 409 carrying the current version and the revision that won, so the client can re-read and re-apply. Note that automatic retry is not the fix, because a retry re-reads the winner's state and reapplies an intent formed against data that no longer exists.
- Apply an escalation rule you can state: two round trips on the thread, then a call, and the service's owner decides rather than the reviewer. A reviewer who cannot be overruled is a bottleneck with extra steps.
Follow-up
- Where would you put the test that fails if someone reintroduces the swallowed zero rowcount?
- The author says clients cannot handle a 409. How do you check whether that is true?
- 01
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
- 02
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
- 03
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
How difficult are the technical interviews at Kissht?
The technical interviews are of average to medium difficulty. If you have a solid grasp of medium-level Data Structures and Algorithms (DSA) and understand basic system design principles, you can successfully navigate the process.
Kissht Software Engineer candidate reports ↗Do I need to code in a specific programming language during the interview?
No, you can generally use any programming language you are comfortable with. However, you will be asked to implement your solutions and explain your language-specific choices, so choose the language you know best.
Kissht Software Engineer candidate reports ↗What is the company culture like for engineers?
The engineering culture is fast-paced and highly execution-oriented. Engineers are given a high degree of ownership over their projects, but they are also expected to deliver reliable, high-performing code quickly to support business growth.
Kissht Software Engineer candidate reports ↗How long does the entire hiring process typically take?
The process from the initial resume screening to the final offer stage usually takes between two to four weeks, depending on candidate availability and scheduling timelines.
Kissht Software Engineer candidate reports ↗What topics does Kissht test in interviews?
Kissht interviews most often cover Data Structures and Algorithms (DSA), System Design, Coding Interviews, Problem Solving, and DBMS Concepts. The exact emphasis depends on the specific role you apply for.
Kissht 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.
- 01Kissht 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.
World Wide Technology Software Engineer Interview Guide
What World Wide Technology asks Software Engineer candidates, from reported rounds and questions.
W.W. Grainger Software Engineer Interview Guide
What W.W. Grainger asks Software Engineer candidates, from reported rounds and questions.
Vodafone Software Engineer Interview Guide
What Vodafone asks Software Engineer candidates, from reported rounds and questions.
Vertica Software Engineer Interview Guide
What Vertica asks Software Engineer candidates, from reported rounds and questions.