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

Spotnana Software Engineer Interview Questions & Rounds

20 min read

How the Spotnana Software Engineer interview works: campus OA, recruiter call and coding rounds, with questions and prep from real candidate experiences.

In this article
On this page

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

Last updated November 20, 2026 · 19 min read · For campus full-time and SDE 1 candidates

Built by the Codinzhub team. This guide is built from Spotnana Software Engineer interview experiences that candidates shared, including online assessment questions posted on Codinzhub. The process changes by year, level and team, so treat this as a map, not a promise.

The 30-second version. The Spotnana Software Engineer interview data is thin: 3 reports, all from 2026. The IIT Delhi campus drive started with an online assessment listed as 3 DSA questions, with 4 problem titles shared. A referred SDE 1 backend candidate had no OA: a recruiter screening call led straight to Round 1, where two interviewers gave one Hard graph problem, Reconstruct Itinerary. Another candidate reported 4 coding rounds on graphs and DP. Spotnana's hiring page adds an introductory talent-acquisition call, a hiring manager round, then rounds with teammates and cross-functional partners, with virtual interviews on Google Meet and the offer sent by recruiter email. Round lengths, timelines and outcomes are not reported. The habit that matters most: agree on the approach, edge cases and data structure out loud, then leave enough time to finish the code.

What this guide is, and what it is not

This guide is built from 3 candidate reports of Spotnana's Software Engineer interviews, all from 2026, two of them from India: one campus online assessment at IIT Delhi shared on Codinzhub, one SDE 1 backend account and one software engineer account. Each stage rests on one or two reports, and Spotnana's own hiring page fills in the steps candidates did not describe.

It is:

  • A map of the process as candidates and Spotnana's hiring page describe it
  • The 5 reported problems and the topics they point to
  • A four-week plan and practice problems matched to those problems

It is not:

  • A list of leaked questions or a promise of what you will be asked
  • An official description of Spotnana's process
  • An offer rate. No report gives an offer or a rejection.

Important things to know before you start

These are the few facts in the data that change how you prepare.

Virtual rounds on Google Meet. Spotnana's hiring page says virtual interviews are held on Google Meet. The coding surface (a shared editor, an IDE, or whether code runs) is not reported, so practise explaining your code aloud while sharing your screen.

The OA depends on the route. The IIT Delhi campus drive started with an OA; the referred SDE 1 candidate went from a recruiter screening call straight to Round 1. With two reports, treat this as something to confirm with your recruiter or placement cell.

Graphs came up in two of three reports. One candidate got a Hard graph problem in Round 1, and another named graphs, with DP, as the topics of 4 coding rounds. Prepare graphs beyond the Medium level.

Round-by-round breakdown

The 3 reports and Spotnana's own hiring page together describe five stages: application, a recruiter or talent-acquisition call, an online assessment for the campus drive, coding interviews, and the offer. Each stage rests on one or two reports, so read each one as a single data point, not a rule.

Stage 1: Application, where candidates applied

The data has two candidate routes, one report each, plus the route Spotnana's hiring page describes. Spotnana's careers site lists Pune and Bangalore among its offices; the campus report comes from IIT Delhi.

ChannelWhat candidates said
Campus driveOne report: an on-campus online assessment at IIT Delhi in October 2026. The shared question pages tag the hire as full-time (FTE) on three pages and SWE on one.
Referral, then a recruiter callOne report: an SDE 1 backend candidate in India with 1 year of experience mentions the person who referred them. A recruiter called them for an interview after a screening call.
Careers siteSpotnana's hiring page says you apply on its website. No candidate in the data describes applying this way.

The third report, from a software engineer whose level is not stated, does not say how they applied.

What helped. Not reported. No candidate credits anything with moving them to the next step.

Stage 2: Shortlisting, how candidates moved forward

