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

Harness Software Engineer Interview Questions & Rounds

28 min read

How the Harness software engineer interview works: campus OA, HR call, DSA, low-level design and hiring manager rounds, from real candidate experiences.

In this article
On this page

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

Last updated November 20, 2026 · 26 min read · For campus hires, SDE interns, SDE 1, Software Engineer 2 and Senior SDE candidates

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

The 30-second version. For Harness software engineers, campus candidates start with an online assessment: 2 coding questions and 10 multiple-choice questions at the October 2026 IIT drives. Referred and recruiter-sourced candidates start with a short HR call instead. Then come 3 or 4 interviews of about an hour each, over video in the reports that say, and each one can end the process. DSA rounds usually have 2 problems, sometimes 3, and loops include a hiring manager or project round that digs into your resume. Low-level design starts at Software Engineer 2, and senior loops add API and system design. Two complete processes took about 2 weeks and about a month. The habit that matters most: state the brute force and its complexity, then optimise and dry-run your code.

What this guide is, and what it is not

This guide is built from 10 candidate experiences of Harness's software engineer interviews from 2023 to 2026. They cover campus online assessments, an SDE intern, an SDE 1, Software Engineer and Software Engineer 2 hires, and senior engineers, mostly in India. Three of the 10 are campus OA question sets shared on Codinzhub. The dataset is small, so most findings rest on one or two reports.

It is:

  • A map of the process, stage by stage, as candidates described it
  • The question patterns that came up, and the follow-ups candidates reported
  • 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 Harness'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 Harness-specific facts change how you should prepare.

Every round can end it. One Software Engineer 2 said each round was an elimination round, with recruiter feedback after each. One Software Engineer had a same-day second round cancelled about 30 minutes after a weak first round. Prepare for round 1 as seriously as the last.

Rounds are live, and the surface varies. Candidates described Zoom with CoderPad or a similar IDE, coding in their own IDE while explaining, or pseudo-code with explanation. One senior candidate did the LLD round on a whiteboard in the office, with no code. Practise both writing code that runs and explaining a design without code.

Harness lists an AI-based stage. Harness's India engineering candidate guide includes an AI-based assessment. In it, you read, change and reason about an existing codebase, and it is judged on engineering judgment rather than tool use or memorised algorithms. No candidate in this data described it, so ask your recruiter whether your loop includes it.

Round-by-round breakdown

Candidates described five stages: application, a recruiter or HR screen, an online assessment for campus hires, an interview loop of 3 to 4 rounds, and a decision call from HR.

Stage 1: Application, where candidates applied

Off-campus candidates mostly came in through referrals: 4 of the 5 off-campus records. Campus hiring shows up through online assessment questions shared on Codinzhub from three IIT drives in October 2026.

ChannelWhat candidates said
ReferralUsed by an SDE intern (2023), an SDE 1 (2023), a Software Engineer 2 (2024) and a Senior SDE (2025). The SDE 1, who had been laid off, got a referral from a senior Harness employee. The intern was offered a referral, and HR called the next day.
Recruiter outreachOne Software Engineer with 1.5 years of experience was contacted by a recruiter in 2024, then had a phone call with HR.
Campus drivesCodinzhub has OA questions from IIT Kharagpur, IIT Roorkee and IIT Guwahati, dated 13 to 16 October 2026 where a date is shown. The role offered at these drives is not stated on the pages.

What helped. Candidates credited referrals, from a friend or a senior employee, for the first call. No record mentions the careers site.

Stage 2: Shortlisting, how candidates moved forward

Off-campus candidates had a short HR or recruiter call before any technical round. Harness's India engineering candidate guide also lists an intro conversation with a hiring manager or recruiter as the first stage, covering your background, motivations and interests.

  1. Recruiter or HR call (4 records). One 2024 Software Engineer had a 10 to 15 minute call about their current company, current CTC (total yearly pay), tech stack and experience. HR then explained what Harness does and described 3 technical rounds on DSA and system design. The Software Engineer 2 (2024) and Senior SDE (2025) mention an HR call but give no details.
  2. Intern phone round (one 2023 report). A 15-minute call: introduction, background, projects, tech stack and two situational questions, which were not reported.
  3. Scheduling. The 2024 Software Engineer then got invites for two technical rounds on the same day, an hour apart. The second was cancelled after the first (see Stage 5).

