Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

Cashfree Software Engineer Interview Questions & Rounds

32 min read

How the Cashfree software engineer interview works: campus OA, DSA, CS fundamentals, design and managerial rounds, from real candidate experiences.

In this article
On this page

[Draft] How to Crack Cashfree: The Software Engineer Interview, From Real Experiences

Last updated November 20, 2026 · 27 min read · For SDE interns, new grads (SDE 1, Product Engineer 1 and 6-month intern plus full time), SDE 2 and SDE 3

Built by the Codinzhub team. This guide is built from Cashfree software engineer interview experiences that candidates shared, including posts and OA questions on Codinzhub. The process changes by year, campus and level, so treat this as a map, not a promise.

The 30-second version. For Cashfree software engineers, campus candidates start with an online assessment: 2 to 4 coding questions, often with multiple-choice questions (MCQs), depending on the year. Recent Codinzhub drives list 3 coding questions, two of them with 4 MCQs. Then come 3 to 5 interviews: DSA rounds of about an hour with 2 problems in a shared HackerRank editor, a CS fundamentals and projects round led by database questions, and managerial, director or HR rounds that can eliminate you. Experienced SDE 2 and SDE 3 candidates skip the OA: a recruiter call, a DSA round, low-level design (LLD) or system design, and a managerial round, with code review added for SDE 3. Experienced loops took 5 days to 4 weeks. The habit that matters most: say the brute force and its complexity first, then optimise out loud.

What this guide is, and what it is not

This guide is built from 26 records of Cashfree Payments' software engineer hiring, from 2021 to 2026: 7 candidate experiences and OA questions from 4 campus drives shared on Codinzhub, plus 15 public candidate write-ups. Most come from Indian campus hiring; seven come from experienced SDE 2 and SDE 3 candidates. Many reports are from 2021 and 2022, so the guide notes the year where the process changed.

It is:

  • A map of the process, stage by stage, as candidates described it
  • The question patterns that keep coming back, and the follow-ups to expect
  • A six-week plan and practice problems matched to those patterns

It is not:

  • A list of leaked questions or a promise of what you will be asked
  • An official description of Cashfree's process
  • An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.

Important things to know before you start

These are the Cashfree-specific facts that should change how you prepare.

Coding surface. Most reports that name a surface (5 of 7) describe a shared HackerRank editor; two mention code run against test cases, and one SDE 3 round wanted pseudo-code. Practise two problems in an hour in an online editor, talking as you go.

CS fundamentals get their own round. 13 records describe DBMS, OS, networks and OOP questions, often tied to your project; indexing came up in 6. Treat it as a scored round.

Rounds are eliminating. One 2022 drive went from 15 interviewed to 8, 6, then 4 offers. One intern drive's HR round was eliminating, and one SDE 2 candidate called all three rounds elimination rounds.

Check the year of an OA report. Formats ranged from 4 coding questions in 120 minutes (2021) to 2 coding questions plus MCQs (2022). Recent Codinzhub drives list 3 coding questions, two with 4 MCQs, including one on PL/SQL.

Round-by-round breakdown

Candidates described five stages: application, shortlisting, an online assessment for campus candidates, an interview loop, and the decision.

Stage 1: Application, where candidates applied

17 of the 26 records came through campus drives at Indian engineering colleges, for SDE interns, intern plus pre-placement offer (PPO), 6-month intern plus full time, SDE 1 and Product Engineer 1 roles. Experienced SDE 2 and SDE 3 candidates came through recruiters and job portals.

ChannelWhat candidates said
Campus driveDrives were reported in July and August (2021 and 2022) and September and October (2026). Codinzhub records come from NIT Warangal (September 2026), IIT (BHU) Varanasi (October 2026), and IIT Guwahati, IIIT Allahabad and MNNIT Allahabad (dates not shown).
Recruiter or job portal5 experienced-hire records: a recruiter who found the profile on Naukri, Instahyre, or a job portal followed by an HR call. One 2025 interview came the week after the call.
Applied online, then a recruiting agencyOne SDE 3 candidate.

What helped. One intern revised OS, DBMS and networks daily and researched Cashfree's business model and competitors. No record mentions referrals.

Stage 2: Shortlisting, how candidates moved forward