One candidate report and Spotnana's hiring page describe a call before any technical round.

  1. Recruiter or talent-acquisition call. Spotnana's hiring page says the process starts with an introductory call with its Talent Acquisition team. One SDE 1 candidate (2026) had a screening call with a recruiter and was then invited straight to the interview, with no online assessment. The length and topics of the call are not reported.
  2. Campus shortlisting. Not reported. The IIT Delhi report does not say whether a resume shortlist or an eligibility cut-off came before the OA. If your placement cell shares the drive's criteria, treat those as the source of truth.

No hiring questionnaire or situational test appears in the data.

Stage 3: Online assessment

Only the campus report describes an online assessment (OA), a timed coding test. The referred SDE 1 candidate said there was no OA, so whether you get one may depend on how you applied. That is two reports, not a rule.

Online assessment

How it works. The IIT Delhi drive in October 2026 held an on-campus OA. One question page gives the exam pattern as 3 DSA questions (DSA means data structures and algorithms). Four distinct problem titles were shared from the drive: three with an OA date of October 10, 2026, and one posted on October 18, 2026. Different slots may have received different sets, but the pages do not say so. The test length, the platform, test-case visibility and any AI-tool rules are not reported.

At a glance

  • Length: Not reported
  • Questions: 3 DSA questions (pattern on one page); 4 titles shared from the drive
  • What was asked: Techniques not reported; one problem's input is a rooted tree
  • Most common: No single repeated question

OA questions shared on Codinzhub. The full statements are members-only, so the table shows the name, the date and the technique only where the public page shows it.

QuestionDrive and dateWhat it testsLevel
Reset K EdgesIIT Delhi, OA October 10, 2026Not reported (the input is a rooted tree)Campus FTE
Subsequence With the Minimum ScoreIIT Delhi, OA October 10, 2026Not reportedCampus FTE
IntegerotSIIT Delhi, OA October 10, 2026Not reportedCampus FTE
Minimise Nucleating PowerIIT Delhi, posted October 18, 2026Not reportedCampus SWE

Subsequence With the Minimum Score shares its name with a public LeetCode problem rated Hard there. The OA statement is not public, so this guide does not assume the two are the same. See all Spotnana questions in the question bank.

Stage 4: The interview loop

Two candidate reports describe coding interviews, and Spotnana's hiring page describes the rest. The hiring page says candidates meet the hiring manager, then future teammates and cross-functional partners, that virtual interviews are held on Google Meet, and that extra stages vary by role. One 2026 software engineer reported 4 coding rounds, with graphs and DP (dynamic programming) as the topics. One SDE 1 candidate described Round 1 only. The two descriptions may cover different roles or teams; the data cannot say which. Round lengths are not reported, so this guide gives no minute-by-minute pacing.

Coding interview rounds

At a glance

  • Length: Not reported
  • Rounds: 4 coding rounds in one report; the other report describes Round 1 only
  • Questions: 1 problem in the one round described in detail
  • What was asked: Graphs (2 of 2 reports); DP (1 of 2, named as a topic only)
  • Most common: No single repeated question

Round 1 for one SDE 1 candidate. Two interviewers joined. After a short introduction, one interviewer gave the problem and the other explained it. They then discussed the approach, the edge cases and which data structure to use. The candidate found the optimal approach but could not finish the code, and was still waiting for a verdict, without much hope, when they wrote it up. They said it was the first time a DSA interview had given them a Hard problem.

QuestionFollow-upLevel
Reconstruct Itinerary: order the flights so each ticket is used onceEdge cases; choice of data structureSDE 1

The other report names topics only, graphs and DP, without problems. The hiring manager and team rounds that Spotnana's page describes have no candidate reports yet: their length, format and questions are not reported.

Stage 5: Decision and offer

Offer. Spotnana's hiring page says the recruiter sends the offer by email.

Candidate outcomes. Not reported in 2 of 3 reports. The SDE 1 candidate was still waiting for a verdict after Round 1. No report gives a timeline from application to decision, and no report mentions pay.

The Codinzhub Next-Round Playbook

No report says what a successful candidate did differently, because no report gives an offer. The bullets below come from how each stage was described, with the evidence named in each one.