No record describes a hiring assessment or questionnaire for experienced hires. Campus candidates were shortlisted through the OA in Stage 3.

Stage 3: Online assessment

Campus candidates and one 2026 candidate for an 11-month role reported an online assessment (OA), a timed coding test taken before interviews. No referred or recruiter-sourced candidate had one: they went from the HR call straight to live interviews. No record describes a separate technical phone screen.

Online assessment

How it works. The three October 2026 campus drives on Codinzhub give the same pattern: 2 coding questions plus 10 multiple-choice questions (MCQs). Two IIT Guwahati pages describe the MCQs as software engineering MCQs. The 11-month role candidate was told to expect one hands-on coding question, so the format may differ by role. No record gives the length, the platform, whether test cases were visible, or any rule on AI tools.

At a glance

  • Length: Not reported.
  • Questions: 2 coding questions and 10 MCQs at all three campus drives. One 11-month role candidate was told 1 hands-on coding question.
  • What was asked: Problem titles point to grids, trees, rotations and shifts, and counting. The full statements are not public, so the techniques are not reported.
  • Most common: No single repeated question. One cyclic-shift problem from IIT Kharagpur was shared three times under different titles.

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

QuestionDriveTopic
Cherry PickupIIT Kharagpur, 16 October 2026Not reported
Reset K edgesIIT Kharagpur, 16 October 2026Not reported
Minimum cyclic shifts to make a column all onesIIT Kharagpur, 16 October 2026; also shared as Cyclic Shift and ShiftsNot reported
Index of maximum element after left rotationsIIT Roorkee, 14 October 2026Not reported
Count configurations to reach a target powerIIT Roorkee, 14 October 2026Not reported
Maximum weight tree after degree constraintsIIT Guwahati, 13 October 2026Not reported
Count ways to build good stringsIIT Guwahati, 13 October 2026Not reported
Minimum jumps in a gridIIT Guwahati, date not shownNot reported
Tower placement on a tree: number of waysIIT Guwahati, date not shownNot reported

See all Harness OA questions in the question bank.

Stage 4: The interview loop

Off-campus loops had 3 or 4 interviews, and each could end the process. The SDE 1 loop (2023) had three 1-hour rounds; the intern (2023), Software Engineer 2 (2024) and Senior SDE (2025) loops had four. Rounds ran about 1 hour, except a 1.5-hour coding plus low-level design round (Software Engineer 2) and a 40-minute hiring manager plus HR round (intern). The three reports that describe the format were virtual (Zoom with CoderPad or a similar IDE in one), apart from one senior design round on an office whiteboard. Harness's India candidate guide says the order of stages varies by role and level.

What a 60-minute DSA round looks like

TimeWhat candidates describedWhat to do
0–5 minIntroductions; one interviewer skipped straight to problems, another asked about previous work firstHave a one-minute summary of your current work ready
5–25 minProblem 1: brute force, then an optimised version, coded, with time and space complexitySay the brute force and its cost, then improve it out loud
25–50 minProblem 2, sometimes a third; one SDE 1 round had 3 problemsKeep the same order: idea, complexity, code, dry-run
50–55 minEdge cases and a dry-run (tracing the code by hand on one input)Pick edge cases yourself before you are asked
55–60 minYour questionsAsk about the team or product area

In three reports, candidates gave the brute force first, then the optimisation, then its complexity.

DSA coding rounds

At a glance

  • Length: 1 hour in all 5 reports that give a length. One Software Engineer 2 round of 1.5 hours combined coding with design.
  • Questions: 2 problems in 3 of the 5 reports that give a count; 3 problems in the other two. Difficulty was described as medium (Software Engineer 2) and one hard plus one medium (Senior SDE).
  • What was asked: Arrays, two pointers, sorting, sliding window, heaps, trees, binary search trees (BSTs), intervals and dynamic programming (DP).
  • Most common: No single repeated question.

