A Software Engineer at Pubmatic works at the intersection of extreme scale, high throughput, and ultra-low latency. As a leading player in the programmatic advertising industry, Pubmatic processes trillions of ad impressions daily, requiring an engineering infrastructure that can make real-time bidding decisions in milliseconds. In this role, you will be responsible for designing, building, and optimizing software that manages massive data pipelines, complex ad-serving algorithms, and highly distributed systems. The impact of your work as a Software Engineer is immediate and highly visible. You will contribute to core products like high-volume ad servers, real-time analytics dashboards, and robust data ingestion systems. Engineering teams at Pubmatic tackle complex challenges in distributed computing, storage optimization, and concurrency, making this an exceptionally rewarding environment for developers who thrive on solving hard technical problems. ##### Tip Pubmatic processes trillions of ad impressions daily. Expect a heavy emphasis on low-latency, high-throughput system design during your architecture rounds. To succeed in this position, you must possess a deep understanding of core computer science principles, data structures, and algorithms.
Initial Screening
reportedThe process begins with an initial screening phase, which often includes a technical assessment.
What to demonstrate
- The process begins with an initial screening phase, which often includes a technical assessment
- Depth in Data Structures & Algorithms
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Technical Interviews
reportedProceed through multiple rounds of technical interviews that evaluate core coding skills and system design capabilities.
What to demonstrate
- Proceed through multiple rounds of technical interviews that evaluate core coding skills and system design capabilities
- Depth in Data Structures & Algorithms
How to prepare
- Answer aloud and timed: Write a program to find the middle element of a singly linked list in a single pass.
- Answer aloud and timed: Implement an algorithm to find a loop in a linked list and explain how you would resolve it.
Managerial and HR Discussion
reportedCulminate the interview process with a discussion involving managerial and HR representatives.
What to demonstrate
- Culminate the interview process with a discussion involving managerial and HR representatives
- Depth in Data Structures & Algorithms
How to prepare
- Answer aloud and timed: Given a sentence with no spaces, write an algorithm to split the text into individual, grammatically sensible words.
- Answer aloud and timed: Design and implement a solution to find the winner on an NxN Tic-Tac-Toe board.
PracHub editorial advice for the preparation topics above.
Know Your Resume Inside Out
Every project, technology, and methodology listed on your resume is fair game. Be prepared to explain the architectural decisions, challenges, and outcomes of your past work in detail.
Master Concurrency Concepts
Given the high-throughput nature of Pubmatic's systems, concurrency and multithreading are highly tested areas. Ensure you can write thread-safe code and explain lock synchronization.
Expect Written or Online Assessments
Many pipelines begin with a HackerRank test or a written paper test containing both coding challenges and multiple-choice CS questions. Practice solving timed coding problems to build speed and accuracy.
Handle Rigid Interviewers Professionally
You may occasionally encounter interviewers who expect a specific solution or approach. Remain calm, explain your logic clearly, and show flexibility by exploring alternative solutions if prompted.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Write an algorithm to reverse the string "I love My India" to "India My love I" without using any built-in spl
Write an algorithm to reverse the string "I love My India" to "India My love I" without using any built-in split functions.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Given an array of integers representing daily stock market data, find the specific days to buy and sell to max
Given an array of integers representing daily stock market data, find the specific days to buy and sell to maximize profit.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Write a program to find the middle element of a singly linked list in a single pass.
Write a program to find the middle element of a singly linked list in a single pass.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Implement an algorithm to find a loop in a linked list and explain how you would resolve it.
Implement an algorithm to find a loop in a linked list and explain how you would resolve it.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Given a sentence with no spaces, write an algorithm to split the text into individual, grammatically sensible
Given a sentence with no spaces, write an algorithm to split the text into individual, grammatically sensible words.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Explain how you would scale a backend system from thousands of users to handle millions of concurrent users.
Explain how you would scale a backend system from thousands of users to handle millions of concurrent users.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
What is the difference between `var` and `let` keywords in JavaScript, and how does hoisting affect them?
What is the difference between var and let keywords in JavaScript, and how does hoisting affect them?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
How do you implement multithreading in Java, and what mechanisms can you use to avoid race conditions?
How do you implement multithreading in Java, and what mechanisms can you use to avoid race conditions?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Explain the Singleton design pattern and how to make it thread-safe.
Explain the Singleton design pattern and how to make it thread-safe.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
What is the "diamond problem" in object-oriented programming, and how does Java resolve it?
What is the "diamond problem" in object-oriented programming, and how does Java resolve it?
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- Distinguish a value from a reference to it, and say which one you handed out.
Follow-up
- What happens if two callers reach this at the same time?
- Where could this allocate more than you expect?
Compare SQL and NoSQL databases, and explain when you would prefer primary versus secondary indexing.
Compare SQL and NoSQL databases, and explain when you would prefer primary versus secondary indexing.
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- Handle the rows that do not match: that is usually the actual question.
Follow-up
- How does the query change if that join becomes one-to-many?
- What happens to this when the table is ten times larger?
Stop tag and share joins from fanning out a page
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
Design and implement a solution to find the winner on an NxN Tic-Tac-Toe board.
Design and implement a solution to find the winner on an NxN Tic-Tac-Toe board.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How would you design a highly scalable data archival system and its corresponding indexing mechanism?
How would you design a highly scalable data archival system and its corresponding indexing mechanism?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design a low-level system for a classic game like Snake and Ladder, detailing the class hierarchy and state ma
Design a low-level system for a classic game like Snake and Ladder, detailing the class hierarchy and state management.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design an LRU (Least Recently Used) cache and explain the time complexity of its operations.
Design an LRU (Least Recently Used) cache and explain the time complexity of its operations.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Describe how you would implement a fault-tolerant distributed clustering system.
Describe how you would implement a fault-tolerant distributed clustering system.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Explain the Spring MVC architecture and how request lifecycle management occurs.
Explain the Spring MVC architecture and how request lifecycle management occurs.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
What is context switching in an operating system, and how does it impact application performance?
What is context switching in an operating system, and how does it impact application performance?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Explain the differences between B-Trees and B+ Trees and how they are used in database indexing.
Explain the differences between B-Trees and B+ Trees and how they are used in database indexing.
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
What are some common Unix commands you would use to troubleshoot a slow-running process or network issue?
What are some common Unix commands you would use to troubleshoot a slow-running process or network issue?
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- Separate the trigger from the cause; the deploy is rarely the bug.
Follow-up
- What would you look at first, and what would it rule out?
- How would you tell a cause from a coincidence here?
Built from the rounds and topics Pubmatic candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Pubmatic loop
- Write out the reported sequence: Initial Screening, Technical Interviews, Managerial and HR Discussion.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.
02Work Data Structures & Algorithms
- Spend the session on Data Structures & Algorithms, which Pubmatic candidates report being tested on.
- Write one worked example in Data Structures & Algorithms and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms.
03Work System Design
- Spend the session on System Design, which Pubmatic candidates report being tested on.
- Write one worked example in System Design and time yourself on it.
Deliverable: One timed worked example in System Design.
04Work Java
- Spend the session on Java, which Pubmatic candidates report being tested on.
- Write one worked example in Java and time yourself on it.
Deliverable: One timed worked example in Java.
05Answer out loud: Data Structures & Algorithms
- Answer aloud, timed: Write an algorithm to reverse the string "I love My India" to "India My love I" without using any built-in split functions.
- Answer aloud, timed: Given an array of integers representing daily stock market data, find the specific days to buy and sell to maximize profit.
Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.
06Answer out loud: System Design & Architecture
- Answer aloud, timed: How would you design a highly scalable data archival system and its corresponding indexing mechanism?
- Answer aloud, timed: Design a low-level system for a classic game like Snake and Ladder, detailing the class hierarchy and state management.
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
07Answer out loud: Language Fundamentals & Concurrency
- Answer aloud, timed: Explain the Spring MVC architecture and how request lifecycle management occurs.
- Answer aloud, timed: What is the difference between `var` and `let` keywords in JavaScript, and how does hoisting affect them?
Deliverable: Spoken answers to 2 reported Language Fundamentals & Concurrency question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Reverse your own decision and price the reversal
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
Approach
- State the original rationale without irony, in the version you would still defend given what was known then. If it is not defensible, the story is about carelessness rather than judgement, and a different example serves you better.
- Give the measurement that moved with a before and after: the p99 that did not improve, the cache hit rate that sat at 40%, the plan that flipped to a sequential scan once the table passed a size you can name.
- Cost the reversal in steps, not adjectives: expand-and-contract deploys, the dual-write window, the callers who had to be notified, the rows already written in the wrong shape that had to be backfilled or abandoned.
- Distinguish reversal from rewrite by naming what you kept. Most good reversals preserve the schema or the interface and undo one decision inside it, which is also why they were affordable.
Follow-up
- What in that decision was irreversible, and did you know it was irreversible when you made it?
- How did you tell the people who had already built on top of the original decision?
Estimate work you have never done and defend the range
You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.
Approach
- Decompose into independently deployable steps before estimating anything: add the column nullable, write both shapes, backfill in batches, verify, move reads, stop writing the old shape, drop it. That is four deploys spread over days, and the calendar estimate is dominated by them rather than by the loop's runtime.
- Do the arithmetic aloud for the part that has arithmetic in it: batch size times number of batches times per-batch duration, at a write rate the primary can absorb alongside roughly 1.2k writes per second of production traffic. The loop is throttled by replication lag and lock waits, not by how fast it can issue statements.
- Price the schema step by its lock rather than its statement duration. In PostgreSQL an ALTER TABLE taking ACCESS EXCLUSIVE waits for every open transaction on that table while later queries queue behind it, so a millisecond change issued during a thirty-second analytics query stalls that table for thirty seconds. Adding a nullable column with a non-volatile default avoids a rewrite from version 11; a new index wants CREATE INDEX CONCURRENTLY, which cannot run inside a transaction block and leaves an invalid index behind if it fails.
- Express the answer as a range whose endpoints each trace to a stated assumption, then name the cheapest experiment that collapses it, which is almost always running one real batch against the real table and multiplying.
Follow-up
- How do you verify the backfill genuinely finished, given rows written by production traffic while it ran?
- Where does the backfill resume from after a worker is killed mid-batch, and what makes that resume point trustworthy?
Narrate an outage you owned from page to postmortem
Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.
Approach
- Open on the signal rather than the cause: which metric at which percentile moved, on which service, at what time, so the listener follows the same evidence you had rather than a conclusion you already reached.
- Separate mitigation from diagnosis out loud. State what you did to stop the bleeding (flag off, shed traffic, drain a lease, roll back a deploy) and say plainly that you did it before the mechanism was known, because those are two jobs with different deadlines.
- Establish blast radius in countable terms: how many tenants, how many writes, and crucially whether the effect was loss or only delay. An append-only revision table or a pending outbox row means the change survived and the projection was merely behind, which is a repair rather than a data-loss incident.
- Prove the mechanism instead of asserting it. Name the trace span that grew, the plan that flipped to a sequential scan, the lease that expired, plus one alternative you ruled out and the signal that stayed flat while you ruled it out.
Follow-up
- What would you do differently in the first five minutes, given the same dashboard and no more information?
- Which follow-up action did you deliberately not take, and why was dropping it the right call?
- 01
Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.
- 02
You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.
- 03
Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.
How difficult is the Software Engineer interview at Pubmatic?
The interview process is highly technical and considered moderately difficult to challenging. It places a strong emphasis on core computer science fundamentals, coding efficiency, and system design rather than just framework-specific knowledge.
Pubmatic Software Engineer candidate reports ↗What is the typical timeline for the hiring process?
The entire process, from the initial recruiter screen to a final decision, typically takes between two to three weeks. However, coordination schedules and team alignments can occasionally extend this timeline.
Pubmatic Software Engineer candidate reports ↗What programming languages can I use during the coding interviews?
You can generally use any standard programming language you are comfortable with, such as Java, C++, Python, or JavaScript. It is highly recommended to use the language that best aligns with the specific requirements of the role you applied for.
Pubmatic Software Engineer candidate reports ↗How should I prepare for the system design rounds?
Focus on studying real-world distributed architectures, caching strategies, database scaling techniques, and object-oriented design principles. Practice drawing architectural diagrams and explaining the trade-offs of your design choices.
Pubmatic Software Engineer candidate reports ↗Does Pubmatic offer remote or hybrid work environments?
Pubmatic typically operates on a hybrid work model, blending in-office collaboration with remote flexibility. The exact policy can vary depending on the office location and the specific engineering team.
Pubmatic Software Engineer candidate reports ↗What topics does Pubmatic test in interviews?
Pubmatic interviews most often cover Object-Oriented Programming (OOP), Java, Problem Solving, Scalability, and Dynamic Programming. The exact emphasis depends on the specific role you apply for.
Pubmatic Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Pubmatic Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
GitHub Software Engineer Interview Questions & Guide 2026
Testing exercises for GitHub software engineer prep: choosing boundary cases over repetition, isolating tests from shared clock and ordering, and treating an intermittent failure as a defect rather than noise.
Zoom Communications Software Engineer Interview Guide
What Zoom Communications asks Software Engineer candidates, from reported rounds and questions.
Zemoso Technologies Software Engineer Interview Guide
What Zemoso Technologies asks Software Engineer candidates, from reported rounds and questions.
YASH Technologies Software Engineer Interview Guide
What YASH Technologies asks Software Engineer candidates, from reported rounds and questions.