To get past the recruiter call

  • Start coding prep before the call. One SDE 1 candidate went from a recruiter screening call straight to Round 1, with no OA in between, so the call may be your last checkpoint before a live coding round.
  • Ask which rounds your role has. Spotnana's hiring page says interview stages vary by role. Ask the recruiter how many coding rounds to expect, how long each one is, and whether there is a hiring manager round.

To get past the online assessment

  • Plan for three problems. The one campus drive in the data listed 3 DSA questions. The length is not reported, so check the clock at the start and give each problem a time budget.
  • Prepare every title from your drive. The IIT Delhi drive shared 4 titles against a pattern of 3 questions, so different candidates may have seen different sets.
  • Write your own edge cases. Test-case visibility is not reported. One problem takes a rooted tree as input, so try a single node, a long chain and a star-shaped tree.

To get past the coding interview rounds

  • Agree on the approach first. In one SDE 1 Round 1, the interviewers discussed the approach, the edge cases and the choice of data structure with the candidate. Say all three out loud before you type.
  • Leave time to finish the code. The same candidate found the optimal approach but could not complete the code, and did not expect to pass. Once the approach is agreed, start coding and get a complete version working before you polish it.
  • Expect a Hard graph problem. That round's problem was Reconstruct Itinerary, rated Hard, and another 2026 candidate named graphs as a topic of their 4 coding rounds.
  • Practise talking through code on a video call. Spotnana's hiring page says virtual interviews are held on Google Meet. The coding surface is not reported, so rehearse explaining your code while sharing your screen.

How the loop differs by level

The data has one report per level, so it cannot show real level differences yet. It does show the first step changing with the route: the campus drive had an OA, and the referred SDE 1 candidate did not.

LevelWhat candidates describe
Campus full-time (FTE or SWE tag)Based on one drive (IIT Delhi, October 2026). On-campus OA listed as 3 DSA questions, with 4 titles shared, such as Reset K Edges and Minimise Nucleating Power. Later rounds and system design: not reported.
SDE 1, backend (1 year of experience)Based on one report (India, 2026). A recruiter screening call, no OA, then Round 1 with two interviewers and one Hard problem, Reconstruct Itinerary. Later rounds and system design: not reported.
Software engineer, level not statedBased on one report (2026). 4 coding rounds covering graphs and DP. System design: not reported.

Senior hires and internships: no reports. Spotnana's hiring page says interview stages vary by role, so confirm your own loop with the recruiter.

Most-asked topics

Across 3 reports with a technical round, only one topic appears in more than one report: graphs. Every problem in the data was shared once, and the public pages show a technique for none of the OA problems.

TopicWhat it meansSeen inReported examples
GraphsNodes joined by edges; paths, traversal and ordering2 of 3 reports (1 question)Reconstruct Itinerary; the other report names the topic only
Technique not reportedThe problem name is public, the statement and technique are not1 of 3 reports (3 questions)Subsequence With the Minimum Score; IntegerotS; Minimise Nucleating Power
TreesA rooted structure of nodes with no cycles1 of 3 reports (1 question)Reset K Edges (input is a rooted tree)
Dynamic programmingBuilding an answer from answers to smaller subproblems1 of 3 reports (topic only)No problem reported

The question patterns that keep coming back

No problem repeats in the data, so these are the topics the 3 reports point to, ordered by how many reports mention them. Pattern 4 comes from a public problem that shares an OA title's name, not from a reported technique.

1. Graphs and paths that use every edge

Two of 3 reports point to graphs. One SDE 1 candidate got Reconstruct Itinerary in Round 1: given tickets as from-to pairs, order the flights so each ticket is used exactly once. On LeetCode this is solved with a depth-first search (DFS) that removes each edge as it uses it and adds an airport to the answer only when it has no unused edges left. That builds an Eulerian path, a path that uses every edge once. The other report named graphs as a topic of its 4 coding rounds without giving problems. How to choose: if a problem asks for an order that uses each connection exactly once, think Eulerian path; if it asks for the fewest steps, use breadth-first search (BFS); if it asks whether something is reachable, use DFS. When the answer must be the smallest in dictionary order, keep each node's neighbours sorted.