Expectations differ by level. The SDE 1 gave pseudo-code with explanation and complexity. The Senior SDE was expected to write optimised, bug-free code and dry-run it with edge cases. The intern's first technical round mixed 2 DSA problems with core CS questions on DBMS, OOP, operating systems, networking, cloud and security. The senior backend loop had a round testing Java and Spring Boot alongside DSA; the candidate coded the DSA in C++.

Interviewers gave hints in two reports. One replaced a problem the candidate asked to skip, but the candidate could not finish the replacement and HR cancelled the next round.

QuestionWhat it testsLevel
3Sum Closest: three numbers whose sum is closest to a targetSorting, two pointersSDE 1
Sliding Window MaximumSliding window with a heap or dequeSDE 1
Order characters by decreasing frequencyCounting and sorting by frequencySDE 1
Range Sum of BSTBST traversal with pruningIntern
Merge overlapping intervals (a variant)Sort by start, then mergeIntern
Search for a key in a row- and column-sorted matrixStaircase search from a cornerSoftware Engineer
Minimum time to burn a binary tree from a given nodeParent pointers plus BFS from the start nodeSoftware Engineer
Paint House: minimum cost with no two adjacent houses the same colourDP over houses and coloursSoftware Engineer

Low-level design rounds

At a glance

  • Length: 1 hour in both reports, plus one LLD question inside a 1.5-hour coding round.
  • Rounds: 2 for the Software Engineer 2 (a dedicated LLD round, then coding plus LLD). The Senior SDE had 1, plus a small LLD problem inside the final round.
  • What was asked: Class design for an exchange system, a lift, and a small app feature with concurrency.
  • Most common: No design repeated.

Low-level design (LLD) means designing classes, their responsibilities and how they interact, rather than servers and databases. Only the Software Engineer 2 and Senior SDE loops had it. The Software Engineer 2 stressed that one hour is tight for LLD. The Senior SDE's round was on a whiteboard with no code. The interviewer expected requirement gathering, clarifying questions, a class diagram with entities and methods, and design principles and patterns, then probed the reasoning with many questions.

Reported designs.

  • Design an exchange system, in a 1-hour LLD round
  • Design a lift (elevator) system, after 2 medium coding questions in the same 1.5-hour round
  • Design a small app feature, where most of the discussion was about handling concurrency

Hiring manager, design and project rounds

At a glance

  • Length: 1 hour in three reports; 40 minutes for the intern's hiring manager plus HR round.
  • Questions: Not reported as a count. Rounds mixed project discussion, design and behavioral questions.
  • Themes: Your projects and resume, high-level design (HLD) concepts, API design, core Java, situational and behavioral questions.
  • Most common: No single repeated prompt.

Each of the four loops that went past the first round had a round mixing project or design discussion with behavioral questions. The Software Engineer 2 met the product owner in a hiring manager round on projects and HLD concepts. The Senior SDE's last round went from API design to a small LLD problem, core Java and behavioral questions. In the SDE 1 loop, an engineering manager mixed 2 easy coding questions with behavioral ones, and round 3 was about projects. The intern had a resume cross-questioning and project-demo round with a US-based senior engineer, then a hiring manager plus HR round. One 2024 US senior candidate's first round combined coding with past projects. None of these reports gives the exact behavioral questions.

Reported prompts.

  • Discuss your projects and high-level design concepts with the product owner
  • Design an API, then discuss it
  • Walk through a resume project with a demo, under cross-questioning
  • Talk about your previous work experience and projects

See all reported questions in the question bank.

Stage 5: Decision and offer

Feedback between rounds. The Software Engineer 2 (2024) said every round was an elimination round, with recruiter feedback after each. One 2024 Software Engineer's same-day second round was cancelled about 30 minutes after a weak first round. The Senior SDE (2025) reported per-round ratings: Strong Hire for the first DSA round and the LLD round, Lean Hire for the DSA plus Java round. The final outcome is not stated.

Decision. No record describes a hiring committee, team matching or a level change. The SDE 1 (2023) got a call from HR the day after the last round: every round was cleared and an offer would follow.

