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...

How to Crack Paytm: The Software Engineer (SDE 1) Interview, From Real Experiences

30 min read

Paytm SDE 1 interview guide: reported OA, technical and HR rounds, real coding questions, SQL and Java topics, practice links and an honest coverage check.

In this article
On this page

Last reviewed November 19, 2026 · 30 min read · For candidates targeting SDE 1 / new-grad Software Engineer roles in India

Researched and written by the Codinzhub Editorial Team from nine independent sources: three Codinzhub records, five public candidate accounts and one public assessment catalogue. Every question below is a verbatim report or a faithful paraphrase; nothing was invented to fill a round. Hiring formats change by team and year, so confirm your loop with your recruiter.

The 30-second version: In the reviewed SDE 1 accounts, the path usually starts with an online assessment (OA) of two or three coding questions in 60 to 90 minutes; one 2025 campus assessment added two SQL queries. That is followed by one to three technical rounds of roughly 45 to 60 minutes, then a short HR or VP conversation. The technical rounds are not pure LeetCode: they mix DSA with a project deep dive and CS fundamentals, especially SQL, DBMS, Java internals and operating systems. One 2025 account wrote C++ in the interviewer's IDE over Google Meet. The highest-leverage habit: agree on the approach and state the complexity before you write a line, and know your projects well enough to defend their design.

Important things to know before you start

The OA is a multi-problem speed test. The reviewed accounts report two coding questions in 90 minutes (2021 campus), three in 70 minutes (2021 SDE), three in 60 minutes (2024 Software Engineer), and three coding plus two SQL queries (2025 intern+FTE). The constant is time pressure across independent problems, not one hard puzzle.

SQL and Java are part of the technical bar. SQL schema design, joins, indexes and second-highest-salary queries appeared in three accounts. Java HashMap internals, streams, lambdas, garbage collection, multithreading and the Object class appeared in four, including candidates who did not list Java as their primary language.

Your projects are examined, not just listed. Four accounts spend part of a technical round on projects, technology choices, optimisation or scaling. One 2021 account asked the candidate to open a hosted project and explain how it would scale.

The loop length is not fixed. One off-campus account was rejected in its first technical round. Two campus accounts describe two technical rounds. A 2024 Software Engineer account describes three technical rounds plus HR, and a 2026 account describes a third round with Java, resume questions and Kafka. Prepare for the longer shape, but do not assume every loop has it.

You may code in the interviewer's editor. One 2025 campus account used Google Meet with the interviewer's IDE and screen sharing, writing functional C++ and explaining time and space complexity for every solution. Practise writing code without autocomplete and narrating while you type.

What this guide is, and what it is not

Paytm's SDE 1 loop can look inconsistent: two rounds here, four there, an HR call in one account and a VP conversation in another. The reports still show a repeatable core: a timed assessment, one or two DSA-heavy technical rounds with CS fundamentals, and a final conversation about motivation and fit.

This guide is built from nine independent sources covering Paytm Software Engineer, SDE and SDE 1 hiring in India from 2021 to 2026. Three are Codinzhub records, five are public first-hand candidate accounts, and one is a dated public catalogue of assessment items used only for OA examples. It is not a leaked question bank, an official statement, or a pass-rate estimate. Funnel numbers such as "25 selected, then 10, then 5" describe one campus drive, not the company.

Scope: Software Engineer / SDE 1 / new-grad roles in India. The 2025 SDE Intern + FTE campus track is included because it shares the same assessment and interview structure. Senior Software Engineer and SSE/SDE-2 records were reviewed only to describe level differences and are excluded from the question counts.

Selected vs. rejected: do this, not that

These habits come from selected and rejected accounts. No candidate described a flawless interview; the difference was disciplined habits.

Do this (selected candidates)Not that (rejected candidates)Why it matters
Clarify constraints and state the approach first.Start typing immediately and discover the edge cases while coding.Interviewers asked for approach and complexity explicitly.
Code in the language you can write cleanly by hand, and say why you chose it.List Java on your resume and then stall on HashMap internals or threading.Java was probed in four accounts.
Treat SQL as a first-class skill: schema, keys, joins and indexes.Memorise query syntax only and freeze on "design the tables".Three accounts asked for schema design, not just a query.
Know one project end to end: architecture, your contribution, trade-offs and scaling.Give a feature list and stall on "how would you scale this?".Projects were a proxy for ownership.
Ship a working baseline, then optimise when asked.Chase the optimal trick first, get stuck and lose the round.A baseline proves competence; optimisation proves depth.

Round-by-round breakdown

The order comes from candidate accounts, not a published official sequence. Campus drives compress the loop; off-campus loops can add a recruiter screen and a third technical round.