Reported examples. Reconstruct Itinerary (SDE 1, Round 1); graphs named as a topic in one 4-round loop.

2. Trees

One IIT Delhi OA problem, Reset K Edges, takes a rooted tree as input; the public page shows nothing more about it. How to choose: for most rooted-tree problems, decide what each node must return to its parent (a size, a depth or a best value), then compute it in one DFS from the root. If the tree is deep, plan for an iterative DFS so you do not hit the recursion limit.

Reported examples. Reset K Edges (IIT Delhi OA, technique not reported).

3. Dynamic programming

One 2026 software engineer named DP, together with graphs, as the topics of their 4 coding rounds. No DP problem was reported. How to choose: if the brute force tries every choice and the same smaller problem keeps coming back, write the state (what you need to know to finish) and the transition, then store each answer so it is computed once.

Reported examples. None: DP was named as a topic only.

4. Two strings, prefix and suffix matching

Subsequence With the Minimum Score from the IIT Delhi OA shares its name with a public LeetCode problem, rated Hard there. On LeetCode, you delete characters from string t so that it becomes a subsequence of string s, and the score is the length of the span from the first to the last deleted position. It is solved by recording how far each prefix of t matches into s from the left, doing the same for each suffix from the right, and joining the two with two pointers. The OA statement is not public, so treat this as a study choice based on the name. How to choose: when a problem lets you remove one contiguous block, precompute the best result from the left and from the right, then combine them.

Reported examples. Subsequence With the Minimum Score (IIT Delhi OA).

IntegerotS and Minimise Nucleating Power have no public statement or LeetCode namesake, so they are not placed in a group.

Preparing for the hiring manager round

Spotnana's hiring page says you meet the hiring manager, then future teammates and cross-functional partners. No candidate in the data describes these rounds, so there are no reported prompts to prepare from, and their length and format are not reported.

Build a short story bank. This is general advice, not something candidates reported for Spotnana. Prepare four to six real stories, each under two minutes: a backend or project feature you built, a bug you tracked down, a disagreement on a technical choice, and a deadline you had to manage. One of the 3 reports is from a backend SDE 1 candidate, so be ready to explain your own backend work in some depth.

Structure each story. Give the situation in one line, what you did (say "I", not "we"), the result with a number where you have one, and what you would do differently.

Use real experiences only. If you are a campus candidate without work experience, use projects and internships. Do not invent stories.

A four-week plan

The data supports only four study groups, so this plan runs four weeks instead of six. It follows the patterns above, most-reported first, and ends with timed mocks shaped like the reported rounds. Plan on two to three focused hours a day.

  1. Week 1: Graphs and paths that use every edge. DFS and BFS on adjacency lists, then Eulerian paths with sorted neighbours. Habit: draw the graph from the example before writing any code.
  2. Week 2: Trees and dynamic programming. Rooted-tree DFS where each node returns a value to its parent, then DP on sequences and grids. Habit: write the state and the transition in one line before coding.
  3. Week 3: Two strings with prefix and suffix matching, plus OA practice. Prefix and suffix arrays joined with two pointers; then two timed sets of 3 DSA problems in one sitting. The real OA length is not reported, so practise at 90 minutes and adjust when your placement cell confirms it. Habit: write your own edge cases before every submission.
  4. Week 4: Mocks. Three mock interviews on a video call with screen sharing, each with one Hard-level graph or tree problem. Agree on the approach, edge cases and data structure in the first part, then leave enough time to finish the code. Rehearse your hiring manager stories out loud.

Level adjustments: campus candidates should weight week 3's OA sets more; SDE 1 candidates who are referred may skip the OA, so give that time to week 4 mocks.

Only two weeks? Spend five days on graphs, three on trees and DP, two on two-string prefix and suffix matching, and four on timed mocks (5 + 3 + 2 + 4 = 14 days).