Timeline. Two reports give an end-to-end length. The SDE 1 process took about 2 weeks, with rounds on 23 June, 29 June and 4 July 2023. The Software Engineer 2 process took about a month in early 2024, slowed by changing requirements and less urgent hiring.

The Codinzhub Next-Round Playbook

Candidates who moved forward showed their reasoning step by step and knew their own projects in depth.

To get past the recruiter or HR call

  • Have short answers ready on your current company, stack, experience and CTC. One 2024 candidate was asked all four in a 10 to 15 minute call.
  • Ask how many rounds there are and what each covers. One candidate had two technical rounds booked for the same day.
  • Interns: prepare a short summary of each project. The 2023 intern's call covered projects, tech stack and two situational questions.

To get past the OA

  • On campus, expect 2 coding questions and 10 MCQs, the pattern at all three October 2026 drives. Revise software engineering fundamentals for the MCQs.
  • Confirm the format for your role. One 2026 candidate for an 11-month role was told to expect a single hands-on coding question.

To get past the DSA coding rounds

  • Say the brute force and its complexity first, then optimise. Three candidates followed this order.
  • Budget for 2 problems in an hour, sometimes 3, and start coding once your approach is agreed.
  • Dry-run with edge cases before you say you are done. The Senior SDE was expected to.
  • Do not count on swapping a problem. One candidate who asked to skip a tree problem still did not pass.

To get past the low-level design rounds

  • Spend the first minutes on requirements. The senior LLD interviewer expected detailed requirement gathering before any classes.
  • Draw entities, methods and relationships, and name the design principles you use.
  • Watch the clock. The Software Engineer 2 said one hour is tight for LLD.

To get past the hiring manager and project rounds

  • Know each project's purpose, your own work and its timeline, and be ready to demo one.
  • Expect to move from projects to API or high-level design, then to core language questions (Java, in one backend loop).

To get through the decision

  • Expect feedback after each round. One candidate heard from HR the next day; another had a round cancelled about 30 minutes after a weak one.
  • If the process stalls, ask the recruiter for a date. One loop took about a month because requirements changed.

How the loop differs by level

Every level has DSA rounds and a round on your own work, and design grows with seniority. Each row rests on one or two reports, so treat the rows as examples.

LevelWhat candidates describe
Campus hires (role not stated)An OA of 2 coding questions and 10 MCQs at three IIT drives in October 2026. No campus interview round is recorded yet. One 2026 candidate for an 11-month role was told to expect one hands-on coding question.
SDE internOne 2023 report: a 15-minute phone round, a 1-hour round of core CS plus 2 DSA problems, a 1-hour resume and project-demo round, then a 40-minute hiring manager plus HR round. No design round.
SDE 1One 2023 report, under a year of experience: three 1-hour rounds. These were 3 DSA problems, an engineering manager round with 2 easy coding questions and behavioral questions, and a projects round. No design round.
Software Engineer and Software Engineer 2Two 2024 reports, 1 to 1.5 years of experience. The Software Engineer 2 had an HR screen, then coding, LLD (an exchange system), a hiring manager round on projects and HLD concepts, and coding plus LLD (a lift). The other candidate was told to expect 3 rounds on DSA and system design, but was stopped after the first.
Senior SDETwo reports. A 2025 backend loop in India: DSA (one hard, one medium), whiteboard LLD in the office, DSA plus Java and Spring Boot, then API design, a concurrency-focused LLD problem, core Java and behavioral questions. A 2024 US candidate had coding plus projects, then coding and system design rounds.

Harness's India candidate guide adds mentorship and technical leadership to the leadership discussion for senior roles.

Most-asked topics

The OA pages show titles only, so loop topics come from the 5 interview reports that named their questions or prompts. Project and design discussion was the most widespread topic. Arrays, sorting and two pointers led the coding questions.