Stage 1: Application

Most reviewed candidates entered through a campus drive. A smaller number were contacted by a recruiter, and one applied directly.

ChannelWhat candidates reported
On-campus driveThe dominant route. BIT Mesra in September 2021, a 2021 SDE drive, and ABES Ghaziabad in March 2025.
Recruiter outreachOne Noida SDE 1 candidate was contacted by a recruiter; a 2026 Software Engineer spoke with a recruiter before the DSA screen.
Direct applicationOne 2024 Software Engineer account describes an online application but does not name the portal.
Employee referralNot reported in any in-scope SDE 1 account.

What helped: a resume with projects you can defend and a clear primary language. The 2021 campus shortlist explicitly valued hands-on web development, machine learning and DSA, with an eligibility bar of CGPA 7.00 and 70% throughout including classes 10 and 12.

Stage 2: Shortlisting

Shortlisting was driven by resume screening and the assessment. No in-scope SDE 1 account describes a separate live phone screen before the OA.

  • Resume shortlist: campus eligibility and resume screening decide who receives the test. One 2021 account reports a 25-candidate cut after the OA.
  • Recruiter screen: two off-campus accounts describe a conversation about background, projects and the Paytm tech stack before any coding.
  • Assessment cutoff: candidates who solved the problems moved to interviews. One 2021 campus account reports 25 after the OA, 10 after the first technical round and 5 at HR.

These are individual campus reports, not company-wide conversion rates.

Stage 3: Online assessment (OA)

How it works. The OA is a timed test with multiple independent problems. Two accounts say HackerRank; the rest do not name the platform. The 2021 BIT Mesra account reports two questions in 90 minutes, the 2021 SDE account three in 70 minutes, the 2024 Software Engineer account three in 60 minutes, and the 2025 intern+FTE account three coding questions plus two SQL queries. Difficulty clusters around medium, with at least one graph-level or hard problem in the mix. The 2024 account calls it an elimination round.

At a glance: 60 to 90 minutes; 2 to 3 coding questions, with one 2025 assessment adding 2 SQL queries; HackerRank where named. Topics: strings, graph traversal, arrays, linked lists, dynamic programming and SQL.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Merge two sorted linked lists into one list sorted in decreasing order.Linked-list mergingNot reportedRole not stated (undated account)Merge Two Sorted Lists
Return every leader in an array: an element greater than everything to its right.Right-to-left scanNot reportedRole not stated (undated account)Leaders in an array
Count subarrays containing at least one "bad pair", where x is left of y and x % y = k.Prefix countingNot reportedRole not stated (undated account)No verified practice match
Minimum swaps to turn one permutation into another.Cycle decompositionNot reported2026 assessment catalogueNo verified practice match
Customers and products with no recorded sale.SQL anti-joinNot reported2026 assessment catalogueNo verified practice match
Inorder traversal of a nine-node binary tree.Tree traversalNot reported2026 assessment catalogueBinary Tree Inorder Traversal
Top and bottom of the stack before the second multiplication in a postfix scan.Stack simulationNot reported2026 assessment catalogueNo verified practice match

Reading the catalogue rows: four OA rows come from a dated public catalogue of Paytm assessment items. They are included because they are concrete and recent, but they carry no candidate narrative. Treat them as pattern practice, not as certain questions for your test.

Paytm OA questions shared on Codinzhub:

QuestionDriveTopic
Bank Transactions On CampusIIT KharagpurSimulation, arrays
Visiting CitiesIIT (ISM) DhanbadGraph traversal
Bank TransactionsNot statedSimulation, arrays
SQL: Customers and Products Without SalesNot statedSQL joins
Paytm Online Assessment SetBIT MesraCS fundamentals, DSA
Modify the StringNot statedStrings

Full Paytm interview experiences on Codinzhub: SDE 1, DTU (2026), SDE interview experience.

More Codinzhub questions: Browse Paytm questions.

Stage 4: The interview loop

How it works. The first technical round is usually an introduction or resume deep dive, two or three coding questions, and a block of CS fundamentals. The second goes deeper into data structures, Java or DBMS, and sometimes a design discussion. In longer loops, a third round adds harder DSA and a system-design prompt. The final conversation is HR, managerial or with a VP.

Round 1: Technical round 1

How it works. About 60 minutes in the three accounts that give a length. It opens with an introduction or project discussion, then moves to coding. The 2025 campus account used Google Meet, the interviewer's IDE and screen sharing, with functional C++ required. The 2024 account asked for the approach, code and complexity of a next-greater-element problem. The 2021 SDE account spent an hour on two coding questions plus Java and OS theory.

