Interview experience
BYJU’S interview experiences covering Online Assessment (HackerEarth), Technical Round 1, Technical Round 2, HR / managerial. Round-wise notes, common questions, and what candidates report clears each stage.
BYJU'S Interview Questions and Answers (2026)
BYJU'S is a major Indian ed-tech company offering digital learning programs for school and competitive exam preparation. Its technology teams have historically hired for product engineering, content platforms, and learning experience roles supporting apps used by millions of students.
HQ: Bengaluru, India
Employees: Variable (restructuring era)
Revenue: Ed-tech (private)
Website: byjus.com ↗
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
BYJU’S runs a compact 3-stage SDE loop, but the differentiator is Technical Round 2 - a combined system-design-and-OS-fundamentals session that runs far deeper than a typical closing technical round.
HR interview questions
BYJU’S HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
BYJU’S interview process at a glance
| Round | Duration | What it tests |
|---|---|---|
| Online Assessment (HackerEarth) | 60-90 min | OS/DBMS/pseudocode MCQs + 2 medium coding problems |
| Technical Round 1 | 45-60 min | DSA (arrays, strings, palindrome/difference-style problems) |
| Technical Round 2 | 60-90 min | System design (e.g. elevator system) + deep OS fundamentals |
| HR / managerial | 20-30 min | Communication, product mindset, fit |
BYJU’S online assessment: quick answers
These answers are compiled from public candidate reports and prep guides, not from an official BYJU’S notice, and drives differ. Hiring volumes have been uneven since 2023, so confirm the opening is live, and treat the instruction screen of your own test as the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | For SDE roles, about 20 MCQs on OS, DBMS and pseudocode plus 2 coding problems; a 2022 campus report describes one easy and one very hard problem. The 60-90 minute duration comes from older reports and is not confirmed recently. One intern report describes the coding test coming after a first interview, split into DSA, software design and debugging sections. |
| Does it have negative marking? | No public report mentions any. |
| Is there a sectional cutoff? | Not reported. Fully passing coding solutions count for more than attempting every MCQ. |
| How much is the cutoff? | Not published. Reports conflict on eligibility: candidate reports cite 6.5+ CGPA or 65% with no active backlogs, while PrepInsta’s 2023 campus notice lists 60% throughout 10th, 12th and graduation for B.Tech, M.Tech and MCA. |
| Which platform is it on? | Not confirmed recently. Older reports name HackerEarth; 2022-2024 reports describe an online coding assessment without naming the platform. |
| Is there a test for sales (BDA) roles? | Usually not a coding test. BDA reports describe a group discussion and a personal interview; some off-campus flows add an aptitude section. |
| Is BYJU’S still hiring? | In small and uneven numbers. Parent Think & Learn has been in insolvency proceedings since July 2024, and as of July 2026 the buyer search was paused while creditors considered a BCCI settlement, so check that the role is live before a long preparation sprint. |
BYJU’S interview questions by role
These topics come from GfG BYJU’S interview experiences and the candidate reports summarised in the round notes on this page. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| SDE (campus) | OA with OS, DBMS and pseudocode MCQs and 2 coding problems; Tech 1: next higher palindrome with the same digits, maximum difference where the larger element comes later; Tech 2: elevator system design, thrashing, deadlock, semaphores vs mutexes, virtual memory. A 2022 campus report adds a project deep-dive and subset sum. |
| Software engineer (2024 reports) | A coding assessment, then an interview with a senior developer and one with a tech lead; mostly DSA and DBMS questions, with no language restriction. |
| Software engineer intern | A first interview with a senior engineer on languages, development methods, databases and a difficult technical challenge; then an online test in DSA, software design and debugging; then technical and leadership interviews. |
| Business development associate (sales) | A group discussion, then a personal interview: your background, why your marks dipped, your achievements, what you know about BYJU’S and why you want to join. Older reports add a GD on whether India should go cashless, “sell me a pen” and the difference between marketing and sales. |
| Teaching roles (one report) | An online reasoning and puzzle test, a hiring-manager video interview with a mock lesson on a topic you choose, and a group interview with the team. |
Asked across every role: why BYJU’S, and how you would explain a concept to someone who is struggling with it.
Online Assessment
Hosted on HackerEarth: roughly 20 MCQs spanning operating systems, DBMS, and pseudocode-reading, plus 2 coding problems at medium difficulty. Clean, fully-passing solutions matter more than attempting every MCQ.
Common questions
- OS MCQs on process states, scheduling, and memory management
- DBMS MCQs on normalization and query behaviour
- Pseudocode-tracing questions (predict the output/complexity)
- Two medium-difficulty coding problems (arrays/strings - hashing, Two Sum/anagram patterns reported on recent drives)
- Aptitude sections on some off-campus D2C Recruitables flows (confirm your invite mail)
Technical Round 1
A DSA-focused round, often conducted on-campus with two interviewers present. Expect 4-5 problems building from a warm-up to something requiring a real approach discussion, not just working code.
Common questions
- Find the next higher palindromic number using the same set of digits
- Maximum difference between two elements such that the larger element appears after the smaller one
- Array/string manipulation problems with follow-up complexity questions
- Basic project walkthrough between coding problems
Technical Round 2
The differentiator in BYJU’S’s loop - a long (60-90 minute) session mixing a system-design prompt with genuinely deep OS questioning, closer to what other companies reserve for senior hires.
Common questions
- Design an elevator system - state model, request queue, edge cases
- Explain thrashing and how it differs from normal page faulting
- Walk through deadlock conditions and one prevention strategy
- Explain semaphores vs mutexes with a concrete example
- What is virtual memory and how does paging implement it
Round-by-round narratives are on the BYJU’S interview experience page.
HR / managerial round
A closing conversation on communication and product mindset - BYJU’S interviewers commonly ask candidates to explain a technical concept simply, reflecting the company’s core teaching-product DNA.
Common questions
- Tell me about yourself and why BYJU’S
- Explain a concept you understand well to someone struggling to grasp it
- Tell me about a time you had to persuade a skeptical customer, parent, or peer
- Are you comfortable with the current pace of change at the company
- SDLC basics and how you ensure code quality under deadline pressure (reported on Unstop/PrepBytes SDE HR lists)
- Willingness to join a specific business unit if product lines reorganise
Sample answer frameworks for each of these are on the BYJU’S HR interview questions page.
BYJU’S tech (SDE) hiring vs BDA sales hiring
Most public BYJU’S interview reports are for business development associate (BDA) sales roles, not engineering. BDA hiring usually runs a group discussion and a personal interview, sometimes with role-plays, and focuses on communication, motivation and why you want the job.
SDE hiring is a separate loop: an online test with MCQs and coding, a DSA round, a design-plus-OS round, and HR. This page covers the SDE loop. If your invite is for BDA, prepare for the group discussion and interview instead of coding, and check the role title on the offer carefully.
A note on BYJU’S’s current business situation
BYJU’S parent Think & Learn has been in insolvency proceedings since July 2024, triggered by a BCCI default case. A resolution professional ran an Expressions-of-Interest process for a buyer through 2025, with bidder deadlines repeatedly extended, and as of July 2026 the tribunal had paused the buyer search while creditors weighed a proposed BCCI settlement. The company cut more than 10,000 jobs across 2023-2025 as part of its restructuring. None of this changes the interview format described above, but it’s worth factoring into your decision - ask the interviewer directly about team stability, reporting structure, and which business unit you’d actually join, rather than assuming steady-state hiring.
Common question clusters (with frameworks)
Most public prep material covers BDA sales role-plays; SDE tracks still exist. Confirm your track before grinding the wrong cluster.
1. Hiring-status sanity check
Framework: Confirm a live opening before a long prep sprint. Volumes have been uneven post-restructuring eras.
2. SDE path: OA + DSA + ed-tech product sense
Framework: Medium DSA, OOP, SQL, then content/progress/recommendation sketches at fresher depth.
3. BDA path: objection handling
Framework: Need analysis before features. Handle price, tuition, and screen-time objections with value, not argument.
4. Integrity and sustainability questions
Framework: Honest answers on targets, travel, and why ed-tech now. Avoid pretending you ignore public business news; stay factual and role-focused.
Common technical interview questions and answers
Q: Find the next higher palindromic number using the same set of digits
Because the digit multiset is fixed, only a palindrome’s left half is free - so work on the first half of the number. Take the left half (including the middle digit for odd lengths), apply the standard next-permutation algorithm to it, and mirror the result onto the right half. If next-permutation on the left half fails (it is already the highest arrangement), no larger palindrome exists with those digits. Next-permutation is O(n) and the mirroring is O(n), so the whole solution is O(n) time and O(1) extra space for an n-digit number.
Q: Maximum difference between two elements where the larger appears after the smaller
Scan the array once keeping a running minimum of everything seen so far. At each index i compute arr[i] - minSoFar and keep the best value found, then update minSoFar = min(minSoFar, arr[i]). This guarantees the smaller element always comes first because minSoFar only ever holds values at indices before i. It runs in O(n) time and O(1) space, versus O(n^2) for the naive double loop, and it is the same one-pass idea as the best-time-to-buy-and-sell-stock problem.
Q: What is thrashing and how does it differ from normal page faulting?
A normal page fault is expected - the process touches a page that is not resident, the OS loads it from disk, and useful work continues. Thrashing is the pathological case where the resident set is smaller than the working set, so almost every memory reference faults and the CPU spends nearly all its time swapping instead of executing instructions. The classic trigger is over-multiprogramming: the scheduler sees low CPU utilisation, admits more processes, each gets fewer frames, and faulting gets worse in a feedback loop. Fixes are the working-set model or page-fault-frequency control, which suspend or swap out processes until each remaining one holds enough frames.
Q: What are the four conditions for deadlock and one prevention strategy?
Deadlock requires all four Coffman conditions to hold at once: mutual exclusion, hold-and-wait, no preemption, and circular wait. Prevention works by structurally denying any one of them. The most practical strategy is breaking circular wait by imposing a global total ordering on resources - every process must acquire locks in increasing order of that ranking, which makes a cycle impossible because a cycle would require some process to hold a higher-ranked lock while requesting a lower-ranked one. Alternatives are all-or-nothing allocation (denies hold-and-wait) or allowing rollback and resource preemption.
Q: Explain semaphores versus mutexes with a concrete example
A mutex is a locking mechanism with ownership - only the thread that locked it may unlock it, and it protects a critical section for exactly one thread at a time. A semaphore is a signalling mechanism holding an integer count, with wait/P decrementing and signal/V incrementing, and any thread may signal it. Concretely, use a mutex to guard updates to a shared counter; use a counting semaphore initialised to 5 to cap concurrent access to a five-connection database pool. In the producer-consumer problem you need both: two counting semaphores for empty and full slots plus a mutex to protect the buffer itself.
Q: What is virtual memory and how does paging implement it?
Virtual memory gives each process its own contiguous address space that is larger than the physical RAM available, with the OS and MMU translating virtual addresses to physical frames on the fly. Paging implements it by splitting the virtual space into fixed-size pages (commonly 4 KB) and physical memory into equal-sized frames, with a per-process page table mapping page numbers to frame numbers plus valid, dirty and permission bits. A virtual address splits into a page number (the page-table index) and an offset within the page. Because a page-table lookup would double every memory access, the TLB caches recent translations, and a miss on the valid bit raises a page fault that the OS services from disk.
Q: How would you design an elevator system?
Model it as a set of Elevator objects each holding current floor, direction (UP, DOWN, IDLE) and two sorted request sets, plus a central ElevatorController that dispatches external hall calls. The core scheduling policy is SCAN, or LOOK: an elevator moving up serves all pending up-requests above it in increasing floor order before reversing, which prevents starvation and beats naive FCFS on average wait time. Internal requests from the car panel go into that elevator’s own set; external hall calls go to the controller, which picks the elevator with the lowest estimated cost - typically one already moving toward the caller in the same direction. Call out the edge cases explicitly: door sensors, overload, emergency stop, and the idle-parking policy of what a free car does when there are no requests.
Q: What is database normalization and why does 3NF matter?
Normalization decomposes tables to eliminate redundancy and the update, insert and delete anomalies it causes. 1NF requires atomic column values, 2NF additionally forbids partial dependency of a non-key attribute on part of a composite primary key, and 3NF forbids transitive dependency where a non-key attribute depends on another non-key attribute. For example, storing student_id, dept_id and dept_name in one table violates 3NF because dept_name depends on dept_id, not on student_id - so renaming a department means updating every student row. Splitting departments into their own table fixes it; the tradeoff is that heavy normalization adds joins, which is why read-heavy analytics systems often denormalize deliberately.
Q: Two Sum or valid anagram using hashing
For Two Sum, store each value and its index in a hash map as you scan. At index i, check whether target - arr[i] is already in the map; if yes, return the pair. Each lookup is O(1) average, so the whole pass is O(n) time and O(n) space. Valid anagram is the same idea on character counts: increment counts for string A, decrement for B, or sort both strings and compare - sorting is O(n log n), counting is O(n) with a 26-letter array for lowercase English. In BYJU’S OA and Round 1, interviewers often ask you to state complexity and handle duplicates explicitly.
Q: Level-order (BFS) traversal of a binary tree
Use a queue: enqueue the root, then while the queue is not empty, dequeue a node, append its value to the current level output, enqueue left then right children. For level-separated output, track queue size at the start of each level and process exactly that many nodes before starting the next level. Time O(n), space O(w) where w is maximum width. Campus and off-campus SWE reports cite BFS alongside graph DFS in hiring-manager rounds - practice writing it without library helpers.
Q: What is the SDLC and which models do teams use?
The Software Development Life Cycle spans requirement analysis, design, implementation, testing, deployment, and maintenance. Common models: Waterfall (sequential, heavy upfront spec), Agile/Scrum (iterative sprints with retros), and V-Model (each dev phase paired with a test phase). Ed-tech teams often run Agile with hard content-release deadlines tied to exam calendars - so “Agile” still has fixed external milestones. HR and technical screens may ask you to name phases and say which model your college project followed.
Q: Design a simple student progress tracker (OOP warm-up)
Core classes: Student (id, name), Course (id, syllabus modules), Enrollment (student, course, percentComplete, lastActiveAt), and ProgressService with methods markLessonComplete, getCompletionReport, and getAtRiskStudents (inactive > N days). Persist enrollments in a database; keep business rules (cannot skip locked modules) in the service layer, not the UI. Mention idempotency if the same lesson-complete event can arrive twice from mobile offline sync - a realistic ed-tech edge case.
Q: Many-to-many students and courses - data structure design
Normalize into three relations: students, courses, and enrollments(student_id, course_id, enrolled_at) with a composite primary key on the pair. For fast “list all courses for student S” queries, index enrollments(student_id); for “all students in course C”, index course_id. In memory, adjacency lists or hash maps from studentId → set of courseIds work for interview-scale data. Backend SSE reports explicitly ask for PK/FK explanation when you propose this schema.
Q: Rotated sorted array - find two elements with sum k
After rotation, the array is two sorted segments. Either use a hash map in O(n) time like standard Two Sum, or exploit sorted structure: for each element, binary-search for k - arr[i] in O(log n), giving O(n log n) without extra space. State which approach you pick and why - interviewers on rotated-array variants often want both. Watch index bounds when the pair wraps across the rotation point.
Q: Race condition vs starvation (OS follow-ups)
A race condition is incorrect behaviour when two threads interleave on shared mutable state without synchronisation - the outcome depends on scheduling luck. Starvation is when a thread never acquires a resource because others always win the scheduler or lock queue. Fix races with mutexes, atomic operations, or immutability; fix starvation with fair locks, priority caps, or aging in the scheduler. MTS campus reports cite both terms after project discussion - tie answers to a real bug you fixed or simulated.
Frequently asked questions about BYJU’S interviews
Does the BYJU’S online assessment have negative marking?
No public report mentions negative marking. A 2022 campus report describes the BYJU’S SDE test as about 20 MCQs on OS and DBMS plus 2 coding problems (one easy, one hard), and 2024 reports describe a DSA and DBMS coding assessment; none describes deductions for wrong answers. The platform is not named in recent reports.
Is there an online test for BYJU’S BDA (sales) roles?
Usually not. Public BDA reports describe a group discussion (one minute to think, then 10-15 minutes of discussion) followed by a personal interview on your background, marks, achievements and why BYJU’S. The coding OA is only for technology roles.
What is the BYJU’S interview process for freshers?
BYJU’S SDE process usually runs 3 stages: 1. Online Assessment (60-90 min; older reports name HackerEarth) - around 20 MCQs on OS, DBMS, and pseudocode, plus 2 medium-difficulty coding problems. 2. Technical Round 1 (45-60 min) - 4-5 DSA problems, often on-campus with two interviewers. 3. Technical Round 2 (60-90 min) - system design (candidates report being asked to design an elevator system) plus OS fundamentals like thrashing, deadlock, semaphores, and virtual memory. An HR/managerial round on fit and logistics closes the loop. Total timeline is roughly 2-4 weeks for campus drives.
What questions are asked in BYJU’S interviews?
The OA mixes OS/DBMS/pseudocode MCQs with 2 medium DSA problems. Technical Round 1 stays DSA-heavy (array/string problems like next higher palindromic number or maximum difference between two elements). Technical Round 2 is the differentiator - a full system-design discussion (elevator system is a reported prompt) combined with deep OS questioning (thrashing, deadlock, semaphores, virtual memory) rather than a light wrap-up round.
How many rounds are there in the BYJU’S interview?
Typically 3 stages for SDE roles: an online assessment, one DSA-focused technical round, and one system-design-plus-OS technical round, closed by an HR/managerial conversation. Some drives merge HR into the final technical round instead of running it separately.
How should I prepare for BYJU’S interviews?
Practice medium-difficulty DSA (arrays, strings, palindrome/difference-style problems) for the OA and Round 1. For Round 2, revise OS fundamentals in depth - thrashing, deadlock, semaphores, virtual memory - and practice a basic system-design walkthrough (an elevator system or similar bounded, stateful system is a real reported prompt). Keep one clear project story ready for the HR round.
Is BYJU’S a safe company to join right now given its financial troubles?
It carries real risk - BYJU’S has been in insolvency proceedings since mid-2024, triggered by a BCCI default case, and a resolution professional ran an Expression-of-Interest process for a buyer through 2025. As of July 2026 the tribunal had paused the buyer search while creditors weighed a proposed BCCI settlement, and no resolution had been approved. The company cut more than 10,000 jobs across 2023-2025 amid the crisis. This doesn’t mean roles aren’t open, but candidates should verify the specific business unit’s stability and treat published salary/eligibility figures as unverified until the offer letter confirms them.
What does the BYJU’S HR round focus on?
A closing conversation on motivation, communication, and product mindset - explaining concepts simply, handling a skeptical customer or parent, and why edtech. Given the company’s ongoing restructuring, it’s reasonable to also ask the interviewer directly about team stability and reporting lines.
Are BYJU’S interviews mostly for BDA sales roles?
Mostly, in public reports - question banks heavily feature BDA and sales role-plays. Technology roles still appear but volumes vary. Match prep to the JD on your invite.
Should I discuss BYJU’S business challenges in HR?
Only if asked, and then stay factual and professional. Focus on the role, learning, and how you work under change. Avoid gossip or unsupported claims.
How to prepare for BYJU’S interviews
- Loop map: Online Assessment (HackerEarth); Technical Round 1; Technical Round 2; HR / managerial. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why BYJU’S?” on the HR page.
A practical BYJU’S prep plan
Use this as a default four-week loop before a BYJU’S drive. Adjust to your invite timeline.
- Week 1: Language fluency: rewrite 10 old solutions in one language until you stop hunting syntax. Open the BYJU’S previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most BYJU’S drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at BYJU’S usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why BYJU’S?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Sleep, id photocopies, and a dry run of the oa platform if the invite names one. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for BYJU’S often cite ₹4-8 LPA historical candidate reports. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the BYJU’S interview experience page. For OA papers and coding drills, use BYJU’S on placementpapers.app. OA quick answers and role-wise questions draw on GfG BYJU’S interview experiences (software engineer intern, business development associate, sales, and a 2024 teaching-role report), PrepInsta’s 2023 BYJU’S recruitment page for eligibility, 2022-2024 AmbitionBox and Glassdoor candidate snippets seen via search, and CXO Digital Pulse (July 2026) for the insolvency status.