TopicWhat it meansSeen inReported examples
Projects and design discussionExplaining your past work, APIs and high-level design choices4 of 5 reportsProjects and HLD concepts with the product owner; design an API; a resume project with a demo
Arrays, two pointers, sorting and intervalsOrdering data, then scanning it with one or two indices3 of 5 reports3Sum Closest; a Merge Intervals variant; search in a row- and column-sorted matrix
Trees and BSTsRecursion or traversal over nodes with children2 of 5 reportsRange Sum of BST; minimum time to burn a binary tree from a node
Low-level design and concurrencyClasses, their methods and safe access to shared state2 of 5 reportsAn exchange system; a lift; a small feature with concurrency
Strings, hashing and countingCounting characters or grouping strings with a hash map1 of 5 reportsAn anagram problem on a list of strings; order characters by decreasing frequency
Sliding window and heapsTracking the best value inside a moving range1 of 5 reportsSliding Window Maximum
Dynamic programmingReusing answers to smaller subproblems1 of 5 reportsPaint House

The question patterns that keep coming back

No single problem repeats in this small dataset, but the rounds fall into a few patterns. Learn to spot the pattern behind the story.

1. Your own work, under questioning

This was the widest pattern: 4 of the 5 detailed loops had a round that dug into your projects, previous work or a design you own. Interviewers included a product owner, a US-based senior engineer and a hiring manager. For each resume project, know its purpose, what you built, the timeline and what you would change. Expect a demo or a design discussion.

Reported examples. Projects and HLD concepts with the product owner; a resume project with a live demo and cross-questioning on its technologies; previous work at the start of a DSA round; an API design discussion in a senior final round.

2. Arrays, sorting and two pointers

These were the most common coding problems: 3 of 5 reports. Ask whether sorting first turns a nested loop into one scan. For a pair or triple near a target sum, sort and move two pointers inward. For overlapping ranges, sort by start and merge. For a matrix sorted along rows and columns, start at a corner where each move discards a row or column.

Reported examples. 3Sum Closest, brute force first and then sorting plus two pointers; a Merge Intervals variant; search for a key in a row- and column-sorted matrix.

3. Trees

2 of 5 reports had a tree problem. Decide what each recursive call returns to its parent. If something spreads outward from a node, add parent links and run a breadth-first search (BFS), a level-by-level traversal.

Reported examples. Range Sum of BST, pruning subtrees outside the range; minimum time to burn a binary tree from a given node.

4. Low-level design under time pressure

This appeared in 2 of 5 reports, both at Software Engineer 2 or above, each time as a concrete system. Start with requirements and clarifying questions, list the entities, draw classes and methods, then walk one request end to end. If state is shared, say which object owns it and how updates stay safe.

Reported examples. Design an exchange system in 1 hour; design a lift after 2 medium coding questions; a small app feature where most of the discussion was about concurrency.

5. Strings, counting, sliding windows and DP (single reports)

Each came from one report, so they are rare in this data. Group anagrams with a hash map keyed by sorted letters. Count, then sort by count, to order characters by frequency. Use a deque (a queue open at both ends) for the maximum of each window. When a recursion recomputes the same states, as in Paint House, store the cost per house and colour.

Reported examples. An anagram problem on a list of strings; order characters by decreasing frequency; Sliding Window Maximum; Paint House, recursion first and then DP.

Preparing for the hiring manager and project rounds

Harness candidates did not report a separate values round. Behavioral and situational questions came inside hiring manager, engineering manager and project rounds, mixed with technical questions, and these rounds can eliminate you like the others. Harness's India candidate guide describes a project retrospective stage (design decisions, challenges, collaboration and disagreements) and a leadership stage (communication, cross-team work, trade-offs).

Build your story bank around your projects. No report gives the exact behavioral questions, so prepare for the formats candidates described:

ThemeReported prompt (paraphrased)Follow-up to expect
Project depthWalk through a resume project, with a demoCross-questioning on each listed technology; DSA questions built from the project
Projects and designDiscuss your projects and HLD concepts with the product ownerNot reported
API designDesign an API, then discuss itA small concurrency-focused design, then core Java questions
Previous workTalk about your previous work experience and projectsNot reported
SituationalTwo situational questions in a 15-minute intern phone roundNot reported

Structure each story. Give the situation in one line, what you did (say "I"), the result with a number where you have one, and what you would change. Use real experiences only. Interviewers who cross-question technologies will find the gaps in a made-up story.