At a glance: about 60 minutes; 2 to 3 coding questions plus theory; Google Meet with the interviewer's IDE in 2025, other platforms not reported. Topics: linked lists, strings, BSTs, arrays, SQL, Java, operating systems and projects.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Reverse a linked list first with recursion, then with pointers and no extra data structure.Linked-list reversalRecursion stack; O(1)-space versionIntern, 2025Reverse Linked List
Find the first non-repeating character in a string.Frequency mapNot reportedIntern, 2025First Unique Character in a String
Find the lowest common ancestor of two nodes in a BST.BST orderingNot reportedIntern, 2025LCA of a BST
For every element, find the next greater element to its right.Monotonic stackExplain time and space complexityNew grad, 2024Next Greater Element I
Delete a node given a random pointer and no head pointer.Pointer rewiringNot reportedNew grad, 2021No verified practice match
Construct a height-balanced BST from a sorted array.Divide and conquerNot reportedNew grad, 2021Convert Sorted Array to BST
Find all anagrams of a pattern in a string.Fixed sliding windowBasic OS questions followedNew grad, 2021Find All Anagrams in a String
Design user and passport tables, with multiple passports per user, then query them.SQL schemaMySQL queries on the schemaSDE 1 (1.5 years)No verified practice match
Return the second-highest salary, handling ties and missing rows.SQL subqueryNot reportedSDE 1 (1.5 years)Second Highest Salary
Count distinct account numbers in a transactions table.SQL aggregationNot reportedSDE 1 (1.5 years)No verified practice match
Rotten Oranges: multi-source BFS on a grid.BFSWrite the code in JavaSDE 1 (1.5 years)Rotting Oranges
Implement binary search over a sorted array.Binary searchWrite the code in JavaSDE 1 (1.5 years)Binary Search
KMP pattern matching, then a version that reports only non-overlapping matches.String matchingNon-overlapping variantRole not statedKMP Algorithm
Diagonal traversal of a binary tree.Tree BFSNot reportedRole not statedDiagonal Traversal
Pairwise swap linked-list nodes by changing links, not data.Pointer rewiringNot reportedNew grad, 2025Swap Nodes in Pairs
Maximum runs a batsman can score in a one-day international with no extras or overthrows.Constrained arithmeticNot reportedNew grad, 2025No verified practice match

The full list, including Java, OOP and OS theory questions, is in the question bank at the end.

Round 2: Technical round 2

How it works. This round is less uniform. Two accounts give 45 to 60 minutes. It combines one or two coding problems with a deeper Java or DBMS discussion. In the 2025 intern account it covered Kadane, an LRU cache, ACID, indexes, keys, BFS versus DFS and polymorphism. In the 2021 SDE account it was 45 minutes of project discussion, scaling and two coding questions. In the experienced SDE 1 account it covered minimum platforms, HashMap internals, comparator sorting and a broad Java and DBMS theory block.

Some loops add a third technical round. The 2024 Software Engineer account adds longest substring without repeating characters, longest increasing subsequence and a Paytm Wallet design discussion; the 2026 account adds a medium-to-hard tree problem, wallet design and a Java/resume/Kafka round. Those questions are listed here rather than in a separate section because only two accounts report the third round.

At a glance: 45 to 60 minutes; 2 to 3 coding questions plus Java, DBMS or design; video call, platform not reported. Topics: DP, trees, linked lists, heaps, Java internals, SQL, OS and low-level design.

Question summarySkill or patternReported follow-upLevel / scopePractice link
A hard-level Tries problem.TrieNot reportedNew grad, 2021Implement Trie
Maximum subarray sum with Kadane's algorithm.Running-sum DPNot reportedIntern, 2025Maximum Subarray
Implement an LRU cache with O(1) get and put.Hash map + linked listNot reportedIntern, 2025LRU Cache
Minimum platforms required so that no train waits.Sorting / sweep lineNot reportedSDE 1 (1.5 years)Minimum Platforms
Explain how HashMap works internally, including Java 8 treeification.Hashing internalsLoad factor; HashMap vs HashtableSDE 1 (1.5 years)No verified practice match
Sort students by marks with a custom comparator.Comparator designNot reportedSDE 1 (1.5 years)No verified practice match
Detect a linked-list cycle with Floyd's algorithm, then with a hash set.Two pointers / hashingCompare O(1) and O(N^2) spaceNew grad, 2024Linked List Cycle II
Explain Java 8 streams, lambdas and garbage collection.Functional Java / memoryNot reportedNew grad, 2024No verified practice match
Check whether a string is a palindrome.Two pointersNot reportedNew grad, 2021Valid Palindrome
Convert a number to words.Recursive groupingNot reportedNew grad, 2021Integer to English Words
Longest substring without repeating characters.Variable sliding windowNot reportedNew grad, 2024 (third round)Longest Substring Without Repeating Characters
Longest increasing subsequence.DP / patience sortingOptimise beyond O(N^2)New grad, 2024 (third round)Longest Increasing Subsequence
Design a scalable Paytm Wallet service, covering storage, caching and load balancing.System designDatabases, caching, load balancingNew grad, 2024 and 2026No verified practice match
Dice throw: count ways to reach a target sum with n dice of m faces.DPNot reportedRole not statedDice Throw
Maximum distinct elements after removing exactly k elements.Greedy + heapNot reportedRole not statedMaximum distinct elements
Tower of Hanoi.RecursionNot reportedRole not statedTower of Hanoi
Normalise a table to third normal form.Functional dependenciesWhy the conversion is neededRole not statedNo verified practice match
OS scheduling, starvation, deadlock and semaphores.Operating systemsNot reportedRole not statedNo verified practice match
Design the five-table database for a shopping-cart project.Schema modellingJustify attributes and data typesRole not statedNo verified practice match