Campus candidates were filtered by CGPA and then by the online assessment. Experienced candidates went from a recruiter or HR call straight to a DSA round. No record describes a questionnaire or hiring assessment.

  1. CGPA cutoff (campus, 2021 to 2022). Three drives named three different cutoffs: 6.5, 7.5 and 8.0. A 2022 hiring manager asked one candidate why their CGPA was lower than their friends'.
  2. OA score (campus). In one 2021 drive, about 30 of 200 to 220 test-takers were shortlisted, and candidates had to solve 3 of 4 questions. Two 2022 drives moved 15 and about 16 students on.
  3. Recruiter or HR call (experienced). One SDE 3 candidate said the team asked about current pay and expectations first.
  4. Cuts after every round. One 2022 intern plus PPO drive went from 15 interviewed to 8, then 6, then 4 offers. One 2021 drive went from about 30 to about 18, then about 9, then 7 offers.

What candidates advised. Do not fake anything on your resume, prepare a short introduction, and know your projects and internship work thoroughly.

Stage 3: Online assessment

Campus candidates took an online assessment (OA), a timed coding test, before any interview. 16 records describe one. No experienced SDE 2 or SDE 3 candidate reported an OA, and no record describes a phone screen.

Online assessment

How it works. The format changed by year. Three 2021 reports describe 4 coding questions on HackerEarth (120 minutes in one). Three 2022 reports describe 2 coding questions plus multiple-choice questions (MCQs), on HackerRank where named. A post published in 2025 describes 4 coding questions and 3 MCQs in 90 minutes on HackerRank. On Codinzhub, three campus drives list 3 coding questions, two with 4 MCQs: IIT (BHU) Varanasi in October 2026, plus IIT Guwahati and MNNIT Allahabad (dates not shown). No record mentions test-case visibility or an AI-tool policy.

At a glance

  • Length: 60, 90 and 120 minutes, one report each. Not reported for the Codinzhub drives.
  • Questions: 3 coding questions in the three Codinzhub drives that give a pattern, plus 4 MCQs in two. Older reports: 2 to 4 coding questions with 0 to 10 MCQs.
  • What was asked: Arrays, strings, stacks, graphs and simulation; three of the four Codinzhub drives had a problem titled as a knapsack variant. MCQs covered CS fundamentals, SQL and PL/SQL, data structures and puzzles.
  • Most common: Message threading, at IIT (BHU) Varanasi and MNNIT Allahabad. No other problem title repeated.
QuestionWhat it testsLevel
Minimum edge reversals so every node is reachableRe-rooting on a tree with DFSNot reported
Assign tasks to M servers round-robin by arrival and burst timeSimulation with a heap of free serversNot reported
Reduce a string by removing K consecutive identical charactersStack of character and countIntern
Count triplets i<j<k with a[i] > a[j] > a[k]Counting smaller and greater values on each sideIntern
Queries on an array with disappearing and reappearing elements (modified)Array queries; the hard question of the setNew grad

OA questions shared on Codinzhub. These pages show only the title, college and OA date publicly. Where the technique is not visible, the topic is marked Not reported.

QuestionDriveTopic
Message threadingIIT (BHU) Varanasi, 17 October 2026; also MNNIT AllahabadNot reported
Unbounded knapsackIIT (BHU) Varanasi, 17 October 2026Not reported
Partition DP problemIIT (BHU) Varanasi, 17 October 2026Not reported
Modified knapsack: minimum cost to reach a required weightIIT Guwahati, date not shownNot reported
Minimum cost string partitionIIT Guwahati, date not shown; the same OA opened with a level-order traversalNot reported
Last object to leave a one-dimensional systemIIIT Allahabad, date not shownNot reported
Transform array A to three target elementsIIIT Allahabad, date not shownNot reported
Modified unbounded knapsack with a target weightIIIT Allahabad, date not shownNot reported
Message delivery with duplicate suppressionMNNIT Allahabad, date not shownNot reported
MCQ: output of PL/SQL exception-handling codeMNNIT Allahabad, date not shownSQL

See all Cashfree OA questions in the question bank.

Stage 4: The interview loop

Campus loops had 3 to 5 interviews after the OA: one or two DSA rounds, a CS fundamentals and projects round, and one or two managerial, director or HR rounds. Experienced SDE 2 loops had 2 or 3 rounds: DSA, then low-level design (LLD) or system design, then a managerial round. SDE 3 loops added code review and, depending on the loop, machine coding, LLD and high-level design (HLD). Reports that name a format describe virtual interviews on HackerRank and Google Meet, except one SDE 3 director round held in the office.

What a 60-minute DSA round looks like