Expect depth. The intern advised knowing each project's purpose, your own work and its timeline. Bring questions for the interviewer: the Senior SDE asked about culture and team structure.

A six-week plan

This plan follows the patterns above, most common first, and ends with mocks that match the real rounds. It is editorial advice based on a small dataset. Plan on 2 to 3 focused hours a day.

  1. Week 1: Arrays, sorting, two pointers and intervals. Target sums, merging intervals, searching a sorted matrix. Habit: write the brute force and its complexity before every optimised solution.
  2. Week 2: Trees and BSTs. Traversals, BST range queries, parent links and BFS from any node. Habit: say what each recursive call returns.
  3. Week 3: Low-level design and concurrency. One 45-minute class design a day: an exchange, a lift, a feature with shared state. Habit: spend the first 10 minutes on requirements only.
  4. Week 4: Your projects and API design. Write a one-page retrospective per resume project (purpose, your part, timeline, decisions, what you would change), and design one API a day. Habit: answer every "why" with a trade-off.
  5. Week 5: Strings, hashing, sliding windows, heaps and DP. Anagram grouping, frequency sorting, window maxima, house-painting DP. Habit: turn each recurrence into working code within 10 minutes.
  6. Week 6: Mocks. Four timed 60-minute mocks with 2 problems each, in a shared online editor over video, with a dry-run at the end. Add two 1-hour design mocks at Software Engineer 2 and above. Rehearse your project stories out loud.

Level adjustments. Campus candidates should add timed OA practice (2 coding questions plus MCQs) from week 1. Interns should swap week 3's LLD for core CS (DBMS, OOP, operating systems, networking), which one intern round covered. Senior candidates should start LLD in week 2 and revise Java and Spring Boot, which one senior backend loop tested.

Only two weeks? Spend 4 days on arrays, sorting and two pointers, 3 on trees, 2 on low-level design (or core CS for interns), 2 on project retrospectives, and 3 on timed mocks.

Practice problems that match these experiences

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

#Practice problemPatternSeen in these experiences as
13Sum ClosestSorting, two pointersAsked as-is in one SDE 1 report
2Merge IntervalsSort by start, then mergeAn intern problem described as similar to Merge Intervals
3Search in a row wise and column wise sorted matrixStaircase search from a cornerAsked as-is in one Software Engineer report
4Range Sum of BSTBST traversal with pruningAsked as-is in one intern report
5Amount of Time for Binary Tree to Be InfectedParent links plus BFS from a start nodeMinimum time to burn a binary tree from a given node
6Group AnagramsHash map keyed by a canonical formAn anagram problem on a list of strings (exact statement not remembered)
7Sort Characters By FrequencyCount, then sort by countAn easy question on characters in decreasing frequency
8Sliding Window MaximumSliding window with a heap or dequeAsked as-is in one SDE 1 report
9Minimize cost of painting N houses such that adjacent houses have different colorsDP over houses and coloursPaint House, from one Software Engineer report; a free version of the same idea

No verified practice page matches the low-level design questions (an exchange system, a lift, a feature with concurrency). For the campus OA, practise directly on the Codinzhub question pages listed in Stage 3.

How to handle a question you have never seen

Most Harness coding rounds gave 2 problems in an hour, so a repeatable method matters more than memorised answers.

  1. Repeat the problem and one example. Write the example in the shared editor so you and the interviewer agree on the input and output before you design anything.
  2. Say the brute force and its complexity. Three candidates opened this way. The rejected candidate believed skipping it raised the difficulty of the next problem.
  3. Name the bottleneck. Repeated lookups suggest a hash map. Repeatedly finding the best item suggests a heap. Unsorted input often becomes a two-pointer scan after sorting. Something spreading from a tree node suggests parent links plus BFS.
  4. Say when you are stuck. Interviewers gave hints in two reports. Asking to switch problems did not save the round for the one candidate who tried it.
  5. Code in small pieces while talking. Write helpers with clear names, and get a working version before polishing. One candidate lost 15 to 20 minutes on a recursion they had already explained.
  6. Dry-run one case and fix the wrong line. Trace your example and one edge case by hand. The Senior SDE was expected to dry-run every solution, and another candidate showed key and edge cases before the complexity discussion. Leave about 5 minutes for this.