Round 3: HR and managerial

How it works. The final conversation is conversational, not a coding test. The 2024 account describes a relaxed discussion of personality, aspirations, culture fit, strengths, weaknesses and pressure. The experienced SDE 1 account describes a short, friendly VP round on work experience, motivation, challenges, favourite project, team conflict, strengths and location. The 2021 campus account says the candidate asked about tech stack, working culture and feedback. One undated account describes a more personal HR conversation about family background and previous interviews.

At a glance: short, conversational; 6 to 10 questions; no coding.

Question summarySkill or patternReported follow-upLevel / scopePractice link
Tell me about yourself.Self-introductionNot reportedIntern and new gradNo verified practice match
Why do you want to join Paytm?MotivationNot reportedNew grad, 2024No verified practice match
What are your strengths and weaknesses?Self-awarenessNot reportedNew grad and SDE 1No verified practice match
How do you handle work under pressure?ComposureNot reportedNew grad, 2024No verified practice match
Tell me about a team conflict.CollaborationNot reportedSDE 1 (1.5 years)No verified practice match
What challenges have you faced so far?OwnershipNot reportedSDE 1 (1.5 years)No verified practice match
Which project did you like the most, and why?Project ownershipNot reportedSDE 1 (1.5 years)No verified practice match
Do you have any location constraints?LogisticsNot reportedSDE 1 (1.5 years)No verified practice match
Why do you want to switch companies?MotivationNot reportedSDE 1 (1.5 years)No verified practice match
How would you contribute to the team?Role fitNot reportedNew grad, 2024No verified practice match
Do you have any questions for me?CuriosityTech stack, culture, feedbackIntern and new gradNo verified practice match
Tell me about your family background and business exposure.BackgroundBusiness strategiesRole not statedNo verified practice match
How did the previous interviews go, and what mistakes did you make?Self-assessmentProbability of selectionRole not statedNo verified practice match

Stage 5: Decision and offer

How it works. There is no hiring-committee or team-match stage in the reviewed SDE 1 accounts. The decision follows the final conversation or the last technical round.

  • Offers: one 2021 campus drive made four offers, and the candidate was one of the four. One experienced SDE 1 candidate was selected after two technical rounds and a VP round.
  • Rejections: one off-campus candidate received a rejection email within three hours of the technical round. Another 2026 candidate had "overall feedback positive" but no offer.
  • Timing: one 2025 campus assessment declared results after a week and then scheduled the technical interview. No account reports a full application-to-offer duration.

Paytm is a large company with many teams. A payments team, a lending team and a merchant team can run different loops. Treat the campus and off-campus sequences as examples, not a guarantee.

Candidate experiences reviewed

The nine sources span campus and off-campus routes, selected and rejected candidates, and roles titled Software Engineer, SDE, SDE 1 and SDE Intern + FTE. Seven representative entries:

BackgroundRole and reported outcomeWhat was asked
ABES Ghaziabad · 2025SDE Intern + FTE, campus · outcome not reported3 coding + 2 SQL in the assessment; linked list, strings, BST, Kadane, LRU, DBMS theory
Campus · 2021SDE, campus · selected (one of four offers)3 coding in 70 minutes; random-pointer deletion, BST from sorted array, Java/OS, palindrome, number to words
Not stated · 2024Software Engineer · outcome not reported3 problems in 60 minutes; NGE, cycle detection, Java 8, longest substring, LIS, wallet design, HR
BIT Mesra · 2021SDE-1, campus · rejected in round 4String and graph OA; anagrams, OS, hard Tries
Noida · 1.5 yearsSDE 1, Payment Bank · selectedSQL user/passport schema, Rotten Oranges, binary search, minimum platforms, HashMap, Java/DBMS theory, VP round
Noida · recruiterSDE-1 · rejected in round 1Cricket puzzle, pairwise linked-list swap, Java object-orientation, Java 8 HashMap internals
Noida · 2026Software Engineer · no offerDSA screen, medium-hard tree problem, Paytm Wallet design, Java/resume/Kafka