TimeWhat candidates describedWhat to do
0–5 minIntroductions; some interviewers opened with your projectsHave a one-minute summary of one project ready
5–10 minThe interviewer pasted the problem into a shared HackerRank editorRead it, ask about constraints and agree on one example
10–40 minBrute force first, then an optimised version, coded and run against test casesSay the brute force and its complexity, then improve it out loud
40–55 minA second problemKeep the same order: idea, complexity, code, test
55–60 minYour questions; some candidates asked for feedbackAsk about the team or the tech stack

Technical interview: DSA coding

At a glance

  • Length: About 1 hour (6 of the 8 reports that give a length). One 2021 round ran 75 minutes, and one SDE 2 round fit 2 problems into 50 minutes.
  • Questions: 2 problems (10 of the 13 reports that give a count). The 2026 NIT Warangal round had 4.
  • What was asked: Strings, hashing, arrays, stacks, heaps and graphs. SDE 2 problems ranged from LeetCode-medium to hard; SDE 3 paired an easier problem with code review.
  • Most common: A code-review task, in all 3 SDE 3 reports. Roman numeral to integer (two SDE 2 reports), lexicographically smallest string after removing duplicates (two 2021 campus reports) and an LRU cache (two 2021 campus reports) each appeared twice.

Most reports that name a surface (5 of 7) say the code was written in a shared HackerRank editor; one SDE 3 round asked for pseudo-code. Both 2026 NIT Warangal candidates described heavy follow-ups on optimisation and complexity. In the SDE 3 code review, candidates commented on unfamiliar code as a reviewer; one 2023 version was a large multi-threaded function with encryption.

QuestionFollow-upLevel
Code review: comment on a given piece of codeCode structure, security, thread-pool managementSDE 3
Roman numeral to integerNot reportedSDE 2
Lexicographically smallest string after removing duplicate charactersHow and why of the approach; custom inputsNew grad
Implement an LRU cache and give its complexityAlgorithm, implementation, time complexityNew grad
Longest increasing path in a matrixOptimisation and complexityNew grad
Common free time for several people from their availability slotsBoundaries, sorting, complexitySDE 2

See the other reported problems in the question bank.

Technical interview: CS fundamentals and projects

At a glance

  • Length: 40 to 90 minutes across 7 reports, with no single typical length.
  • Questions: A chained discussion rather than a fixed list. Two reports list 10 or more questions in one round.
  • What was asked: DBMS first (indexing, keys, SQL vs NoSQL, ACID, normalisation, joins), then OS (processes and threads, paging, synchronisation), networks (OSI, HTTP vs HTTPS, DNS) and OOP, often tied to your own project.
  • Most common: What is indexing, and how do you make data access faster? (6 of the 13 records that describe this round).

One 2022 candidate said the interviewer chained each answer into the next topic, from SQL vs NoSQL to OS. Another had to run their project, explain its code and defend the choice of SQLite. One intern spent most of a 45-minute round designing their own project's database on the spot.

QuestionFollow-upLevel
What is indexing, and how do you make data access faster?Not reportedNew grad
SQL vs NoSQL, and why you chose one in your projectCan you join collections in a NoSQL database?New grad
Primary keys and foreign keysImplement a foreign key across two tablesNew grad
Normalization (1NF, 2NF and beyond)Not reportedIntern / New grad
Design or explain the database schema of your own projectWhy this database? How much load can it handle?Intern / New grad
What happens when you type cashfree.com in a browser? What is DNS?HTTP vs HTTPSNew grad

Low-level design and machine coding (SDE 2 and SDE 3)

At a glance

  • Length: Not reported.
  • Rounds: One LLD or machine-coding round in 3 experienced-hire reports (one SDE 2 and two SDE 3).
  • What was asked: Class design, relationships and flow, then improvements and trade-offs.
  • Most common: No design repeated.

Campus loops in the data had no separate LLD round. The SDE 2 candidate was rejected after this round; the interviewer wanted a more refined approach to search.

Reported designs.

  • Machine coding: Tic-Tac-Toe game logic, then improvements and the reasons behind each choice (SDE 3)
  • LLD with search: classes, relationships and flow diagrams; the system itself was not named in the report (SDE 2)

High-level system design

At a glance

  • Length: Not reported.
  • Rounds: One round in 4 experienced-hire reports, plus one 2026 campus design discussion.
  • What was asked: Standard services: requirements, APIs, database choice, caching, concurrency and scale.
  • Most common: No design repeated.

For SDE 3, HLD was its own round, combined with the managerial round in one 2022 loop. One SDE 2 loop had a system design round with an unreported prompt. The 2026 NIT Warangal loop is the only campus loop with a design discussion; other campus loops had at most one design-type or database schema question.