Why candidates were rejected

Only one report in the data is a rejection, and it is the only one that gives a reason. The points below are that candidate's self-reflection, plus one weak round from a senior loop whose outcome is not stated. Treat them as single reports.

  • Not being ready for a topic. The rejected Software Engineer (2024) was not prepared for tree problems and asked to skip one. The interviewer gave a different problem, but that one also went unfinished.
  • Running out of time on the code. On the replacement, Paint House, the candidate explained recursion and then DP. They spent 15 to 20 minutes failing to write the recursive function, and the round ended. HR cancelled the second round about 30 minutes later.
  • Showing the optimal answer too quickly. The same candidate gave the optimal solution to the first problem straight away. They believed this raised the difficulty, and advised walking through the simpler approach first.
  • Low energy late in the day. The Senior SDE (2025) solved the first problem of their third round but struggled with the second, even with hints. They blamed low energy after a packed day. That round was rated Lean Hire; the final outcome is not stated.
  • A bad feeling is not a failed round. The SDE 1 (2023) felt the end of one round went wrong, yet HR called the next day with an offer.

Selected vs. rejected: do this, not that

None of the selected candidates described a perfect loop. A few habits repeated, and the one rejected report shows what skipping them cost.

Do thisNot thatWhat the reports show
Brute force first: state the simple approach and its cost, then optimiseJumping to the optimal code with no path to it3 candidates gave the brute force first. The rejected candidate believed going straight to the optimal answer raised the difficulty.
Code the recursion you describe: practise turning a recurrence into code quicklyExplaining DP without writing itOne candidate explained Paint House correctly, spent 15 to 20 minutes on the recursion, and was rejected.
Cover trees before the loop: traversals, parent links, BFS from a nodeAsking to skip a topicTrees came up in 2 of 5 reports. The candidate who asked to skip one did not pass the round.
Dry-run with edge cases before you say you are doneLeaving the interviewer to find the bugsThe Senior SDE was expected to dry-run with edge cases; another candidate showed key and edge cases unprompted.
Pace a long day: reset between back-to-back roundsRunning on empty in the last roundsThe Senior SDE's third round on a packed day was rated Lean Hire, after two Strong Hires.

If you remember only five things

  1. The process is short but every round counts. An HR or recruiter call leads to 3 or 4 interviews of about an hour each, and each can end the process.
  2. Campus hiring starts with an OA. The October 2026 IIT drives used 2 coding questions and 10 MCQs.
  3. Coding rounds want the path, not just the answer. Give the brute force and its complexity, then optimise, then dry-run with edge cases.
  4. Arrays, sorting and trees led the coding questions, and projects came up in 4 of 5 detailed loops. Know your resume projects well enough to demo and defend them.
  5. Design grows with level. Low-level design starts at Software Engineer 2, and senior loops add API and system design.

FAQ

Does everyone take an online assessment?

No. Only campus candidates reported one: 2 coding questions and 10 MCQs at three IIT drives in October 2026. Referred and recruiter-sourced candidates went from an HR call straight to live interviews.

How many rounds are there?

Three or four interviews in this data. The SDE 1 had three 1-hour rounds. The intern, Software Engineer 2 and Senior SDE each had four, including a hiring manager or project round.

Is system design asked?

It depends on level. The intern and SDE 1 loops had no design round. The Software Engineer 2 had two low-level design questions (an exchange system and a lift). The 2025 Senior SDE had low-level design plus API design, and a 2024 US senior candidate had a system design round.

How long does it take?

About 2 weeks for an SDE 1 in 2023, and about a month for a Software Engineer 2 in 2024, slowed by changing requirements. Only these two reports give a length.

Will the interviewer help me?

Sometimes. Interviewers gave hints in two reports, and one swapped a problem when the candidate asked. In that report the candidate still did not pass, so treat hints as help, not a rescue.

Is it virtual or onsite?

Virtual in the three reports that say, with one exception. The Software Engineer 2 had every round on Zoom. The Senior SDE did the LLD round in the office on a whiteboard and the other rounds virtually.