The Codinzhub Next-Round Playbook

To get past the online assessment

  1. Train on three problems in 60 to 90 minutes. Sit one timed set of two medium and one medium-hard problem with no hints. The OA rewards finishing multiple independent tasks.
  2. Do not skip SQL. One 2025 assessment had two SQL queries alongside three coding problems. Practise schema design, joins, GROUP BY, COUNT(DISTINCT) and second-highest-salary patterns.
  3. Practise graph traversal and string windows. The 2021 OA included a graph-level question and a string question; later catalogue items include traversal, stack-state and permutation problems.

To get past technical round 1

  1. Prepare a three-minute project story for every resume bullet: problem, architecture, your contribution, the hardest bug and one change you would make, plus a two-minute scaling answer.
  2. Revise linked lists, strings, BSTs and monotonic stacks. These supplied most of the first-round coding questions: reverse, delete without head, pairwise swap, anagrams, first non-repeating character, LCA in a BST and next greater element.
  3. Revise SQL and Java in interview form: primary and foreign keys, joins, indexes, overloading versus overriding, HashMap internals and multithreading.

To get past technical round 2

  1. Practise DP and design. Kadane, LIS, dice throw, LRU cache and Paytm Wallet design all reward a clear state definition before code.
  2. Be ready to compare approaches. The 2024 account asked for both Floyd's algorithm and a hash set; the 2021 account asked for recursion and pointer reversal. Name the time and space trade-off.
  3. Rehearse a 10-minute wallet design. Cover users, wallets, transactions, idempotency, storage, caching, load balancing and what you would monitor. The 2024 and 2026 accounts both describe a wallet prompt.

To get past the HR and managerial round

  1. Prepare six STAR stories (below) and use "I" for your own contribution.
  2. Prepare two questions about the team and be direct about location constraints. One VP round asked about them explicitly.

How the loop differs by level

LevelTypical experienceWhat the accounts emphasiseSystem design expectation
SDE Intern + FTECurrent student, 2025 campusAssessment with 3 coding + 2 SQL; two 1-hour interviews; C++ in the interviewer's IDE.Not a standalone round; design appears inside coding.
SDE 1 / New Grad0 to 1 yearOA, one to three technical rounds, then HR; DSA plus SQL, Java and OS.A wallet or schema design can appear in a later round.
SDE 1 with experienceAbout 1.5 yearsTwo technical rounds plus a short VP round; deeper resume, Java and DBMS probing.Project scaling and design discussion, not a full architecture round.
SDE 2 / Senior3 to 4 yearsMore system design, monitoring, high-traffic systems and resource calculation.A substantial part of the loop.

Campus drives use a resume shortlist, a shared OA and fast technical rounds with a large pool. Off-campus hiring can start with a recruiter call and may add a third technical round. Do not assume the campus sequence applies to an experienced hire.

Most-asked topics

TopicWhat it means in plain EnglishEvidence-backed priorityReported examplesPractice
Linked listsRewiring nodes by changing pointers rather than values.Very high — 4 of 6 technical accountsReverse, delete without head, pairwise swap, Floyd cycle, merge sorted listsLinked list problems
Strings and sliding windowsScanning a sequence while maintaining a frequency map or window.Very high — 5 of 6 technical accountsAnagrams, first non-repeating character, longest substring, palindrome, KMPSliding window
Trees and BSTsRecursing over parent-child structures and using ordering invariants.High — 4 of 6 technical accountsLCA in BST, BST from sorted array, diagonal traversal, TriesTree problems
Dynamic programmingDefining a state and reusing overlapping subproblems.High — 3 of 6 technical accountsKadane, LIS, dice throw, number to wordsDP problems
SQL and DBMSModelling tables, writing queries and reasoning about indexes and normal forms.Very high — 3 of 6 technical accountsUser/passport schema, second salary, joins, ACID, 3NF, clustered indexesNo direct practice link
Java and OOPLanguage internals and object-oriented design.Very high — 4 of 6 technical accountsHashMap, Java 8 streams, GC, multithreading, overloading, polymorphismNo direct practice link
Operating systemsProcesses, threads, scheduling and synchronisation.Medium — 2 of 6 technical accountsSynchronisation, scheduling, starvation, deadlock, semaphoresNo direct practice link
System design and projectsExplaining how your work scales and how a wallet service is put together.High — 4 of 6 technical accountsPaytm Wallet, caching, load balancing, shopping-cart schemaNo direct practice link