Reported designs.

  • Design a notification service (SDE 3)
  • Design an airline reservation system (SDE 3, 2023)
  • Design discussion covering API design, database choice, caching, concurrency and scalability (new grad, 2026)

Managerial, director and HR rounds

At a glance

  • Length: 15 to 60 minutes across 5 campus reports. HR rounds ran 15 to 25 minutes, and managerial rounds 30 to 60 minutes.
  • Questions: A project and internship walk-through, then motivation questions.
  • Themes: Projects and technology choices, why Cashfree, career goals, learnings and setbacks, situational questions.
  • Most common: Walk through a project on your resume and justify the technology choices (13 of the 18 records that describe these rounds).

These rounds were run by engineering managers, directors, an engineering VP or HR, and some mixed in technical questions: one VP asked about normalisation, and one director about ACID, joins and an LRU cache. They can eliminate: one 2022 intern drive called its HR round eliminating, and a Product Engineer 1 drive cut 2 candidates at the managerial round. Two candidates described a distracted or sceptical director, while five campus candidates called their interviewers friendly or helpful.

Reported questions.

  • Walk through a project on your resume and justify the technology choices, then go deeper into one technology you are comfortable with
  • Why Cashfree, and what do you expect from it?
  • Where do you see your career going?
  • Challenges, learnings and setbacks from past projects or internships
  • Walk through your past work experience (SDE 2 and SDE 3)
  • Backend or frontend: which interests you and why?
  • Why is your CGPA lower than your friends'?
  • How will you help the company without web-development experience?

See all behavioral questions in the question bank.

Stage 5: Decision and offer

Decision. No record describes a hiring committee or team matching. Campus decisions came at the end of the drive: one 2021 virtual drive took 2 days, and one 2022 intern drive announced results on 6 August, in its first week. Offers were few: 7 from about 200 to 220 OA takers (2021), and 4 of 15 interviewed (2022 intern plus PPO). Experienced loops took 5 days (SDE 2, 2025), 2 weeks (SDE 3, 2022) and 4 weeks (SDE 3, 2023). One SDE 2 rejection came 2 days after the final round.

Offer. One 2021 campus hire discussed the salary breakdown with the head of HR. One SDE 3 candidate in 2022 waited a week after submitting documents, was offered less than their current pay, and declined. Both experienced-hire offers in the data were declined.

The Codinzhub Next-Round Playbook

Candidates who moved forward did a few things in the room that others did not.

To get past shortlisting

  • Check your drive's CGPA cutoff early. Three drives used three different cutoffs (6.5, 7.5 and 8.0).

To get past the OA

  • Aim to fully solve all but the hardest question. One 2021 drive shortlisted only those who solved 3 of 4.
  • Do not skip the MCQs. Several drives mixed coding with MCQs on CS fundamentals, SQL and PL/SQL, data structures and puzzles.

To get past the DSA rounds

  • Say the brute force and its cost first. One candidate coded an O(n²) version, passed 13 of 15 cases, and found the O(n) idea while explaining it.
  • Watch the clock: most rounds had 2 problems in about an hour, and neither SDE 2 candidate who solved only the first reported an offer.

To get past the CS fundamentals and projects round

  • Lead with the database: indexing came up in 6 records, and SQL vs NoSQL and keys in 4 each.
  • Be ready to run your project, explain its code and justify its database.

To get past the design rounds

  • In LLD, confirm what the interviewer wants to see before you build out classes. One SDE 2 candidate was rejected for a design the interviewer saw differently.
  • In SDE 3 code review, comment on structure, security and thread-pool use, not just naming.

To get past the managerial, director and HR rounds

  • Treat them as scored. One intern drive called its HR round eliminating, and one Product Engineer 1 drive cut 2 candidates at the managerial round.
  • Ground "why Cashfree" in its business. One intern without web-development experience answered with research on the business model and competitors, and was selected.

To get through the decision

  • Ask the recruiter for a timeline: experienced loops took 5 days to 4 weeks.

How the loop differs by level

Campus candidates face an OA and a CS fundamentals round. Experienced candidates skip the OA and get design rounds instead.

