Media.net Software Engineer Interview Questions & Rounds
How the Media.net software engineer interview works: campus OA, DSA and CS fundamentals rounds, design and HR, from real candidate experiences.
On this page
[Draft] How to Crack Media.net: The Software Engineer Interview, From Real Experiences
Last updated November 20, 2026 · 33 min read · For SDE interns, new grads (SDE 1 and 6-month intern plus full-time) and Web Developer candidates
Built by the Codinzhub team. This guide is built from Media.net software engineer interview experiences that candidates shared, including posts and OA questions on Codinzhub. The process changes by year, college and track, so treat this as a map, not a promise.
The 30-second version. For Media.net software engineers, mostly hired through Indian campus drives, the process starts with a coding OA, usually 3 coding questions in 90 minutes that candidates rated hard, on InterviewBit in the 3 reports that name a platform. The OA score decides who interviews. SDE candidates then had 2 or 3 technical interviews of about 60 minutes on Google Meet. Each had one main DSA problem, coded in a shared Google Doc with no way to run code, plus OS, DBMS, networks or SQL questions. Some drives added a design and projects round with a manager, and an HR or hiring-manager conversation of 45 to 60 minutes closed the loop. In the two reports that give timing, the decision came within hours to a day. The key habit: state a brute force, improve it out loud, and code the agreed solution quickly and cleanly.
What this guide is, and what it is not
This guide is built from 22 records of Media.net's software engineer hiring, from 2023 to 2026: 8 candidate experiences shared on Codinzhub, OA questions shared on Codinzhub from 11 drives or pages, and 3 public candidate write-ups. Almost all come from campus hiring in India (interns, new grads and Web Developer), plus one experienced hire.
It is:
- A map of the process, stage by stage, as candidates described it
- The question patterns that keep coming back, and the follow-ups to expect
- A six-week plan and practice problems matched to those patterns
It is not:
- A list of leaked questions or a promise of what you will be asked
- An official description of Media.net's process
- An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.
Important things to know before you start
These are the Media.net-specific facts that should change how you prepare.
Coding surface. In 3 of the 4 reports that name a surface, interview code was written in a shared Google Doc over Google Meet. That means no autocomplete and no way to run code. The Web Developer track coded on paper in the office. Practise writing and dry-running code in a plain document.
CS fundamentals are asked inside coding rounds. 7 of the 11 records that describe technical interviews include OS, DBMS, networks, OOP or SQL questions in the same interview as the DSA problem. In one report, this block took the first 10 to 15 minutes. Binary tree vs sorted array came up in 3 records.
The OA is the main filter. The OA is usually 3 coding questions in 90 minutes, and all 3 reports that name a platform say InterviewBit. Post-OA shortlists in four reports were 8 to 11 students per campus. One 2023 candidate had to switch a recursive DP to an iterative one to pass time and memory limits.
Your projects are judged on depth. Project discussion appears in technical, design and final rounds. One SDE 1 candidate with strong DSA was told the projects lacked data structures used at scale, and was not called to HR.
Round-by-round breakdown
Candidates described five stages: application through a campus drive, shortlisting on the online assessment score, the online assessment itself, an interview loop of technical, design and final HR or hiring-manager rounds, and the decision.
Stage 1: Application, where candidates applied
Almost all of the evidence comes from on-campus drives at Indian engineering colleges. The drives hired for a 2-month summer SDE internship, a 6-month internship plus full-time offer, full-time SDE 1, and a separate Web Developer track. Only one report came from an experienced hire.
| Channel | What candidates said |
|---|---|
| Campus drive | 17 of the 18 records that name a channel came through campus. SDE drives were reported in mid-August (2023), the Web Developer drive in November (2023), and Codinzhub OA pages from the 2026 season are dated 5 to 19 October, with one NIT Silchar OA on 18 September. Colleges in the data include IIT Patna, IIT Delhi, IIT Roorkee, MNNIT Allahabad, LNMIIT Jaipur, NSUT, DTU and NIT Silchar. |
| Recruiter call (experienced hire) | One 2023 candidate, already working at a small product company, was scheduled after receiving a call. |
What helped. One SDE 1 candidate said Media.net asked for the resume and competitive-programming profile ratings before the coding contest, and that candidate listed contest ratings. Two candidates credited regular contest practice. No record mentions referrals.
Stage 2: Shortlisting, how candidates moved forward
For campus drives there was no recruiter screen and no questionnaire in the data. The online assessment (OA), a timed coding test, did the shortlisting. One 2023 drive described all five of its rounds, the OA included, as eliminatory.
- Resume and profile collection (one SDE 1 report, 2023). Before the OA, the candidate submitted a resume and competitive-programming ratings. How these were used was not reported.
- OA cut-off. Four 2023 and 2025 reports give shortlist sizes after the OA of 10, 11, about 10 and 8 students at their campuses. In the Web Developer drive, 19 of about 200 students moved on. One SDE 1 drive ran a plagiarism check on OA submissions. That candidate said many students solved 2 questions but only 8 were shortlisted.
- Cuts between interviews. The cuts continued during the interviews. In one 6-month intern plus full-time drive, 2 of 10 candidates passed the first interview. In an SDE 1 drive, 3 students were shortlisted after the first interview, and the candidate got a call for the next round 2 days later.
What candidates advised. One 2023 candidate said OA questions tend to recur and advised checking past questions. In the 2026 season, three OA problem names did repeat across colleges (see the OA section below).
Stage 3: Online assessment
Every SDE and intern drive in the data started with a coding OA. No record describes a phone screen. The Web Developer track used a different OA with multiple-choice questions (MCQs) as well as coding.
Online assessment
How it works. The usual format was 3 coding questions in 90 minutes. 12 of the 14 records that give a question count report 3 questions, 5 of the 6 that give a length report 90 minutes, and all 3 that name a platform say InterviewBit. Candidates rated the questions hard. One 2023 report called all three LeetCode-hard level. A 2025 intern report said question 1 was very easy and questions 2 and 3 were very hard, solved by only 10 to 15 students. Test-case visibility and AI-tool policy were not reported.
At a glance
- Length: 90 minutes (5 of 6 reports). One 2023 SDE report had 2 hours.
- Questions: 3 coding questions (12 of 14 reports). One 2023 SDE OA had 5 DSA questions (1 easy, 3 medium, 1 hard). The 2023 Web Developer OA had 25 MCQs on OS, DBMS, quantitative aptitude, logical reasoning, OOP and DSA, plus 2 coding questions.
- What was asked: Hard DSA. Candidates named DP with bitmasks, binary search on the answer, trees with a Fenwick tree, greedy, bit manipulation and segment trees.
- Most common: The matrix-conversion problem appeared at 3 named colleges in October 2026, plus one Codinzhub page that names no college. Red Zone appears in 3 records across 2023, 2025 and an undated IIT Roorkee OA. Two of those records name it directly, and the third lists it as a close match.
One 2023 candidate needed an iterative DP because recursion with memoisation hit time and memory limits. The 2025 intern report said the hard questions had tricky, lengthy implementations, and listed Remove K Digits, Count Good Triplets in an Array, Red Zone and Build Array Where You Can Find The Maximum Exactly K Comparisons as similar problems.
| Question | What it tests | Level |
|---|---|---|
| Omega Primes (dynamic programming with bitmasks) | DP over bitmasks | New grad |
| Fractional Knapsack: fewest coins (powers of 2) to fill a knapsack | Bit manipulation, greedy implementation | New grad |
| Stringoholics: minimum time when most rotating strings return to original | String periodicity and LCM arithmetic | New grad |
| For each tree node, count subtree nodes with a smaller value | DFS order plus a Fenwick (binary indexed) tree | New grad |
| Knapsack variant with tight memory limits | Knapsack DP with space limits | New grad |
OA questions shared on Codinzhub. These pages show only the title, college and OA date publicly. Where the technique is not visible, the topic is marked Not reported.
| Question | Drive | Topic |
|---|---|---|
| Allied Nations' Tour: count C-day tours avoiding attacked cities | MNNIT Allahabad and LNMIIT Jaipur, October 2026 | Counting DP |
| Matrix conversion (binary matrices): turn one matrix into another | LNMIIT Jaipur, IIT Delhi and MNNIT Allahabad, October 2026 | Not reported |
| Trapping rainwater (Rainwater Harvesting II) | IIT Patna and IIT Delhi, October 2026 | Not reported |
| Task allocation among three people (count assignments) | IIT Patna, 5 October 2026 | Not reported |
| Count valid array pairs over q queries | IIT Patna, 5 October 2026 | Not reported |
| Array Combinations XseRa | IIT Delhi, 6 October 2026 | Not reported |
| Permutation Balance | MNNIT Allahabad, 19 October 2026 | Not reported |
| Magic Number Array | LNMIIT Jaipur, 19 October 2026 | Not reported |
| Red Zone: first day a point lies within distance d of B orange zones | IIT Roorkee, date not shown; also named in 2023 and 2025 reports | Binary search on the answer |
| Box stacking: tallest stack of rectangular 3-D boxes | NIT Silchar, 18 September | Dynamic programming |
| Populate next-right pointers in a binary tree | NIT Silchar, 18 September | Trees |
| Minimum Squares: change array values | NIT Silchar, 18 September | Not reported |
| Recover a BST where two nodes were swapped | College not shown | BST |
| Guardians and the Shadows | College not shown | Graphs |
| Two Arrays | NSUT, date not shown | Not reported |
See all Media.net OA questions in the question bank.
Stage 4: The interview loop
After the OA, SDE campus candidates had 2 or 3 technical interviews (3 of 5 campus reports that describe the loop). Each had one main coding problem, and some opened with CS fundamentals. One 2023 drive then had a design-heavy round with a manager. Some drives ended with an HR or hiring-manager conversation. Technical interviews ran about 60 minutes (3 of 3 reports that give a length). They were on Google Meet, and 3 of the 4 reports that name a coding surface wrote code in a shared Google Doc, a plain text document with no compiler. The Web Developer round was in person, with code written on paper. The 2025 summer-intern loop was shorter: one technical interview and then a hiring-manager conversation.
What a 60-minute technical interview looks like
| Time | What candidates described | What to do |
|---|---|---|
| 0–5 min | Introductions; some interviewers asked about projects and tech stack | Have a 60-second summary of one project and the data structures it uses |
| 5–20 min | 10 to 15 minutes of OS, DBMS and networks questions in some rounds; one interviewer skipped this | Answer briefly and precisely, then stop |
| 20–50 min | One hard DSA problem with vague constraints; hints came after a long attempt | Ask about constraints, state a brute force, then improve it out loud |
| 50–60 min | Writing the code in the doc and a dry run on test cases | Write clean code fast and trace one example by hand |
One 2023 candidate needed about 45 minutes and a couple of hints to reach the solution, then coded it in 5 minutes. The candidate said this fast coding was a major factor in moving on.
Technical interviews: DSA plus CS fundamentals
At a glance
- Length: About 60 minutes (3 of 3 reports that give a length).
- Questions: 1 coding question plus a few CS fundamentals questions in the two SDE reports that describe the split. Some rounds had more: the Web Developer rounds had 3 DSA questions each.
- What was asked: A hard DSA problem plus OS, DBMS, networks, OOP and SQL questions (6 of 11 records).
- Most common: Binary tree vs sorted array (when a BST is the better choice) is the most repeated prompt, in 3 records. One candidate called it "the standard Media.net question".
One interviewer, described as friendly, still expected the candidate to find the solution without early hints. One intern described the interviewer as not very friendly. Another candidate's first answer was an O(N^3) brute force. The interviewer kept pushing for better: first O(N^2) with DP, then a top-down DP using sets, coded and dry-run in the doc. In one 2023 drive, the last interview, called the project round, was still a hard DSA problem. The candidate had not expected that.
Reported DSA problems
| Question | Follow-up | Level |
|---|---|---|
| Find the maximum length of a non-decreasing array after merging subarrays | Interviewer expected O(n^2) | New grad |
| Split a parenthesis string into two valid subsequences (count the ways) | Improve from O(n^3) to O(n^2) | New grad |
| Pick a pair of special nodes to link so the 1-to-N distance changes least | Not reported | New grad |
| Place an l x h rectangle to minimise overlap with K given rectangles | Not reported | New grad |
| All O'one data structure (inc, dec, max key, min key in O(1)) | Not reported | New grad |
| Word Break II | Not reported | New grad |
| For each query, find the subarray whose sum is closest to the query value | Not reported | Intern |
| Product of array except self (find the pattern from input and output only) | Not reported | Web Developer |
Reported CS fundamentals and SQL questions
| Question | Follow-up | Level |
|---|---|---|
| Binary tree vs sorted array (when is a BST the better choice?) | Why use a BST at all | New grad, intern |
| SQL: second-highest salary, then the Nth highest | Generalise to the Nth highest | New grad, intern |
| What is a semaphore? Then shared vs exclusive locks | Shared vs exclusive locks | New grad |
| Heap complexity, then the cost of building a heap from a sorted array | Not reported | New grad |
| Clustered vs unclustered index | Not reported | New grad |
| Explain DNS and the DNS lookup | Not reported | New grad, Web Developer |
| Polymorphism: method overloading vs overriding | Classes and objects | Intern, Web Developer |
| ACID properties of a database | Not reported | Intern |
The Web Developer track also asked Kadane's algorithm, climbing stairs, spiral matrix, trapping rain water, first and last position in a sorted array, cookies vs sessions, the TCP handshake, and an SQL query for the top-paid employee across two tables. All of them are in the question bank.
See all technical-interview questions in the question bank.
Design and projects round
At a glance
- Length: 60 minutes in the one report that gives a length (a manager with about 10 years of experience).
- Rounds: 1, after the technical interviews, in 2 of the 3 records that describe it. The third was an experienced hire's final round with the CTO.
- What was asked: Data-structure design (an LRU cache variant, a geo top-k store, an API call counter), project deep dives and networking.
- Most common: No design repeated.
This round was discussion-led. One candidate proposed approaches against the interviewer's changing requirements. Another reached a circular array of 300 slots for the call counter and felt the interviewer expected more. The same SDE 1 candidate was told at the end that their DSA and CS core were good, but their projects did not use data structures in large-scale applications. The candidate was not called to the HR round. No coding surface was reported for this round.
Reported designs.
- A variation of the LRU cache, discussed against given requirements (6-month intern plus full-time, 2023)
- Store rated geo-tagged articles, then return the top 10 inside a latitude-longitude rectangle (SDE 1, 2023)
- Design onNewReq() and getTotalCallsIn5Mins() for an API (SDE 1, 2023)
- What happens when you type www.google.com in a browser? (SDE 1, 2023)
- Design a chat application like WhatsApp (experienced hire, 2023)
- Walk through the search feature in one of your projects (6-month intern plus full-time, 2023)
Final HR or hiring-manager round
At a glance
- Length: 45 to 60 minutes (2 reports).
- Questions: Not reported as a count.
- Themes: General and situation-based HR questions, project and tech-stack discussion, and light technical checks.
Two reports describe this final round differently, so treat them as two versions of the same last step. In the 2023 6-month intern plus full-time drive, two university recruiters ran a 45-minute HR round with general and situation-based questions. The candidate got a selection call a few hours later. In the 2025 summer-intern drive, a hiring manager and a technical program manager ran an hour-long conversation. They also explained the company's vision and current work. Whether this round is scored on its own was not reported. Only 3 specific prompts were reported for it.
Reported questions.
- How do you feel about reaching this round? How has your day been?
- Walk us through your projects and the tech stack you used
- Short technical checks: HTTP, how an OS starts up, paging
See all HR and hiring-manager questions in the question bank.
Stage 5: Decision and offer
Decision. No record describes a hiring committee, team matching or a level change. Decisions came quickly after the last round. In the 2023 6-month intern plus full-time drive, the selection call came a few hours after the HR round. In the 2023 Web Developer drive, the placement office emailed the selection and offer letter within 1 day of the last round. For one SDE 1 candidate, not being called to the HR round after the manager round was how the rejection showed up.
Offer. Offer types in the data were a 2-month summer SDE internship, a 6-month internship plus full-time role, a full-time SDE 1 role, and a Web Developer role. Compensation was not reported in the records used for this guide, so it is left out.
Media.net experiences shared on Codinzhub
These are Media.net interview experiences that candidates posted on Codinzhub. Their full text is for Codinzhub members, so the table shows only what each public page summary says.
| College | Role and result | What was asked |
|---|---|---|
| MNNIT Allahabad | SDE 1, on campus, 2026 season; outcome not reported | Opened with an introduction, then questions; the rest is on the page |
| IIT Patna | SDE intern, on campus, 2026; outcome not reported | Question 1: when a binary search tree is the better choice; the rest is on the page |
| IIT Patna | SDE intern; year and outcome not reported | Not shown in the public summary |
The Codinzhub Next-Round Playbook
Candidates who moved on got as far as they could on every OA question, kept improving a working answer out loud in the interviews, and knew their CS fundamentals and projects well.
To get past the application
- Keep your resume and contest profiles current before the drive. One SDE 1 drive collected both before the OA.
To get past shortlisting
- Your OA score decides the shortlist. Reports give post-OA shortlists of 8 to 11 students per campus, so treat the OA as the main cut.
To get past the OA
- Submit your best attempt on every question. Two 2023-24 candidates who were shortlisted solved 2 questions fully and 1 partially. Two others were shortlisted after solving 1 fully and 1 partially.
- Read the long stories for the core task. Red Zone is binary search on the day, and Allied Nations' Tour is a counting DP over days.
- If a recursive DP times out or runs out of memory, rewrite it iteratively. One 2023 candidate had to.
- Write your own code. One drive ran a plagiarism check, and only 8 students were shortlisted even though many had solved 2 questions.
To get past the technical interviews
- Give crisp answers to the opening OS, DBMS and networks questions. In one report they took 10 to 15 minutes before the coding problem.
- Pin down vague constraints by dry-running small cases. One candidate had to do this before the problem made sense.
- Say a brute force, then improve it out loud. One interviewer pushed a candidate from O(N^3) to O(N^2) to a set-based DP.
- Once you have the idea, write it in the Google Doc quickly and cleanly. One candidate coded in 5 minutes after 45 minutes of hints and moved on.
To get past the design and projects round
- Treat it as data-structure design under changing requirements. Reported prompts were an LRU cache variant, a geo top-10 store and an API call counter.
- Know your project's data structures and how they scale. That was the named gap in the one rejection with feedback.
To get past the HR or hiring-manager round
- Prepare a clear walkthrough of your projects and tech stack. Both reports included project discussion.
- Expect light technical checks too. One 2025 intern was asked about HTTP, OS start-up and paging in this round.
To get through the decision
- Keep your phone close. One selection call came a few hours after HR, and one offer email came within 1 day of the last round.
How the loop differs by level
No campus report skipped the coding OA. After that, the number of interviews, the weight on CS fundamentals and the presence of a design round change by track. Most rows below rest on one to four reports, so read them as examples, not rules.
| Level | What candidates describe |
|---|---|
| SDE intern (2-month summer) | Based on three reports. In 2025: an OA (3 coding questions, 90 minutes, InterviewBit), one 1-hour technical interview, then a 1-hour conversation with a hiring manager and a technical program manager about projects, HTTP, OS start-up and paging. A 2023 intern interview mixed polymorphism, ACID, SQL (second and Nth highest salary), BST vs binary search, and one DSA problem on subarray sums closest to a query. No design round was reported. |
| 6-month intern plus full-time (SDE) | Based on two reports. In 2023: an OA of 3 hard questions in 90 minutes, two technical interviews (CS fundamentals, then one DSA problem), a design and projects round (an LRU cache variant and a project deep dive), and a 45-minute HR round. All five rounds were eliminatory. |
| Full-time SDE 1 | Based on four reports. An OA, then 2 or 3 interviews of about 60 minutes, each with one main coding problem (for example, maximum non-decreasing array length, linking special nodes to minimise a distance change, All O'one) plus OS, DBMS, networks and SQL. One 2023 drive added a 60-minute manager round with design prompts (a geo top-10 store, an API call counter) before HR. |
| Web Developer (campus) | Based on one 2023 report. An OA with 25 MCQs plus 2 coding questions, an in-office DSA and OOP round with paper coding (Kadane's algorithm, product of array except self, climbing stairs), then a round where the candidate chose Web over DB (spiral matrix, trapping rain water, cookies and sessions, TCP handshake, DNS lookup, SQL). No design round. |
| Experienced hire | Based on one 2023 report. Two easy-to-medium programming questions, a senior-engineer round with 2 DSA questions, 2 SQL queries, 1 MongoDB query and CS fundamentals, then a CTO round with cross-questioning on past work, 1 DSA problem and a WhatsApp-style chat application design. |
The intern track has only three reports, so this guide covers interns in the table above rather than in a separate guide.
Most-asked topics
The data has 22 records with OA or interview content. 11 of them are Codinzhub OA pages that show a title but not the technique, so the counts below are a floor, not a full picture. The clearest signal is that CS fundamentals (OS, DBMS, networks, OOP) sit next to hard DSA in the same interview.
| Topic | What it means | Seen in | Reported examples |
|---|---|---|---|
| Arrays, prefix sums, two pointers and binary search | Scanning arrays with running sums, two indices or halving the search range | 10 of 22 records | Maximum non-decreasing array length; subarray sum closest to a query; first and last position in a sorted array |
| Dynamic programming | Building an answer from answers to smaller subproblems | 7 of 22 records | Allied Nations' Tour; Omega Primes; Word Break II; parenthesis split into two valid strings |
| CS fundamentals (OS, DBMS, networks, OOP) | Theory questions on operating systems, databases, networking and object-oriented design | 5 of 22 records | Semaphores, then shared vs exclusive locks; clustered vs unclustered index; DNS lookup |
| Trees and BST reasoning | Recursive structures, and when a binary search tree beats a sorted array | 5 of 22 records | Binary tree vs sorted array; recover a swapped BST; count smaller values in each subtree |
| Data-structure design | Combining a hash map, linked list or ring buffer into a class with fast operations | 4 of 22 records | All O'one data structure; LRU cache variant; API call counter for the last 5 minutes |
| SQL | Writing queries with subqueries, joins and ranking | 4 of 22 records | Second-highest then Nth-highest salary; top-paid employee across two tables |
| Graphs and BFS | Nodes and edges, with breadth-first search for shortest unweighted paths | 3 of 22 records | Link two special nodes to minimise the 1-to-N distance change; populate next-right pointers |
The question patterns that keep coming back
The questions in the data group into seven patterns. Learn to spot the pattern under the story, because OA problems come wrapped in long stories (flat-earth red zones, allied nations, guardians of a data center).
1. Arrays, prefix sums, two pointers and binary search
This is the widest pattern in the data, at 10 of 22 records. It shows up as subarray questions, sorted-array lookups and "find the first day when..." problems. Choose the technique from the question: a "subarray sum" usually means prefix sums, and you add an ordered set when you need the closest sum to a target. "Sorted" or "first and last" means binary search. "Find the minimum day or value such that a condition holds" means binary search on the answer with a check function. One 2023 interview problem was based on two pointers and needed an O(n log n) solution.
Reported examples. Red Zone (binary search on the day, then a geometric check); for each query, the subarray whose sum is closest to it; maximum non-decreasing array length after merging subarrays; first and last position in O(log n); product of array except self; trapping rain water.
2. Dynamic programming
DP appears in 7 of 22 records, in both the OA and the interviews, and two OA write-ups describe a DP problem as the hardest one. Counting problems ("how many tours", "how many ways to split") point to DP over states. "Choose a subset of primes or features" with small limits points to bitmask DP. If a recursive DP gets time-limit or memory errors, convert it to an iterative table. One 2023 OA candidate had to do exactly that.
Reported examples. Allied Nations' Tour (count C-day tours that avoid attacked cities); Omega Primes (DP with bitmasks); a knapsack variant with tight memory limits; Word Break II; split a parenthesis string into two valid subsequences, then improve from O(n^3) to O(n^2).
3. CS fundamentals inside the coding interview
This is the most Media.net-specific pattern. 7 of the 11 records that describe technical interviews include OS, DBMS, networks, OOP or SQL questions in the same round as the coding problem, and specific OS, DBMS, networks or OOP prompts are reported in 5 of 22 records. One report put this block at the first 10 to 15 minutes. Answer with a definition, one trade-off and one real use. For "compare X and Y" questions, name the operation where each one wins.
Reported examples. What is a semaphore, then shared vs exclusive locks; heap complexity, then the cost of building a heap from a sorted array; clustered vs unclustered index; ACID properties; types of SQL joins; explain DNS and the DNS lookup; what happens when you type www.google.com.
4. Trees and BST reasoning
Trees appear in 5 of 22 records. The most repeated interview prompt in the data, binary tree vs sorted array, belongs here: it came up in 3 records. The answer turns on updates. A sorted array gives O(log n) search, but inserting or deleting costs O(n). A balanced BST keeps every operation at O(log n). For tree coding problems, decide what each node returns to its parent. When a problem asks for counts over a subtree, flatten the tree with DFS order and use a Fenwick tree.
Reported examples. Binary tree vs sorted array (when is a BST the better choice?); for each tree node, count subtree nodes with a smaller value; recover a BST where two nodes were swapped; populate next-right pointers in a binary tree.
5. Data-structure design
This pattern appears in 4 of 22 records, in late interviews and the design round. The prompt is a small class with fast operations. Pair a hash map, for O(1) lookup, with an ordered structure such as a doubly linked list, buckets or a ring buffer for order. Expect the requirements to change partway through.
Reported examples. All O'one data structure (inc, dec, max key, min key in O(1)); a variation of the LRU cache; onNewReq() and getTotalCallsIn5Mins() for an API; store rated geo-tagged articles and return the top 10 inside a rectangle.
6. SQL queries
SQL appears in 4 of 22 records, asked in the interview itself. For "Nth highest", use a subquery with DISTINCT and LIMIT/OFFSET, or a ranking window function. When data is split across tables, join on the key first.
Reported examples. Second-highest salary using a subquery, then the Nth highest; the employee with the maximum salary across (Emp_id, Emp_name) and (Emp_id, salary) tables; an experienced hire's round with 2 SQL queries and 1 MongoDB query.
7. Graphs and BFS
Graphs appear in 3 of 22 records. In an unweighted graph, use BFS for shortest distances. When a question asks how adding one edge changes a path, run BFS from both endpoints and combine the two distance arrays. Level-by-level tree problems are BFS in disguise.
Reported examples. Pick a pair of special nodes to link so the 1-to-N distance changes least; populate next-right pointers in a binary tree; Guardians and the Shadows (a data-center graph, full statement on Codinzhub).
Preparing for the HR or hiring-manager round
The last round in the data was an HR round or a hiring-manager conversation (see Stage 4). Its prompts are mostly about you and your projects. In the design round, too, the interviewer judged your projects. One SDE 1 candidate with strong DSA was told the projects did not show data structures used at scale, and was not called to HR.
Build your project and story bank. Prepare two projects you can explain in depth, plus four to six short, real stories, each under two minutes. Cover the themes candidates were asked about:
| Theme | Reported prompt (paraphrased) | Follow-up to expect |
|---|---|---|
| Rapport and motivation | How do you feel about reaching this round? How has your day been? | Not reported |
| Projects and stack | Walk us through your projects and the tech stack you used | Short technical checks on HTTP, OS start-up and paging |
| Project depth | Walk through the search feature in one of your projects | A 5 to 10 minute deep dive on how it works |
| Past work (experienced hire) | Cross-questioning on previous experience and work for about 15 minutes | Then 1 DSA problem and a system design |
| Situations | General and situation-based HR questions (exact prompts not reported) | Not reported |
Structure each story. Use STAR (situation, task, action, result): one line of situation, what you did, a result with a number, and what you would change. Say "I" for your own actions, and use only real experiences.
Expect depth on projects. Be ready to explain the data structures your project uses, why you chose them, and how they behave as data grows. That is the gap the interviewer named in the one rejection with feedback. The 2025 intern conversation also tested HTTP, OS start-up and paging, so revise those basics before this round, not just HR answers.
A six-week plan
This plan follows the patterns above, most frequent first. It ends with timed mocks that match the real rounds: a 90-minute, 3-question OA and 60-minute interviews in a plain doc. Plan on two to three focused hours a day.
- Week 1: Arrays, prefix sums, two pointers and binary search. Cover prefix sums with ordered search, two pointers, binary search bounds, and binary search on the answer with a check function. Habit: write the complexity for every solution before you code.
- Week 2: Dynamic programming. Cover counting DP over days or positions, knapsack variants with memory limits, bitmask DP, and string DP such as word break. Habit: write every DP both recursively and iteratively, because one OA needed the iterative version.
- Week 3: Trees, BST reasoning and CS fundamentals (OS and DBMS). Cover subtree queries with DFS order and a Fenwick tree, BST properties, and level-order traversal. In parallel, revise semaphores and locks, heaps, indexing, ACID, joins and RAID. Habit: answer each theory question in three lines: a definition, a trade-off and a use.
- Week 4: Data-structure design, SQL and networks. Cover a hash map plus a linked list (LRU cache and All O'one style), ring-buffer counters, and top-k stores. Write second-highest and Nth-highest salary queries and two-table joins. Revise DNS, TCP handshake, cookies and sessions, and what happens when you type a URL. Habit: after each design, add one new requirement and adapt your class.
- Week 5: Graphs, BFS and bit manipulation. Cover BFS distances from two endpoints, adding one edge to a graph, and bit tricks with powers of 2. Habit: draw the graph before writing code.
- Week 6: Mocks. Do two timed 90-minute OAs with 3 hard problems each, and three timed 60-minute interview mocks in a plain Google Doc with no compiler. Open each interview mock with 10 minutes of OS, DBMS and networks questions, and ask for at least one follow-up. Rehearse your project walkthrough out loud.
Interns can go lighter on design in week 4, because no intern report had a design round. Full-time and 6-month intern plus full-time candidates should keep week 4 in full: a design round appeared in two of their drives.
Only two weeks? Spend 4 days on arrays and binary search, 3 on DP, 3 on trees and CS fundamentals, 2 on data-structure design and SQL, and 2 on a timed OA mock plus interview mocks in a doc.
Practice problems that match these experiences
These are practice problems that match the patterns above. They are not claims about Media.net's question bank unless a row says the problem was asked as-is. The CS fundamentals pattern has no single practice problem, so revise it from your OS, DBMS and networks notes instead.
| # | Practice problem | Pattern | Seen in these experiences as |
|---|---|---|---|
| 1 | Red Zone | Binary search on the answer | Asked as-is: named in a 2023 OA report and an IIT Roorkee OA, and listed as a close match in a 2025 intern OA |
| 2 | Allied Nations' Tour | Counting DP over days | Asked as-is in 2026 OAs at MNNIT Allahabad and LNMIIT Jaipur |
| 3 | Find Maximum Non-decreasing Array Length | DP with prefix sums | Asked as-is in a 2023 SDE 1 interview (O(n^2) was enough) |
| 4 | Word Break II | String DP and backtracking | Asked as-is in a 2023 SDE technical interview |
| 5 | Find First and Last Position of Element in Sorted Array | Binary search bounds | Asked as-is in a 2023 Web Developer round |
| 6 | Count of Smaller Numbers After Self | Fenwick tree counting | Count subtree nodes with a smaller value (OA, with DFS order) |
| 7 | Recover Binary Search Tree | BST in-order property | Asked as-is on a Media.net OA page on Codinzhub |
| 8 | All O`one Data Structure | Hash map plus linked list of buckets | A final-round problem the candidate likened to this one |
| 9 | LRU Cache | Hash map plus doubly linked list | A variation of the LRU cache in the design round |
| 10 | Number of Recent Calls | Sliding-window counter | onNewReq() and getTotalCallsIn5Mins() design |
| 11 | Second Highest Salary | SQL subquery and ranking | Second-highest salary, then the Nth highest |
| 12 | Populating Next Right Pointers in Each Node II | Level-order traversal (BFS) | Populate next-right pointers in a binary tree (NIT Silchar OA) |
How to handle a question you have never seen
Each Media.net technical interview in the data centred on one hard, unfamiliar problem, sometimes with vague constraints. A repeatable method matters more than memorised solutions.
- Repeat the problem and one example. Type the example into the shared Google Doc so you and the interviewer agree on it. One candidate had to dry-run cases just to pin down constraints the interviewer left vague.
- Say the brute force and its complexity. It sets a baseline. Interviewers in the data pushed from there, for example from O(N^3) to O(N^2) and then further.
- Name the bottleneck. Repeated lookups suggest a hash map. Repeated range sums suggest prefix sums. A "first day or minimum value such that" question suggests binary search on the answer. Counting ways suggests DP.
- Say when you are stuck. Hints were given. One selected candidate took a couple of hints over about 45 minutes and still moved on, though another interviewer expected progress without early hints.
- Code in small pieces while talking. The doc has no compiler, so write small helper functions with clear names and keep the indexing simple.
- Dry-run one case and fix the wrong line. Trace your example by hand in the doc. Leave the last 5 to 10 minutes of the hour for this, as in the pacing table above.
Common preparation mistakes
Only three rejected reports are in the data, and two of them give a reason. So read this section as lessons drawn from a small number of reports, not as Media.net's stated criteria.
- Projects that do not show data structures at scale. The interviewer told one 2023 SDE 1 candidate that their DSA and CS core were good, but their projects did not use data structures in large-scale applications. The candidate was not called to HR.
- Not reaching the optimal approach in time. One 2023 candidate felt they lost the final round because they could not find the optimal approach to an All O'one-style problem in time. They had also not expected DSA in a round labelled as a project round.
- Gaps in CS fundamentals. One SDE 1 candidate could not answer the cost of building a heap from a sorted array, and forgot the term semaphore while describing its properties. That candidate still passed that interview. A 2023 candidate who was not selected after the technical interview advised brushing up CS fundamentals.
- Needing hints. The reports disagree here. One selected candidate needed about 45 minutes and a couple of hints, then coded quickly and moved on. Another interviewer expected the solution without early hints.
- Stopping at a slow solution. Interviewers pushed past the first working answer. One candidate's O(N^3) answer was pushed to O(N^2) and then to a top-down DP with sets. Another interviewer wanted O(n^2) for a problem with faster known solutions, and the candidate got there.
Selected vs. rejected: do this, not that
No selected candidate described a perfect interview. A few habits came up in the successful reports, and the rejected reports show what was missing.
| Do this | Not that | What the reports show |
|---|---|---|
| Start rough, then improve: state a brute force, code it if time is short, then optimise out loud | Waiting for the perfect idea: staying silent until you have the optimal approach | One candidate went from O(N^3) to O(N^2) to a set-based DP and got positive feedback. A rejected candidate advised coding a less-optimised solution first. |
| Code fast once you have it: write the agreed solution cleanly in a few minutes | Slow, messy transcription: losing the time the hints bought you | One selected candidate needed hints for 45 minutes, coded in 5, and called that a major factor. |
| Practise in a plain doc: write and dry-run code without an IDE | Relying on autocomplete and a run button: first meeting a blank doc in the interview | 3 of 4 reports that name a surface coded in a shared Google Doc. One advised practising there. |
| Keep talking: think aloud and use the interviewer's prompts | Coding in silence: missing hints the interviewer is offering | One selected Web Developer candidate said interviewers helped and sometimes solved along with them. |
| Own your project's internals: know the data structures and why they scale | Listing features only: describing what the project does but not how | One SDE 1 candidate was told their projects lacked data structures at scale, and was not called to HR. |
If you remember only five things
- The process is campus-first and filter-heavy. A hard coding OA, usually 3 questions in 90 minutes, left 8 to 11 students per campus for interviews in four reports.
- Each technical interview is one main problem plus CS fundamentals. It runs about 60 minutes, with OS, DBMS, networks or SQL questions next to the DSA problem.
- Start rough, then improve out loud. Interviewers pushed past the first working answer, and coding the agreed solution fast helped one candidate move on.
- The core topics are arrays with binary search, DP, trees, data-structure design and CS fundamentals. Binary tree vs sorted array is the most repeated interview prompt.
- Practise in a plain Google Doc, and know your projects deeply. No reported interview let you run code, and project depth was the named gap in the one rejection with feedback.
FAQ
Is there always an online assessment?
For campus drives in the data, yes. No campus record describes interviews without an OA first. The one experienced hire started with 2 programming questions instead.
Do I need dynamic programming?
Yes. DP appears in 7 of 22 records, in both the OA (bitmask DP, knapsack variants, counting tours) and interviews (Word Break II, maximum non-decreasing array length).
Is system design asked?
In some drives. Two 2023 campus drives (6-month intern plus full-time, and SDE 1) had a design round built around data-structure design: an LRU cache variant, a geo top-10 store and an API call counter. The one experienced hire was asked to design a chat application. No intern report had a design round.
How long does it take?
End-to-end timelines were not reported. Within a drive, things moved fast: one candidate was called for the next round 2 days after an interview, one selection call came a few hours after HR, and one offer email came within 1 day of the last round.
Will the interviewer help me?
Sometimes. One selected candidate got a couple of hints over about 45 minutes, and a Web Developer candidate said interviewers sometimes solved along with them. Another interviewer expected the solution without early hints.
Is it virtual or in person?
Both appear. SDE technical interviews in the data ran on Google Meet with a shared Google Doc. The 2023 Web Developer interviews were held at the company's office with paper coding.
How much do CS fundamentals matter?
A lot. 7 of the 11 records that describe technical interviews include OS, DBMS, networks, OOP or SQL questions alongside the coding problem. One candidate who was not selected advised brushing up CS fundamentals.
About this guide
The Codinzhub team researched and wrote this guide from 22 records of Media.net software engineer interviews from 2023 to 2026, including experiences and OA questions shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems unless marked as asked as-is. If you interviewed recently, share your experience on Codinzhub and we will update this guide.
Disclaimer. Media.net's process changes by role, year and college. Use this guide to build a foundation, and confirm the current format with your placement cell or 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 104 questions
Allied Nations' Tour: count C-day tours avoiding attacked cities
A Media Net online assessment question shared on Codinzhub (MNNIT Allahabad and LNMIIT Jaipur, October 2026).
Matrix conversion (binary matrices): turn one matrix into another
A Media Net online assessment question shared on Codinzhub (LNMIIT Jaipur, IIT Delhi and MNNIT Allahabad, October 2026).
Trapping rainwater (Rainwater Harvesting II)
A Media Net online assessment question shared on Codinzhub (IIT Patna and IIT Delhi, October 2026).
Task allocation among three people (count assignments)
A Media Net online assessment question shared on Codinzhub (IIT Patna, 5 October 2026).
Count valid array pairs over q queries
A Media Net online assessment question shared on Codinzhub (IIT Patna, 5 October 2026).
Array Combinations XseRa
A Media Net online assessment question shared on Codinzhub (IIT Delhi, 6 October 2026).
Permutation Balance
A Media Net online assessment question shared on Codinzhub (MNNIT Allahabad, 19 October 2026).
Magic Number Array
A Media Net online assessment question shared on Codinzhub (LNMIIT Jaipur, 19 October 2026).
Red Zone: first day a point lies within distance d of B orange zones
A Media Net online assessment question shared on Codinzhub (IIT Roorkee, date not shown; also named in 2023 and 2025 reports).
Box stacking: tallest stack of rectangular 3-D boxes
A Media Net online assessment question shared on Codinzhub (NIT Silchar, 18 September).
Populate next-right pointers in a binary tree
A Media Net online assessment question shared on Codinzhub (NIT Silchar, 18 September).
Minimum Squares: change array values
A Media Net online assessment question shared on Codinzhub (NIT Silchar, 18 September).
Recover a BST where two nodes were swapped
A Media Net online assessment question shared on Codinzhub (College not shown).
Guardians and the Shadows
A Media Net online assessment question shared on Codinzhub (College not shown).
Two Arrays
A Media Net online assessment question shared on Codinzhub (NSUT, date not shown).
13
A Media Net online assessment question shared on Codinzhub (MNNIT Allahabad OA (2026-10-19).
14
A Media Net online assessment question shared on Codinzhub (IIT Jaipur OA (2026-10-19).
15
A Media Net online assessment question shared on Codinzhub.
19
A Media Net online assessment question shared on Codinzhub (NIT Silchar... Arrays Online assessment Not reported Not reported Coding Practice (exact).
20
A Media Net online assessment question shared on Codinzhub (NSUT).
Keep preparing on Codinzhub
- Media.net interview questions and experiences — OA questions and interview experiences candidates shared for Media.net.
- Browse Media.net online assessment questions — filter the Codinzhub question bank by company.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- Adobe Software Engineer interview guide — the Adobe process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.