The question patterns that keep coming back

1. Linked-list pointer surgery

  • How to recognise it: a list, one or two pointers, and a constraint such as "without the head", "swap nodes, not data" or "O(1) space".
  • The invariant: draw the nodes and the links before and after the operation. Name the three pointers you will keep. Handle the empty list, one node and the tail.
  • Reported examples: reverse a linked list, delete a node with a random pointer and no head, pairwise swap, Floyd cycle detection, merge two sorted lists into decreasing order.
  • Preparation action: write the reverse function both iteratively and recursively, then trace a three-node list by hand.

2. String scanning with a window or frequency map

  • How to recognise it: "first non-repeating", "all anagrams", "longest substring without repeats" or "pattern matching".
  • The invariant: for a fixed window, keep a 26-slot or hash-map count and update it on entry and exit. For a variable window, move the left edge while the condition is violated.
  • Reported examples: anagrams, first unique character, longest substring without repeating characters, palindrome, KMP and the non-overlapping variant.
  • Preparation action: state whether the window is fixed or variable before writing the loop, then test an empty string and a one-character string.

3. Array scans and prefix aggregation

  • How to recognise it: "count subarrays", "maximum sum", "leaders", "minimum platforms" or "maximum distinct after removals".
  • The invariant: decide whether you need a running sum, a suffix maximum, a sorted sweep or a frequency map. For "at least one bad pair", count the complement.
  • Reported examples: leaders in an array, bad-pair subarrays, Kadane, minimum platforms, maximum distinct elements after k removals.
  • Preparation action: write the brute force, then the O(N^2) or O(N^2) version, and say what changed.

4. Tree and BST invariants

  • How to recognise it: a binary tree, a BST, a traversal order or a prefix structure.
  • The invariant: for a BST, the answer is the first node whose value lies between the two targets. For a balanced BST from a sorted array, the midpoint is the root. For a trie, each node owns a map of children and an end flag.
  • Reported examples: LCA in a BST, BST from sorted array, diagonal traversal, a hard Tries problem, inorder traversal of a nine-node tree.
  • Preparation action: write the recursive contract in one sentence before coding: "this function returns the LCA of p and q in this subtree, or the node if only one is present."

5. Dynamic programming state design

  • How to recognise it: "maximum sum", "number of ways", "longest subsequence" or "minimum cost".
  • The invariant: define the state, transition and base case in words. Kadane keeps the best sum ending here; LIS keeps the best length ending at i; dice throw keeps the count for n dice and a target.
  • Reported examples: Kadane, LIS, dice throw, number to words, maximum distinct elements after removals.
  • Preparation action: write the recurrence before the code and test n = 0, n = 1 and a target that is impossible.

6. SQL schema and query reasoning

  • How to recognise it: "design the tables", "write the query", "which index" or "normalise this".
  • The invariant: identify entities, keys and cardinality first. Then write the query from the join outward. For indexes, ask which column is used in filtering or joining and how selective it is.
  • Reported examples: user/passport one-to-many schema, second-highest salary, distinct accounts, joins, ACID, clustered versus non-clustered indexes, 3NF, shopping-cart schema.
  • Preparation action: practise drawing a schema with keys before writing any SQL, and say the cardinality out loud.

7. Java and OOP internals

  • How to recognise it: the interviewer sees Java on your resume and moves from syntax to "how does it work inside?".
  • The invariant: connect each answer to a data structure or a trade-off. HashMap is an array of buckets with chaining and treeification; GC is reachability; overloading is compile-time, overriding is run-time.
  • Reported examples: HashMap internals and Java 8 changes, streams and lambdas, garbage collection, multithreading, the Object class, overloading versus overriding, polymorphism.
  • Preparation action: prepare a two-minute answer for each item and one project example for each.

Preparing for the HR and managerial round

The final conversation is scored on motivation, self-awareness, ownership and fit. The accounts are consistent about the themes even when the round is called HR, managerial or VP.

Core themes: why Paytm, why this role, what you have built, how you handle pressure and conflict, what you want to learn, and whether you can work from the office.

The six STAR stories to prepare

Use STAR: Situation, Task, Action, Result.