LevelWhat candidates describe
SDE intern and intern plus PPO (campus)5 records. OA, one DSA round, CS fundamentals and projects, a projects or managerial round, then HR: 5 rounds in 4 of the 5. Examples: Kth largest element in a stream, number of towers visible from each tower.
New grad: SDE 1, Product Engineer 1, 6-month intern plus full time (campus)9 records. OA, one or two DSA rounds, CS fundamentals, then a managerial or director round, with HR in some drives. The 2026 NIT Warangal loop had 4 DSA problems in one round (including cheapest flights within K stops) plus a design discussion.
SDE 2 (3+ years in one report)4 records, all through recruiters or job portals. A DSA round with 2 problems in 3 of the 4, then LLD or system design, then a managerial round. Examples: Roman numeral to integer, common free time for several people. None reports an offer.
SDE 3 (7 years in one report)3 records. Coding plus code review, machine coding or a second problem-solving round, LLD and/or HLD, then a hiring manager or director. Examples: Tic-Tac-Toe machine coding, airline reservation system. Two received offers and declined.

Most-asked topics

Across the 26 records, questions clustered in a few topics. Design and database questions show up as often as any algorithm topic.

TopicWhat it meansSeen inReported examples
Design and code reviewClasses, schemas, services, code review12 of 26 reportsLRU cache; code review of a multi-threaded function; notification service
Strings and hashingMaps, sets and windows over characters9 of 26 reportsRoman numeral to integer; lexicographically smallest string after removing duplicates
Database fundamentalsIndexing, keys, ACID, normal forms9 of 26 reportsWhat is indexing?; primary and foreign keys; transactions and ACID
Arrays, greedy and countingSorting and counting tricks8 of 26 reportsMaximum chunks to make an array sorted; count decreasing triplets
Stacks and monotonic stacksA stack kept in sorted order for next greater or smaller7 of 26 reportsNumber of towers visible from each tower; reduce a string by removing K repeats
OS and networksProcesses, memory, OSI, HTTP, DNS6 of 26 reportsProcess vs thread; paging and segmentation; what happens when you type a URL
Graphs and shortest pathsBFS, DFS and Dijkstra4 of 26 reportsCheapest flights within K stops; minimum edge reversals so every node is reachable

The question patterns that keep coming back

Most Cashfree questions fall into a handful of patterns. Learn to see the pattern under the story.

1. Design and code review

This pattern appears in 12 records, more than any other. Campus candidates designed their own project's database or implemented an LRU cache; all 3 SDE 3 candidates got a code-review task plus LLD or HLD. For "implement X with fast operations", choose the data structures first (a hash map plus a doubly linked list for an LRU cache). For "design a service", go from requirements and APIs to the data model, then caching and concurrency. For "review this code", cover structure, security and thread safety before style.

Reported examples. Code review of a multi-threaded function with encryption; implement an LRU cache; Tic-Tac-Toe machine coding; design a notification service.

2. Strings and hashing

This pattern appears in 9 records, for interns, new grads and SDE 2. Use a hash map for counts or last positions, a sliding window for the longest or shortest substring with a property, and a stack when the answer depends on the most recent character kept.

Reported examples. Roman numeral to integer (two SDE 2 reports); lexicographically smallest string after removing duplicate characters (two 2021 campus reports); longest substring without repeating characters.

3. Database fundamentals

This pattern appears in 9 records, all from campus hiring. Questions were chained and often started from your project's database; indexing was the most repeated (6 records). Know when an index helps and what it costs on writes, and explain SQL vs NoSQL, keys, ACID and normal forms with your own project.

Reported examples. What is indexing, and how do you make data access faster?; SQL vs NoSQL, and why you chose one; optimise queries on a table with 100 million rows.

4. Arrays, greedy and counting

These questions appear in 8 records, mostly campus, and hide a sort or counting trick behind a story. To minimise or maximise a total by rearranging, try sorting by frequency or value. For the best result after k operations, check whether acting on the current largest or smallest element each time is safe.

Reported examples. Maximum distinct elements in A after at most k swaps with B; permutation that minimises the sum of prefix distinct counts.

5. Stacks and monotonic stacks

Stacks appear in 7 records. "Visible", "next greater", "remove adjacent" or "smallest lexicographic result" each point to a stack you pop while the new element breaks the order you keep.

Reported examples. Number of towers visible from each tower; reduce a string by removing K consecutive identical characters; maximum chunks to make an array sorted.

6. Heaps, intervals and simulation

This pattern appears in 5 records. Use a size-K min-heap for "Kth largest so far", and sort-then-sweep for common free time. For objects moving on a line, check whether collisions can be treated as passing through before you simulate.

Reported examples. Kth largest element in a stream; common free time for several people; assign tasks to M servers round-robin.

7. Graphs, shortest paths and DP (less common, but in the 2026 data)