Practice problems that match these experiences

These are public practice problems that match the reported questions. Only one is a confirmed match: the SDE 1 candidate named Reconstruct Itinerary as the problem they were given. The other shares its name with an OA title whose statement is not public.

#Practice problemPatternSeen in these experiences as
1Reconstruct ItineraryGraphs, Eulerian path with DFSAsked as-is in one report (SDE 1, Round 1)
2Subsequence With the Minimum ScorePrefix and suffix matching, two pointersSame title as an IIT Delhi OA problem

Reset K Edges, IntegerotS and Minimise Nucleating Power have no verified practice match, because their techniques are not public. Practise them through their Codinzhub pages in the question bank.

How to handle a question you have never seen

No problem in the data was reported twice, and one candidate met a Hard problem they had not expected, so a repeatable method matters more than memorised solutions.

  1. Repeat the problem and one example. In the one Round 1 described, one interviewer gave the problem and the other explained it. Restate it in your own words and agree on one small example before anything else.
  2. Say the brute force and its complexity. It gives you a fallback and gets the interviewers talking about the approach, which that round spent time on.
  3. Name the bottleneck. Repeated lookups suggest a hash map; repeated range sums suggest prefix sums; "use every connection once" suggests an Eulerian path; "best result after removing one block" suggests prefix and suffix arrays.
  4. Say the edge cases and the data structure out loud. Both were discussed in that round before coding. Ask about empty input, repeated values and ties in ordering.
  5. Code in small pieces while talking. The candidate in that round found the optimal approach but could not finish the code. Write the main loop first, then helpers, so a working version exists early.
  6. Dry-run one case and fix the wrong line. On a video call, trace your example out loud. In an OA, test-case visibility is not reported, so run your own small and large cases before you submit.

Why candidates were rejected

0 of 3 reports give a rejection or a reason from Spotnana. The closest evidence is one candidate's own view:

  • Unfinished code after the right idea. One SDE 1 candidate, still waiting for a verdict, found the optimal approach in Round 1 but could not finish coding it, and did not expect to pass. This is the candidate's self-reflection, not feedback from Spotnana.
  • An unexpected difficulty level. The same candidate said it was the first time a DSA interview had given them a Hard problem. They felt unprepared for it; whether it affected the result is not reported.

Until more candidates share outcomes, treat these as warnings drawn from a single report, not as Spotnana's criteria.

Selected vs. rejected: do this, not that

No report links a habit to an offer or a rejection. The rows below are tied to what the reports do show, so you can practise them this week.

Do thisNot thatWhat the reports show
Agree first: state the approach, edge cases and data structure, then codeTyping straight away: coding before the interviewers agree on the planIn one SDE 1 Round 1, the interviewers discussed all three with the candidate.
Finish a working version: start coding as soon as the approach is agreedPolishing the idea: spending the round on the optimal idea with no complete codeThe same candidate found the optimal approach, could not complete the code, and did not expect to pass.
Prepare Hard graph problems: Eulerian paths, DFS and BFSStopping at Medium: assuming DSA rounds stay at Medium difficultyOne SDE 1 candidate got Reconstruct Itinerary, rated Hard, and had not expected it; another named graphs as a topic of 4 coding rounds.
Cover every title from your drive: practise all the shared OA problemsOne set only: stopping after the first 3 titlesThe IIT Delhi drive shared 4 titles against a pattern of 3 DSA questions.

If you remember only five things

  1. The data is thin. 3 reports from 2026: one campus OA at IIT Delhi, one SDE 1 backend Round 1 and one 4-round coding loop.
  2. The first step depends on the route. The campus drive had an OA listed as 3 DSA questions; the referred SDE 1 candidate had a recruiter call and no OA.
  3. Graphs are the core topic. Two of 3 reports point to graphs, including a Hard problem, Reconstruct Itinerary.
  4. Agree on the approach, then finish the code. Discuss the approach, edge cases and data structure, and leave time to complete a working version.
  5. Expect video interviews. Spotnana's hiring page says virtual interviews are held on Google Meet, with a hiring manager round and team rounds after the coding.