#Story promptFocus area
1A time you disagreed with a teammate's technical proposal.Conflict resolution
2A time you received difficult constructive feedback.Coachability
3A project you owned that failed or missed a deadline.Ownership
4A feature you built with ambiguous requirements.Autonomy
5A time you helped a teammate succeed.Team-first mentality
6A speed-versus-quality trade-off you made.Engineering maturity

Practice problems that match these experiences

Note on practice analogues: These problems share the algorithmic invariants in the candidate accounts. Unless marked "Exact reported problem", they are practice analogues, not leaked exam questions.

#Practice problemPatternSeen in these experiences asLink
1Reverse Linked ListLinked-list reversalReverse a list recursively and with pointersLeetCode #206
2LRU CacheHash map + doubly linked listImplement an LRU cache in a technical roundLeetCode #146
3Rotting OrangesMulti-source BFSRotten Oranges in the first technical roundLeetCode #994
4Maximum SubarrayKadane's algorithmKadane in the second technical roundLeetCode #53
5Longest Substring Without Repeating CharactersVariable sliding windowA third-round coding question in 2024LeetCode #3
6Longest Increasing SubsequenceDP / patience sortingA third-round coding question in 2024LeetCode #300
7Lowest Common Ancestor of a BSTBST orderingLCA in a BST in the 2025 intern roundLeetCode #235
8Convert Sorted Array to BSTDivide and conquerBST construction in the 2021 SDE roundLeetCode #108
9Next Greater Element IMonotonic stackNext greater element in the 2024 roundLeetCode #496
10Second Highest SalarySQL subquerySecond maximum salary in the SDE 1 roundLeetCode #176

How to handle a question you have never seen

  1. Repeat and clarify (0–3 minutes). Rephrase the problem. Ask about empty inputs, negatives, duplicates, sortedness and the maximum input size. If N is up to 10^5, rule out O(N^2) early.
  2. State the brute-force baseline (3–5 minutes). Never sit in silence. Describe the naive solution and its complexity: "Checking every pair would take O(N^2) time and O(1) extra space."
  3. Name the bottleneck (5–8 minutes). Repeated lookups suggest a hash map; repeated min/max extraction suggests a heap; recalculated ranges suggest prefix sums or a sliding window; dependency order suggests topological sort.
  4. Code in clean, modular steps (8–25 minutes). Talk while you type. Use meaningful names, state invariants in comments and write edge-case guards first.
  5. Dry-run line by line (25–30 minutes). Pick a three-element or 2x2 example and trace every variable on screen. If you catch a bug, say so calmly and fix it.
  6. State final complexity proactively (30–32 minutes). Give time and space complexity and name the trade-off: "This uses O(N^2) extra space for the map; sorting would use O(1) space at the cost of O(N^2) time."

Why candidates were rejected

No in-scope account includes formal recruiter rejection feedback, so this section is editorial synthesis plus three candidates' self-reflection. Treat it as preparation advice, not a claim about why any specific person was rejected.

  1. A hard data-structure question exposed a gap. One 2021 campus candidate was rejected in the second technical round after struggling with a hard Tries problem. Advanced tries are worth practising even for new-grad roles.
  2. Java was on the resume but not in the candidate's depth. One off-campus candidate was rejected in the first technical round on a loop that probed Java threading and HashMap internals.
  3. The project was not defensible. Four accounts spend time on projects, architecture and scaling. A shallow project story is a visible weakness.
  4. The loop was longer than expected. One 2024 account has three technical rounds, including wallet design. Candidates who prepare only for two rounds can run out of depth in the third.
  5. Positive feedback is not an offer. One 2026 candidate reports positive overall feedback but no offer. Treat every round as scored.

If you remember only five things

  1. Train for three problems in 60 to 90 minutes, and include SQL in the set.
  2. Practise linked lists, strings, BSTs and DP, because those supplied most of the coding questions.
  3. Revise SQL and Java internals alongside DSA; they appear inside technical rounds, not only in HR.
  4. Prepare your projects like a technical subject: architecture, contribution, trade-offs and scaling.
  5. Rehearse a 10-minute wallet design and six STAR stories for the later rounds.

Frequently asked questions (FAQ)

Is there always an online assessment?

In the reviewed campus accounts, yes: the OA is the first filter. The off-campus accounts also describe a coding screen. The format varies from two to three coding questions, and one 2025 assessment added two SQL queries.

How many rounds does the Paytm SDE 1 process have?

The accounts disagree. One off-campus loop ended after one technical round. Two campus loops had two technical rounds. A 2024 Software Engineer loop had three technical rounds plus HR, and a 2026 loop had a DSA screen, a tree-plus-wallet round and a Java/Kafka round.

Which programming language should I use?