Graph problems appear in 4 records and DP problems with a named technique in 3, but the 2026 NIT Warangal round was mainly graphs and DP, and three Codinzhub OA drives had problems titled as knapsack variants. Use BFS for fewest steps, Dijkstra for weighted edges, BFS by levels when stops are limited, and memoised DFS when a cell depends only on its neighbours.

Reported examples. Longest increasing path in a matrix; cheapest flights within K stops; path with minimum effort.

Preparing for the managerial, director and HR rounds

Cashfree has no named values round; its managerial, director and HR rounds play that part, and they can eliminate candidates. Most include a project deep dive.

Build your story bank. Prepare five or six real stories, each under two minutes, and be able to defend every project on your resume. Cover these reported themes:

ThemeReported prompt (paraphrased)Follow-up to expect
ProjectsWalk through a project and justify the technology choicesGo deeper into one technology; run the project and explain the code
MotivationWhy Cashfree, and what do you expect from it?What the company can offer you and what it expects of you
CareerWhere do you see your career going?Not reported
SetbacksChallenges, learnings and setbacks from past projects or internshipsNot reported
Fit for the roleHow will you help the company without web-development experience?Not reported
Experience (SDE 2 and SDE 3)Walk through your past work experienceNot reported

Structure each story. Situation in one line, what you did (say "I"), the result, and what you would change.

Expect depth. VP and director rounds mixed in technical questions such as normalisation, ACID and an LRU cache. Use real experiences only: one candidate warned that made-up HR answers hurt you.

A six-week plan

The plan follows the patterns above, most common first, and ends with timed mocks. Plan on two to three focused hours a day.

  1. Week 1: Strings, hashing and arrays. Hash maps for counts and positions, sliding windows, sorting by frequency, greedy choices after k operations. Habit: write the brute force and its complexity first.
  2. Week 2: Stacks, heaps and intervals. Monotonic stacks, a size-K heap, interval sweeps and simple simulations. Habit: say out loud what order your stack keeps.
  3. Week 3: Database, OS and networks. Indexing, keys, SQL vs NoSQL, ACID, normal forms, joins, processes and threads, paging, OSI, HTTP and DNS. Draw your main project's schema and defend each table. Habit: answer each concept with an example from your project.
  4. Week 4: Design. LRU cache and other "implement this class" problems, one LLD (game logic, a system with search) and one HLD (notification service, reservation system). SDE 3: practise code review for structure, security and thread safety. Habit: ask what the interviewer wants before designing.
  5. Week 5: Graphs and DP. BFS, DFS, Dijkstra, bounded-stop paths, memoised DFS on grids, knapsack and partition DP. Habit: draw the graph or DP table before coding.
  6. Week 6: Mocks. Six timed 60-minute mocks with 2 problems each in an online editor that runs tests, plus two CS-fundamentals mocks that start from your project. Rehearse "why Cashfree" and your project walk-through out loud.

Level adjustments. In the 2026 campus season, swap weeks 4 and 5: the 2026 data leaned on DP and graphs, and only one campus loop had a design round. SDE 2 and SDE 3 candidates can cut week 3 to two days and add LLD and HLD.

Only two weeks? Three days on strings, hashing and arrays, two on stacks and heaps, three on database and OS with your project schema, two on graphs and DP, and four on timed mocks and your project and "why Cashfree" stories.

Practice problems that match these experiences

These are well-known practice problems that match the patterns above. They are not claims about Cashfree's question bank unless a row says the problem was asked as-is.

#Practice problemPatternSeen in these experiences as
1LRU CacheDesign: hash map plus doubly linked listAsked as-is in two 2021 campus reports
2Find Winner on a Tic Tac Toe GameDesign: game-state checksSimilar to the SDE 3 Tic-Tac-Toe machine coding
3Roman to IntegerStrings and hashingAsked as-is in two SDE 2 reports
4Remove Duplicate LettersStrings with a monotonic stackAsked as-is in two 2021 campus reports
5Longest Substring Without Repeating CharactersSliding window with a hash mapAsked as-is in one 2022 intern report
6Max Chunks To Make Sorted IIArrays with a monotonic stackAsked as-is in one 2022 campus report
7Number of Visible People in a QueueMonotonic stackNumber of towers visible from each tower
8Kth Largest Element in a StreamSize-K min-heapAsked as-is in one 2022 intern report
9Interval List IntersectionsSorting and sweeping intervalsCommon free time for several people (SDE 2)
10Cheapest Flights Within K StopsShortest path with a stop limitAsked as-is in the 2026 NIT Warangal round
11Longest Increasing Path in a MatrixMemoised DFS on a gridAsked as-is in the 2026 NIT Warangal round
12Unbounded knapsackKnapsack DPAsked in the October 2026 IIT (BHU) Varanasi OA