FAQ

Is there an online assessment?

Not on every route. The IIT Delhi campus drive had an OA listed as 3 DSA questions, while the referred SDE 1 candidate went from a recruiter screening call straight to Round 1.

How many coding rounds are there?

One 2026 software engineer reported 4 coding rounds; the SDE 1 candidate described Round 1 only. Spotnana's hiring page adds a hiring manager round and rounds with future teammates and cross-functional partners, and says stages vary by role.

Are the interviews virtual?

Spotnana's hiring page says virtual interviews are held on Google Meet. Whether code can be run during a round is not reported.

Do I need graphs and dynamic programming?

Prepare both, graphs first. Two of 3 reports point to graphs; one named DP as a topic without giving a problem.

Is system design asked?

Not reported. None of the 3 reports mentions a system design round.

How long does the process take?

Not reported. No report gives a timeline from application to decision.

About this guide

The Codinzhub team researched and wrote this Spotnana Software Engineer interview guide from 3 candidate reports, all from 2026: one campus OA shared on Codinzhub and two first-hand accounts posted online. Many other accounts were behind login walls and could not be read, so they are not used. We kept only what candidates described and what Spotnana's hiring page says. The question summaries are our own, and the practice links are labelled as exact or same-name matches. If you interviewed at Spotnana recently, share your experience on Codinzhub and we will update this guide.

Disclaimer. Spotnana's process changes by role, year and office. Use this guide to build 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 14 of 14 questions

  • Reset K Edges

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiIIT Delhi, OA October 10, 2026CodingOnline assessment
  • Subsequence With the Minimum Score

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiIIT Delhi, OA October 10, 2026CodingOnline assessment
  • IntegerotS

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiIIT Delhi, OA October 10, 2026CodingOnline assessment
  • Minimise Nucleating Power

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi).

    On CodinzhubIIT DelhiIIT Delhi, posted October 18, 2026CodingOnline assessment
  • 3

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi on-campus OA (OA date October 10).

    On CodinzhubIIT Delhi on-campus OA (OA date October 10IntegerotS: Coding question from the IIT Delhi on-campus OA (OA date October 10, 2026); the full statement is not public.CodingOnline assessment
  • 4

    A Spotnana online assessment question shared on Codinzhub (IIT Delhi on-campus OA (posted October 18).

    On CodinzhubIIT Delhi on-campus OA (posted October 18Minimise Nucleating Power: Coding question from the IIT Delhi on-campus OA (posted October 18, 2026); the full statement is not public.CodingOnline assessment
  • Reconstruct Itinerary: order the flights so each ticket is used once

    Level: SDE 1.

    Edge cases; choice of data structureCodingRound not stated
  • Graphs

    Level: 2 of 3 reports (1 question).

    Nodes joined by edges; paths, traversal and orderingCodingRound not stated
  • Technique not reported

    Level: 1 of 3 reports (3 questions).

    The problem name is public, the statement and technique are notCodingRound not stated
  • Trees

    Level: 1 of 3 reports (1 question).

    A rooted structure of nodes with no cyclesCodingRound not stated
  • Dynamic programming

    Level: 1 of 3 reports (topic only).

    Building an answer from answers to smaller subproblemsCodingRound not stated
  • 1

    Level: Graphs, Eulerian path with DFS.

    Reconstruct ItineraryCodingRound not stated
  • 2

    Level: Prefix and suffix matching, two pointers.

    Subsequence With the Minimum ScoreCodingRound not stated
  • 5

    Level: Graphs, DFS.

    Reconstruct Itinerary: order the flights so every ticket is used once: The candidate named LeetCode's Reconstruct Itinerary (rated Hard): rebuild one travel itinerary that uses every ticket exactly once. Discussion covered the approach, edge cases and the choice of data structure.CodingRound not stated

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.