No Paytm-specific restriction appears in the reviewed accounts. One 2025 account wrote C++ in the interviewer's IDE; another wrote Java because the interviewer asked for it. Choose the language you write fastest and explain most clearly, but be ready for Java-specific questions if Java is on your resume.

Is system design asked for SDE 1?

Not as a standalone architecture round in most accounts. It appears as a Paytm Wallet design prompt in a third technical round, a project-scaling discussion, or a schema-design question. Prepare low-level design and a simple wallet design, not a full distributed-systems deep dive.

Will the interviewer give hints if I get stuck?

In several accounts the interviewer intervened with a hint or a direction change, especially on optimisation. The 2025 intern account describes a discussion of optimisation strategies after the first solution. Keep talking so the interviewer has something to redirect.

Are the questions in this guide exact leaks?

No. They are verbatim reports or faithful paraphrases. Practice links are analogues unless marked "Exact reported problem". Use the guide to recognise patterns, not to memorise answers.


About this guide and methodology

This guide was researched, compiled and audited by the Codinzhub Editorial Team. It synthesises nine independent sources: three Codinzhub records, five public candidate write-ups and one dated public catalogue of Paytm assessment items. The sources cover Paytm Software Engineer, SDE, SDE 1 and SDE Intern + FTE hiring in India from 2021 to 2026.

All reported questions are verbatim accounts or faithful paraphrases. Practice mappings connect to LeetCode and GeeksforGeeks and are labelled exact or similar. No external research URLs, internal record identifiers or private source ledgers appear in this article; those are kept in the private research notes.

Disclaimer: Hiring policies, rubrics and interview structures change over time. This guide reflects reported historical experiences and is not an official statement from Paytm. Confirm the current stage format, platform and tooling with your recruiter.


Other company and role guides


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 130 questions

  • Bank Transactions On Campus

    A Paytm online assessment question shared on Codinzhub (IIT Kharagpur).

    On CodinzhubIIT KharagpurSimulation, arraysCodingOnline assessment
  • Visiting Cities

    A Paytm online assessment question shared on Codinzhub (IIT (ISM) Dhanbad).

    On CodinzhubIIT (ISM) DhanbadGraph traversalCodingOnline assessment
  • Bank Transactions

    A Paytm online assessment question shared on Codinzhub (Not stated).

    On CodinzhubNot statedSimulation, arraysCodingOnline assessment
  • SQL: Customers and Products Without Sales

    A Paytm online assessment question shared on Codinzhub (Not stated).

    On CodinzhubNot statedSQL joinsCodingOnline assessment
  • Paytm Online Assessment Set

    A Paytm online assessment question shared on Codinzhub (BIT Mesra).

    On CodinzhubBIT MesraCS fundamentals, DSACodingOnline assessment
  • Modify the String

    A Paytm online assessment question shared on Codinzhub (Not stated).

    On CodinzhubNot statedStringsCodingOnline assessment
  • Merge two sorted linked lists into one list sorted in decreasing order.

    Level: Not reported.

    Linked-list mergingCodingOnline assessment
  • Return every leader in an array: an element greater than everything to its right.

    Level: Not reported.

    Right-to-left scanCodingOnline assessment
  • Count subarrays containing at least one "bad pair", where x is left of y and x % y = k.

    Level: Not reported.

    Prefix countingCodingOnline assessment
  • Minimum swaps to turn one permutation into another.

    Level: Not reported.

    Cycle decompositionCodingOnline assessment
  • Customers and products with no recorded sale.

    Level: Not reported.

    SQL anti-joinCodingOnline assessment
  • Inorder traversal of a nine-node binary tree.

    Level: Not reported.

    Tree traversalCodingOnline assessment
  • Top and bottom of the stack before the second multiplication in a postfix scan.

    Level: Not reported.

    Stack simulationCodingOnline assessment
  • Reverse a linked list first with recursion, then with pointers and no extra data structure.

    Level: Recursion stack; O(1)-space version.

    Linked-list reversalCodingRound 1
  • Find the first non-repeating character in a string.

    Level: Not reported.

    Frequency mapCodingRound 1
  • Find the lowest common ancestor of two nodes in a BST.

    Level: Not reported.

    BST orderingCodingRound 1
  • For every element, find the next greater element to its right.

    Level: Explain time and space complexity.

    Monotonic stackCodingRound 1
  • Delete a node given a random pointer and no head pointer.

    Level: Not reported.

    Pointer rewiringCodingRound 1
  • Construct a height-balanced BST from a sorted array.

    Level: Not reported.

    Divide and conquerCodingRound 1
  • Find all anagrams of a pattern in a string.

    Level: Basic OS questions followed.

    Fixed sliding windowCodingRound 1
Page 1 of 7

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.