The database pattern has no coding analogue; practise it by explaining your own project's schema.

How to handle a question you have never seen

Most Cashfree DSA rounds were two unfamiliar-looking problems in about an hour, so a repeatable method matters more than memorised solutions.

  1. Repeat the problem and one example. In reports that name a surface, the problem sat in a shared HackerRank editor. Read the samples and clarify before you start.
  2. Say the brute force and its complexity. Four campus candidates began naive and then optimised; one found the O(n) idea while explaining the O(n²) one.
  3. Name the bottleneck. Repeated lookups suggest a hash map, repeated ranges suggest prefix sums, repeatedly finding the best item suggests a heap, and "next greater" or "visible" suggests a monotonic stack.
  4. Say when you are stuck. One candidate advised asking for a hint rather than going silent; another said interviewers cared more about the thought process than the final answer.
  5. Code in small pieces while talking. Two candidates describe their code being run against test cases, so get a simple correct version running first.
  6. Dry-run one case and fix the wrong line. Then try edge cases: in one 2021 round, interviewers ran custom inputs after the code passed.

Why candidates were rejected

Six records end in a rejection or no offer, and none gives recruiter feedback. The reasons below are the candidates' own reflections, so treat them as weaker evidence.

  • Solving only one of two DSA problems. Two SDE 2 candidates solved the first problem but not the second; one could only share an approach. Neither reported an offer.
  • A design that did not match what the interviewer wanted. One SDE 2 candidate felt the LLD interviewer wanted a more refined search feature despite justified choices; the rejection came 2 days later.
  • Falling short on follow-ups. One 2026 campus candidate, rejected after 3 rounds, said the interviewers asked many follow-ups on approach and complexity.
  • A poor fit with a senior interviewer. One SDE 3 candidate waited 2 hours for an in-office director round, found the director sceptical, and felt out of contention.
  • Cuts with no reason given. One 2022 new grad cleared the first technical round and was rejected in the second.

Selected vs. rejected: do this, not that

No selected candidate described a perfect interview. What repeated were a few habits, and the rejected reports show what skipping them cost.

Do thisNot thatWhat the reports show
Brute force first: state it with its complexity, then optimise out loudSilent search for the optimal answerFour campus candidates (three selected) described this; one passed 13 of 15 tests with brute force, then found O(n).
Finish both problems: budget time so the second problem gets a real attemptSpending the round on one problemTwo SDE 2 candidates solved only the first of two problems, and neither reported an offer.
Know your project cold: schema, APIs, load and why each toolListing technologies you cannot defend13 records include a project deep dive.
Ask and listen: check what the interviewer wants from a design before going deepDefending your first design to the endOne SDE 2 candidate was rejected after the LLD interviewer expected a different approach to search.
Stay interactive when stuck: ask for a hint and keep talkingGoing quietThree candidates advised staying interactive and asking for hints.

If you remember only five things

  1. The process. Campus candidates take an OA, then 3 to 5 interviews: DSA, CS fundamentals and projects, and managerial, director or HR rounds. Experienced candidates skip the OA and add LLD or system design.
  2. The DSA round. Most rounds had 2 problems in about an hour, in a shared HackerRank editor.
  3. The core habit. State a brute force with its complexity, then optimise out loud, and leave time for the second problem.
  4. The core topics. Strings and hashing, arrays, stacks, database fundamentals and design, with graphs and DP in the 2026 data.
  5. Your project. Most managerial and HR rounds (13 of 18 records) include a deep dive on a project and its technology choices.

FAQ

Is there always an online assessment?

No. Campus candidates took one in 16 records, but no SDE 2 or SDE 3 candidate reported an OA.

Do I need dynamic programming?

Yes for 2026 campus drives, less so before. The 2026 NIT Warangal DSA round was mainly DP and graphs, and three Codinzhub OA drives had problems titled as knapsack variants, but DP problems with a named technique appear in only 3 records overall.

Is system design asked?

It depends on the level. All 3 SDE 3 reports had LLD or HLD, and two SDE 2 loops had LLD or system design. The only campus loop with a design discussion was the 2026 NIT Warangal loop.

How long does it take?

One 2021 campus drive took 2 days. Experienced loops took 5 days, 2 weeks and 4 weeks in the three reports that give a time.