About this guide

The Codinzhub team wrote this Harness Software Engineer interview guide from 10 candidate experiences from 2023 to 2026, including experiences and OA questions shared on Codinzhub. We kept only what candidates described, and label facts from Harness's own candidate guide as official. The questions are our own short summaries, and the practice links are similar problems unless a row says the problem was asked as-is. If you interviewed at Harness recently, share your experience on Codinzhub and we will update this guide. You can also browse the Harness questions on Codinzhub.

Disclaimer. Harness's process changes by role, year and level. Use this guide to build a foundation, and confirm the current format with your recruiter.

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

  • Cherry Pickup

    A Harness online assessment question shared on Codinzhub (IIT Kharagpur, 16 October 2026).

    On CodinzhubIIT Kharagpur, 16 October 2026Not reportedCodingOnline assessment
  • Reset K edges

    A Harness online assessment question shared on Codinzhub (IIT Kharagpur, 16 October 2026).

    On CodinzhubIIT Kharagpur, 16 October 2026Not reportedCodingOnline assessment
  • Minimum cyclic shifts to make a column all ones

    A Harness online assessment question shared on Codinzhub (IIT Kharagpur, 16 October 2026; also shared as Cyclic Shift and Shifts).

    On CodinzhubIIT Kharagpur, 16 October 2026; also shared as Cyclic Shift and ShiftsNot reportedCodingOnline assessment
  • Index of maximum element after left rotations

    A Harness online assessment question shared on Codinzhub (IIT Roorkee, 14 October 2026).

    On CodinzhubIIT Roorkee, 14 October 2026Not reportedCodingOnline assessment
  • Count configurations to reach a target power

    A Harness online assessment question shared on Codinzhub (IIT Roorkee, 14 October 2026).

    On CodinzhubIIT Roorkee, 14 October 2026Not reportedCodingOnline assessment
  • Maximum weight tree after degree constraints

    A Harness online assessment question shared on Codinzhub (IIT Guwahati, 13 October 2026).

    On CodinzhubIIT Guwahati, 13 October 2026Not reportedCodingOnline assessment
  • Count ways to build good strings

    A Harness online assessment question shared on Codinzhub (IIT Guwahati, 13 October 2026).

    On CodinzhubIIT Guwahati, 13 October 2026Not reportedCodingOnline assessment
  • Minimum jumps in a grid

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

    On CodinzhubIIT Guwahati, date not shownNot reportedCodingOnline assessment
  • Tower placement on a tree: number of ways

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

    On CodinzhubIIT Guwahati, date not shownNot reportedCodingOnline assessment
  • 3Sum Closest: three numbers whose sum is closest to a target

    Level: SDE 1.

    Sorting, two pointersCodingRound not stated
  • Sliding Window Maximum

    Level: SDE 1.

    Sliding window with a heap or dequeCodingRound not stated
  • Order characters by decreasing frequency

    Level: SDE 1.

    Counting and sorting by frequencyCodingRound not stated
  • Range Sum of BST

    Level: Intern.

    BST traversal with pruningCodingRound not stated
  • Merge overlapping intervals (a variant)

    Level: Intern.

    Sort by start, then mergeCodingRound not stated
  • Search for a key in a row- and column-sorted matrix

    Level: Software Engineer.

    Staircase search from a cornerCodingRound not stated
  • Minimum time to burn a binary tree from a given node

    Level: Software Engineer.

    Parent pointers plus BFS from the start nodeCodingRound not stated
  • Paint House: minimum cost with no two adjacent houses the same colour

    Level: Software Engineer.

    DP over houses and coloursCodingRound not stated
  • Projects and design discussion

    Level: 4 of 5 reports.

    Explaining your past work, APIs and high-level design choicesCodingRound not stated
  • Arrays, two pointers, sorting and intervals

    Level: 3 of 5 reports.

    Ordering data, then scanning it with one or two indicesCodingRound not stated
  • Trees and BSTs

    Level: 2 of 5 reports.

    Recursion or traversal over nodes with childrenCodingRound not stated
Page 1 of 3

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.