Will the interviewer help me?

Mostly, in the five reports that mention it. Candidates described supportive interviewers and advised asking for a hint, but two described a distracted or sceptical director.

Is it virtual or in the office?

Mostly virtual in the reports that name a format, on HackerRank and Google Meet. One SDE 3 director round was in the office.

About this guide

The Codinzhub team researched and wrote this guide from 26 records of Cashfree software engineer interviews, from 2021 to 2026, including experiences and OA questions shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems, not the exact interview questions unless a row says so. If you interviewed recently, share your experience on Codinzhub and we will update this guide.

Disclaimer. Cashfree's process changes by role, year and campus. Use this guide as a foundation, and confirm the current format with your recruiter or placement cell.

Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 100 questions

  • Message threading

    A Cashfree online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 17 October 2026; also MNNIT Allahabad).

    On CodinzhubIIT (BHU) Varanasi, 17 October 2026; also MNNIT AllahabadNot reportedCodingOnline assessment
  • Unbounded knapsack

    A Cashfree online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 17 October 2026).

    On CodinzhubIIT (BHU) Varanasi, 17 October 2026Not reportedCodingOnline assessment
  • Partition DP problem

    A Cashfree online assessment question shared on Codinzhub (IIT (BHU) Varanasi, 17 October 2026).

    On CodinzhubIIT (BHU) Varanasi, 17 October 2026Not reportedCodingOnline assessment
  • Modified knapsack: minimum cost to reach a required weight

    A Cashfree online assessment question shared on Codinzhub (IIT Guwahati, date not shown).

    On CodinzhubIIT Guwahati, date not shownNot reportedCodingOnline assessment
  • Minimum cost string partition

    A Cashfree online assessment question shared on Codinzhub (IIT Guwahati, date not shown; the same OA opened with a level-order traversal).

    On CodinzhubIIT Guwahati, date not shown; the same OA opened with a level-order traversalNot reportedCodingOnline assessment
  • Last object to leave a one-dimensional system

    A Cashfree online assessment question shared on Codinzhub (IIIT Allahabad, date not shown).

    On CodinzhubIIIT Allahabad, date not shownNot reportedCodingOnline assessment
  • Transform array A to three target elements

    A Cashfree online assessment question shared on Codinzhub (IIIT Allahabad, date not shown).

    On CodinzhubIIIT Allahabad, date not shownNot reportedCodingOnline assessment
  • Modified unbounded knapsack with a target weight

    A Cashfree online assessment question shared on Codinzhub (IIIT Allahabad, date not shown).

    On CodinzhubIIIT Allahabad, date not shownNot reportedCodingOnline assessment
  • Message delivery with duplicate suppression

    A Cashfree online assessment question shared on Codinzhub (MNNIT Allahabad, date not shown).

    On CodinzhubMNNIT Allahabad, date not shownNot reportedCodingOnline assessment
  • MCQ: output of PL/SQL exception-handling code

    A Cashfree online assessment question shared on Codinzhub (MNNIT Allahabad, date not shown).

    On CodinzhubMNNIT Allahabad, date not shownSQLCodingOnline assessment
  • 12

    A Cashfree online assessment question shared on Codinzhub (IIT (BHU).

    On CodinzhubIIT (BHUUnbounded knapsackCodingOnline assessment
  • Minimum edge reversals so every node is reachable

    Level: Not reported.

    Re-rooting on a tree with DFSCodingOnline assessment
  • Assign tasks to M servers round-robin by arrival and burst time

    Level: Not reported.

    Simulation with a heap of free serversCodingOnline assessment
  • Reduce a string by removing K consecutive identical characters

    Level: Intern.

    Stack of character and countCodingOnline assessment
  • Count triplets i<j<k with a[i] > a[j] > a[k]

    Level: Intern.

    Counting smaller and greater values on each sideBehavioralOnline assessment
  • Queries on an array with disappearing and reappearing elements (modified)

    Level: New grad.

    Array queries; the hard question of the setCodingOnline assessment
  • Code review: comment on a given piece of code

    Level: SDE 3.

    Code structure, security, thread-pool managementCodingRound not stated
  • Roman numeral to integer

    Level: SDE 2.

    Not reportedCodingRound not stated
  • Lexicographically smallest string after removing duplicate characters

    Level: New grad.

    How and why of the approach; custom inputsCodingRound not stated
  • Implement an LRU cache and give its complexity

    Level: New grad.

    Algorithm, implementation, time complexityCodingRound not stated
Page 1 of 5

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.