MyGate Software Engineer Interview Questions & Rounds
How the MyGate software engineer interview works: the coding and MCQ test, the technical round and HR rounds, from real candidate experiences, 2022 to 2026.
On this page
[Draft] How to Crack MyGate: The Software Engineer Interview, From Real Experiences
Last updated November 20, 2026 · 26 min read · For campus and off-campus candidates (level not stated)
Built by the Codinzhub team. This guide is built from MyGate software engineer interview experiences that candidates shared, including campus OA questions on Codinzhub. The process changes by year, campus and role, so treat this as a map, not a promise.
The 30-second version. In this data, the MyGate software engineer interview usually starts with a test, then one technical interview, sometimes followed by an HR, one-on-one or puzzle round. Eight records back this: three campus OA records and five interview reports from 2022 to 2024 (one undated). The test mixes coding with MCQs: 2 coding questions plus 6 to 10 MCQs on the 2026 IIT papers, and 1 coding question plus about 20 technical MCQs at NIT Calicut and in a 2023 campus drive. Array problems appear in 6 of 8 records. Four reports describe the technical round, with 1 to 3 questions; one interviewer wanted the time and space complexity of every answer, and Java, databases and Redis came up in two reports. Three reports put the whole process at under two weeks. No level, system design round or rejection reason is reported. The habit that matters most: restate exactly what the problem allows, then state your solution's complexity.
What this guide is, and what it is not
This guide is built from 8 candidate records of MyGate's hiring for engineering roles in India. Three are online assessment (OA) questions shared on Codinzhub from campus drives at IIT Roorkee and IIT Guwahati in October 2026 and at NIT Calicut (date not shown). Five are first-hand interview reports for Associate Software Engineer, Software Engineer and backend developer roles, from 2022 to 2024 (one undated). No record states a level, and no report covers a senior or experienced-hire loop. It is a thin dataset: strong on the test, light on the interviews.
It is:
- A map of the test and the interview rounds, as candidates described them
- The question patterns in the reported questions and shared OA titles
- 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 MyGate's process; MyGate's careers page does not describe its interview steps
- An offer rate. Three reports give a result (two selected, one not), which is too few to judge your odds.
Important things to know before you start
These are the MyGate facts that change how you prepare.
The test has two parts, and the mix varies. In 4 of the 6 records that describe a test, it mixed coding with multiple-choice questions (MCQs). The 2026 IIT papers had 2 coding questions and 6 to 10 MCQs; the NIT Calicut paper and a 2023 campus drive had 1 coding question and about 20 technical MCQs, and in that 2023 drive each MCQ had its own time limit. Prepare CS fundamentals as seriously as coding.
One technical round, then maybe one more. Four reports describe a single technical round of 1 to 3 questions, mostly on arrays, sometimes followed by an HR, one-on-one or puzzle round. Backend basics such as Java, databases and Redis came up in two reports.
Two spellings on Codinzhub. Questions are listed under both MyGate and My Gate, so check both company pages when you look for past papers.
Round-by-round breakdown
Candidates described five stages: application, a resume shortlist off campus, a test, one or more interview rounds, and a decision. The test is the best-covered stage; the interviews rest on four reports.
Stage 1: Application, where candidates applied
Campus drives are the most common route in this data: 4 of 8 records. Three are the October 2026 IIT drives and the undated NIT Calicut drive shared on Codinzhub, and the fourth is a 2023 campus placement for a backend developer role. The off-campus reports name one LinkedIn application (2023) and one referral (2022); two reports do not say how the candidate applied.
| Channel | What candidates said |
|---|---|
| Campus drive | OA questions from three campuses are shared on Codinzhub: IIT Guwahati (pages dated 8 and 12 October 2026), IIT Roorkee (pages dated 15, 16 and 26 October 2026) and NIT Calicut (date not shown). One IIT Roorkee page is titled "sde". A 2023 backend developer candidate also came through campus placement and went on to two interview rounds. |
| LinkedIn application | One 2023 Associate Software Engineer applied through LinkedIn, passed a resume shortlist and was selected after five rounds. |
| Referral | One 2022 backend developer applied through a referral: a resume shortlist, a coding test, then a technical round. |
| Careers page | MyGate's careers page sends applicants to an external candidate portal for open roles. It does not describe any hiring steps. |
What helped. No candidate credited a specific factor for getting shortlisted. The 2022 referral candidate's only tip was that data structures and algorithms (DSA) matter, so prepare them before you apply.
Stage 2: Shortlisting, how candidates moved forward
Shortlisting depends on the route, and the reports say little about it.
- Off campus: a resume shortlist. Two off-campus reports, a 2023 LinkedIn application and a 2022 referral, list a resume shortlist as their first round. Neither says how long it took or what got the resume through.
- Campus: the test is the first step on record. In the 4 campus records, the first stage described is the test (see Stage 3). No campus record gives an eligibility rule, a CGPA cutoff, or how many students moved on after the test.
No report describes a recruiter call or a questionnaire before the test.
What candidates advised. Nothing specific to this stage was reported.
Stage 3: Online assessment
Six of the 8 records describe a test before any interview. Campus candidates took an online assessment (OA), a timed test, and off-campus candidates took a coding or aptitude test after the resume shortlist. In 4 of those 6 records, the test mixed coding questions with multiple-choice questions (MCQs).
Online assessment
How it works. On the October 2026 IIT papers the MCQ count differs from page to page (6 to 7, 7, 8, or 8 to 10). In a 2023 campus drive for a backend role, each MCQ had its own time limit. Off campus, a 2023 Associate Software Engineer had an aptitude test of standard DSA problems, and a 2022 referral candidate had one medium array and string question on HackerEarth, needing 50 out of 100 to move on. One IIT Roorkee page says each MCQ came with a situation, and the one public MCQ page covers data structures, algorithms and complexity. No record says whether test cases were visible or gives any rule on AI tools.
At a glance
- Length: Not reported for most tests. One 2023 campus report gave nearly 90 minutes for a single coding question.
- Questions: 2 coding questions plus 6 to 10 MCQs (IIT Roorkee, IIT Guwahati); 1 coding question plus about 20 technical MCQs (NIT Calicut and a 2023 campus drive); 1 coding question with no MCQs (2022 referral)
- What was asked: rotating and shifting an array, the kth permutation, sorting an array with the fewest operations, a missing element, the longest substring without repeating characters, and MCQs on data structures, algorithms and complexity
- Most common: No single repeated question across campuses. Within IIT Roorkee, the kth permutation question was shared on 3 separate pages and array rotation on 2.
OA questions shared on Codinzhub. These pages show only the title, college, exam pattern and OA date publicly, so the topic is marked Not reported unless the page shows it.
| Question | Drive | Topic |
|---|---|---|
| Rotate an array | IIT Roorkee, 15 October 2026 | Not reported (also shared as "Rotate the given array") |
| Kth permutation of a sequence | IIT Roorkee, 15 and 16 October 2026 | Not reported (shared on 3 pages under 3 names) |
| Array after K shifts | IIT Roorkee, date not shown | Not reported (tagged medium on Codinzhub) |
| MCQ set on data structures, algorithms and complexity | IIT Roorkee, date not shown | Data structures, algorithms and complexity (MCQ section) |
| Minimum operations to make an array sorted (non-decreasing) | IIT Guwahati, 8 October 2026 | Not reported (shared on 2 pages) |
| Minimum replacements to sort the array | IIT Guwahati, 12 October 2026 | Not reported |
| Missing element | IIT Guwahati, 12 October 2026 | Not reported |
| Longest substring without repeating characters | IIT Guwahati, date not shown | Not reported |
Two more pages hold whole papers without a problem title: the IIT Roorkee "sde" paper (26 October 2026, 2 coding questions) and the NIT Calicut paper (1 coding question, 20 technical MCQs). Pages from one campus carry different OA dates, so a campus may have had more than one sitting. Browse every page on the MyGate company page and the My Gate company page, or see all OA questions in the question bank.
Stage 4: The interview rounds
Four reports describe interviews after the test, and in 4 of 4 the first interview was a technical round. What follows differs. A 2023 Associate Software Engineer had a technical round, then an HR round, then a one-on-one round, and was selected. A 2023 campus backend developer had two one-on-one rounds, the first technical and the second on puzzles, and was not selected. A 2022 referral candidate describes a single technical round. No report gives a round length, says whether rounds were online or in person, or mentions a system design round. None of the three campus OA records shared on Codinzhub goes past the OA.
Technical interview
At a glance
- Length: Not reported
- Rounds: 1 technical round in 4 of 4 reports; one 2023 campus report adds a second one-on-one round of 3 puzzles of medium difficulty
- Questions: 1 question (one Associate Software Engineer report) to 3 questions (2023 campus, 2022 referral)
- What was asked: array problems, a linked-list question, a hashing question, Java and databases, and Redis
- Most common: No single repeated question
The 2023 campus candidate had one linked-list and two array questions, giving the time and space complexity of each. The 2023 Associate Software Engineer's round covered Java and databases. The 2022 referral candidate had a spiral traversal, Redis and a hashing question. Only three questions are described well enough to list.
| Question | What it tests | Level |
|---|---|---|
| Find the element whose left sum equals its right sum | Prefix sums | Associate Software Engineer |
| Traverse a 2D array in spiral order (2022) | Matrix traversal with shrinking boundaries | Backend developer |
| What is Redis, and where is it used? (2022) | Backend fundamentals: in-memory stores and caching | Backend developer |
One more record, posted in April 2025 about an interview in 2024 or earlier, mentions a hard array question and a "calendar based" DSA question without saying which round they came from or what they asked. That candidate was selected.
HR and one-on-one rounds
At a glance
- Length: Not reported
- Questions: 1 prompt reported for each round
- Themes: culture fit for a startup; leadership
Only one report describes these rounds: a 2023 Associate Software Engineer had an HR round, then a separate one-on-one round, after the technical round, and was selected. No report says whether these rounds can reject you.
Reported prompts.
- Why you would fit a startup's culture
- Leadership qualities you have shown in your current role
See all interview questions in the question bank.
Stage 5: Decision and offer
Decision. Three reports give a result: two candidates were selected (a 2023 Associate Software Engineer after five rounds, and the 2024 or earlier array and calendar-question candidate) and one was not (the 2023 campus backend developer, after four rounds). The rejected report does not say which round ended it or why. No report describes a hiring committee, team matching or a change of level.
Timeline. The same three reports each put the whole process at less than two weeks. None gives the time from application to first contact, or from the last round to the result. The October 2026 campus records give OA dates only.
Offer. No report describes the offer call, the offer letter or how long you get to accept.
The Codinzhub Next-Round Playbook
This playbook follows the reported stages. The evidence is thin past the test, so each point says how many reports it rests on.
To get past the online assessment
- Split your preparation between coding and MCQs. Four of the 6 records that describe a test had MCQs, and two papers had about 20 MCQs against a single coding question, so the MCQ section can carry much of the score.
- Practise MCQs under a per-question clock. In one 2023 campus test, each MCQ had its own time limit. One IIT Roorkee page says each MCQ came with a situation, so expect short scenarios rather than one-line definitions.
- Recognise classic problems under new names. The kth permutation question was shared from IIT Roorkee under three different titles, and the array-rotation question under two.
- Pin down the allowed operation before coding. Two IIT Guwahati questions ask for the fewest operations or replacements to sort an array; the right method depends on what one operation is allowed to do.
- Aim for full marks, not just a pass. One 2022 test needed a score of 50 out of 100 to move on; no other report gives a cutoff.
To get past the technical interview
- Expect array problems. Array questions appear in 3 of the 4 interview reports, including the balance-point question and a spiral traversal.
- Give the complexity without being asked. One 2023 interviewer asked for the time and space complexity of each of three questions.
- Revise the backend basics on your resume. One 2023 round covered Java and databases, and one 2022 round asked what Redis is and where it is used.
- Keep some puzzle practice. One 2023 campus candidate had a whole one-on-one round of 3 medium puzzles.
To get past the HR and one-on-one rounds
- Prepare for culture fit and leadership. The one report of these rounds asked why the candidate fits a startup and about leadership in their current role.
- Know what MyGate does. Its careers page calls it a community management app. Tie your answers to its listed values, such as Speed and Client Obsession, only with real examples.
How the loop differs by level
No record in this data states a level, so this table groups the reports by the job title candidates gave. Where a report goes past the test, it has one technical interview, sometimes followed by a second round.
| Title as reported | What candidates describe |
|---|---|
| Campus OA (title not stated) | Based on three campus records (IIT Roorkee and IIT Guwahati in October 2026; NIT Calicut, date not shown): an on-campus OA of 1 or 2 coding questions plus MCQs. Examples: rotate an array, kth permutation of a sequence, longest substring without repeating characters. One IIT Roorkee page is titled "sde". These records stop at the OA. |
| Backend developer | Based on two reports. 2023, campus: MCQ and coding tests, a technical one-on-one with complexity questions and a puzzle round; not selected. 2022, referral: resume shortlist, a coding test, then a technical round with spiral traversal, Redis and hashing. |
| Associate Software Engineer | Based on three reports, one of them also titled Software Engineer. 2023, via LinkedIn: resume shortlist, a DSA aptitude test, a technical round on Java and databases, then HR and one-on-one rounds; selected in under two weeks. The others report the balance-point question, a hard array question and a calendar-based DSA question. |
System design. No report at any title describes a system design round. The closest item is one 2022 backend question on what Redis is and where it is used.
Experienced hires. No report states years of experience or a senior title, so the guide makes no claim about experienced-hire loops. The 2023 Associate Software Engineer was asked about leadership in their current role, so was already working.
Most-asked topics
Across all 8 records, array problems lead: 6 of 8 records include at least one array question, in the test or the interview. Multiple-choice fundamentals come next, in 4 of 8. The campus OA statements are not public, so those rows are grouped by question title, not by a confirmed technique.
| Topic | What it means | Seen in | Reported examples |
|---|---|---|---|
| Array problems | Questions over a list of numbers: rotating, sorting, sums, traversal | 6 of 8 records | Rotate an array; minimum operations to make an array sorted; find the element whose left sum equals its right sum; spiral traversal of a 2D array |
| Multiple-choice fundamentals | MCQs on data structures, algorithms and complexity | 4 of 8 records | MCQ set opening with merging two sorted arrays; about 20 technical MCQs at NIT Calicut and in a 2023 campus drive |
| Complexity analysis | Stating the time and space cost of a solution | 2 of 8 records | Complexity MCQs; time and space complexity asked for every interview question in one 2023 report |
| Backend fundamentals | Language, database and infrastructure knowledge | 2 of 8 records | Java questions and databases (2023); what Redis is and where it is used (2022) |
| Strings | Questions over the characters of a string | 2 of 8 records | Longest substring without repeating characters; a 2022 coding test on arrays and strings |
| Linked lists, hashing and puzzles | One report each | 1 of 8 records each | A linked-list question with complexity; a hashing question; 3 medium puzzles |
| Permutations | Finding one permutation in sorted order without listing them all | 1 of 8 records | Kth permutation of a sequence (shared on 3 pages) |
The question patterns that keep coming back
No single question repeats across the 8 records. These six patterns are what the reported questions resolve into, in order of how many records show them. The campus OA statements are paywalled, so each technique rule is general practice for a problem of that name, not a claim about MyGate's exact question.
1. Multiple-choice fundamentals and complexity
Four of the 6 records that describe a test had MCQs (see Stage 3), and the one public MCQ page covers data structures, algorithms and complexity. Complexity also came up in one 2023 interview, where the candidate had to state the time and space cost of every answer. The rule: for every standard operation, know its time and space cost and the reason for it. Merging two sorted arrays of sizes m and n takes O(m + n) time with two pointers. Know the cost of search, insert and delete in arrays, linked lists, hash maps, heaps and balanced trees, and the best, average and worst cases of the common sorts.
Reported examples. MCQ set on data structures, algorithms and complexity (first item: merging two sorted arrays); 20 technical MCQs at NIT Calicut; time and space complexity for each interview question.
2. Array problems in the technical interview
Two interview reports name an array question: the element whose left sum equals its right sum, and a spiral traversal (2022). For the balance point, the rule is prefix sums: compute the total once, then walk left to right keeping a running left sum; at index i the right sum is total minus left sum minus the element itself, so the whole scan is O(n) time and O(1) extra space. For a spiral, keep four boundaries (top, bottom, left, right), walk one edge at a time, and shrink that boundary after each edge. Check the boundaries before the last two edges so a single row or column is not printed twice.
Reported examples. Find the element whose left sum equals its right sum; traverse a 2D array in spiral order.
3. Array rotation and shifting
IIT Roorkee pages include array rotation twice (as "Rotate Array" and "Rotate the given array") and a separate "Array after K shifts" question tagged medium. The rule: reduce k modulo the array length first, because rotating by the full length changes nothing. To rotate in place with O(1) extra space, reverse the whole array, then reverse the first k elements and the rest separately. Before coding a "shift", check whether elements wrap around (a rotation) or fall off and get replaced.
Reported examples. Rotate an array; array after K shifts.
4. Sorting an array with the fewest operations
IIT Guwahati pages include two questions about sorting with as few operations as possible: making an array non-decreasing (shared again as "make an array sorted") and minimum replacements to sort the array. The rule: the allowed operation decides the method, so restate it before anything else. If you may change or delete any element, the answer is the array length minus the longest non-decreasing subsequence, found in O(n log n) with binary search. If one operation splits a number into two parts that add up to it, scan from the right and split each number into the fewest parts that stay at or below the value to its right.
Reported examples. Minimum operations to make an array sorted (non-decreasing); minimum replacements to sort the array.
5. The kth permutation (one campus, rare in the data)
This question was shared on three IIT Roorkee pages (two of them dated 15 and 16 October) as "Permutation Sequence", "Kth Permutation" and "Find kth permutation". The rule: never generate all n! permutations. With (n − 1)! permutations for each choice of first element, the first element is the one at index (k − 1) / (n − 1)! among those left; remove it, keep the remainder, and repeat. Practise next permutation as well, since it walks the same ordering one step at a time.
Reported examples. Kth permutation of a sequence.
6. Strings and missing values (one campus, rare in the data)
IIT Guwahati pages include the longest substring without repeating characters and a missing-element question. The rule for the substring: slide a window, store the last index of each character, and when a character repeats, move the window's start past its previous position. For one missing value in 1 to n, compare the expected sum (or XOR) with the actual one; when several values can be missing, mark seen values by index or in a hash set.
Reported examples. Longest substring without repeating characters; missing element.
Preparing for the HR and one-on-one rounds
Only one report describes these rounds (see Stage 4), so there are two reported prompts to prepare from. MyGate does not use a named values round in any report. Its careers page lists seven values: Excellence, Speed, Confidentiality, Innovation, Client Obsession, Sustainable Spends and Collaboration.
Build a small story bank. As editorial advice, prepare four to six real stories from your projects, internships or current job, each under two minutes, and cover the two reported themes first:
| Theme | Reported prompt (paraphrased) | Follow-up to expect |
|---|---|---|
| Culture fit | Why you would fit a startup's culture | Not reported |
| Leadership | Leadership qualities you have shown in your current role | Not reported |
Beyond those two, stories about delivering quickly without dropping quality, handling user data carefully, building something users asked for, and working through a disagreement map onto the official values above. Use only real experiences, and say "I" for what you did yourself.
Structure each story. Give the situation in one line, what you did, a result you can state, and what you would do differently.
A six-week plan
This plan puts array problems first (6 of 8 records), runs MCQ fundamentals through every week (4 of 8), then covers the rarer patterns, backend basics and puzzles, and ends with mocks. Plan on two to three focused hours a day.
- Week 1: Arrays, rotation and missing values. In-place rotation by reversal, k larger than the length, shifts with and without wrap-around, and finding one or several missing values by sum, XOR or index marking. Spend 30 minutes a day on MCQs about array and linked-list costs. Habit: write three edge cases (k = 0, k larger than n, one element) before you submit.
- Week 2: Interview array problems and linked lists. Prefix sums for the balance point, spiral traversal with four boundaries, and the basic linked-list operations. Habit: after each solution, say its time and space complexity out loud, as one 2023 interviewer asked for both.
- Week 3: Sorting with the fewest operations, and permutations. Longest non-decreasing subsequence in O(n log n), the greedy right-to-left split for minimum replacements, the kth permutation with factorials, and next permutation. Add MCQs on sorting algorithms and their best and worst cases. Habit: state the allowed operation in one line before you choose a method.
- Week 4: Strings, hashing and complexity MCQs. Sliding windows over strings with a last-seen map, hash-map counting, then a full pass over data-structure and algorithm complexity: hash maps, heaps, trees, merging sorted arrays. Habit: answer 20 MCQs at a fixed time per question, since one 2023 test timed each MCQ.
- Week 5: Backend basics, puzzles and stories. Revise the language and databases on your resume, what Redis is and when to use a cache, and medium puzzles. Write your culture-fit and leadership stories. Habit: explain one resume project in two minutes, then answer "why this design?".
- Week 6: Mocks. Take two timed papers in the IIT shape (2 coding questions plus about 8 scenario MCQs) and one in the other campus shape (1 coding question in about 90 minutes plus 20 technical MCQs). Then do two mock technical interviews of 1 to 3 array or linked-list questions, giving the complexity of each, and one mock HR round.
Only two weeks? Spend three days on arrays, rotation and missing values, two on the balance point, spiral traversal and linked lists, two on sorting with the fewest operations and permutations, two on strings, hashing and complexity MCQs, two on backend basics, puzzles and stories, and three on timed mock papers and mock interviews.
Practice problems that match these experiences
These are well-known practice problems that match the patterns above. They are not claims about MyGate's question bank: the OA statements are not public and the interview reports give short descriptions, so no row below is confirmed as asked as-is, even where the titles match.
| # | Practice problem | Pattern | Seen in these experiences as |
|---|---|---|---|
| 1 | Find Pivot Index | Prefix sums | Practice for the interview question on the element whose left sum equals its right sum |
| 2 | Spiral Matrix | Matrix traversal with boundaries | Practice for the 2022 spiral traversal interview question |
| 3 | Rotate Array | In-place rotation | Same title as an IIT Roorkee OA question; also practice for array after K shifts |
| 4 | Permutation Sequence | Kth permutation with factorials | Same title as an IIT Roorkee OA question, shared on 3 pages |
| 5 | Next Permutation | Permutation order | Practice for the kth permutation question |
| 6 | Minimum Replacements to Sort the Array | Greedy splitting from the right | Same title as an IIT Guwahati OA question |
| 7 | Longest Increasing Subsequence | Subsequence with binary search | Practice for minimum operations to make an array sorted, if any element may be changed |
| 8 | Longest Substring Without Repeating Characters | Sliding window | Same title as an IIT Guwahati OA question |
| 9 | Missing Number | Sum or XOR | Practice for the missing element question |
| 10 | Missing in Array | Sum or XOR over 1 to n | Practice for the missing element question |
| 11 | Find All Numbers Disappeared in an Array | Index marking | Practice for a missing-values variant |
| 12 | Merge Sorted Array | Two pointers | Practice for the MCQ on merging two sorted arrays |
How to handle a question you have never seen
The method below works for both the timed test and the technical interview, and notes where they differ.
- Repeat the problem and one example. Restate the task in one line and work the sample by hand before you code. Titles in this data change from page to page for the same problem (the kth permutation question had three names), so look past the wording to the input and output. In an interview, say the restatement out loud and confirm it.
- Say the brute force and its complexity. Write it down, then check it against the constraints. If it is too slow, you know what to improve. In an interview, state the time and space cost before you are asked.
- Name the bottleneck. Repeated range sums suggest prefix sums (the balance-point question); repeated lookups suggest a hash map; "fewest operations to sort" suggests a subsequence or a greedy scan; "kth in sorted order" suggests counting blocks instead of listing them; a grid walked edge by edge suggests boundaries that shrink.
- Say when you are stuck. In a test, that means moving on: answer the MCQs you are sure of, then come back, and watch the per-question timer where there is one. In an interview, say which step blocks you and what you have tried, so the interviewer can steer you.
- Code in small pieces. Write a helper for each step. In a test, submit a correct brute force first; one 2022 test needed 50 out of 100 to move on, so partial marks can count.
- Dry-run one case and fix the wrong line. Trace your own edge cases, such as an empty or one-element array, k larger than n, a single-row grid, or a value missing at the end. No report says whether test cases were visible.
Why candidates were rejected
Only 1 of the 8 records reports a rejection, and it gives no reason, so 0 of 8 records give a rejection reason. That report is a 2023 campus backend developer who took the MCQ test and the coding test, then a technical one-on-one and a puzzle round, and was not selected. It does not say which round decided it.
- No reported reasons yet. This guide does not guess at them. No recruiter feedback or candidate self-reflection on a rejection appears in the data.
- What the selected reports had in common. Both selected candidates finished in under two weeks. That describes their process; it is not a reason they passed.
- What would fill this gap. Reports that say how many students cleared the OA on a campus, what the later rounds asked, and why someone was not selected. If you have one, the share link is in About this guide.
Selected vs. rejected: do this, not that
With one rejection and no reasons in the data, this table pairs habits with what the reports show about each round, not with why candidates passed or failed.
| Do this | Not that | What the reports show |
|---|---|---|
| Prepare both parts: coding and MCQs every week | Coding-only prep: leaving MCQs to the last day | 4 of the 6 records that describe a test had MCQs; two papers had about 20 MCQs and 1 coding question. |
| Answer at the clock's pace: move on when an MCQ's time runs short | Stalling on one item: spending the next question's time | In one 2023 campus test, each MCQ had its own time limit. |
| State the complexity: time and space, for every answer | Stopping at working code: waiting to be asked | One 2023 interviewer asked for the time and space complexity of each question. |
| Restate the allowed operation: then choose the method | Reusing a memorised answer: for a problem with a different rule | Two IIT Guwahati questions ask for the fewest operations or replacements to sort an array. |
| Revise your stack: the language and databases on your resume | DSA only: ignoring backend basics | One 2023 technical round covered Java and databases; one 2022 round asked what Redis is. |
If you remember only five things
- Expect a test first. Six of 8 records describe a test before any interview: an on-campus OA, a coding test or an aptitude test.
- The test has coding and MCQs. 2 coding questions plus 6 to 10 MCQs on the 2026 IIT papers; 1 coding question plus about 20 technical MCQs at NIT Calicut and in a 2023 campus drive.
- Arrays dominate. Array questions appear in 6 of 8 records, from rotating and sorting arrays in the OA to the balance point and spiral traversal in interviews.
- Then one technical interview, with complexity. Four reports describe a technical round of 1 to 3 questions; one interviewer asked for the time and space complexity of every answer, and backend basics came up twice.
- Restate the rule before you code. The same problem appeared under different titles, and the sorting questions turn on what one operation is allowed to do.
FAQ
Is there an online assessment?
Yes, in 6 of 8 records. Campus OAs mixed coding with MCQs; off campus, one 2023 candidate had an aptitude test of DSA problems and one 2022 candidate a single coding question.
How many coding questions are in the OA?
Two on the 2026 IIT papers; one at NIT Calicut and in a 2023 campus drive, which gave nearly 90 minutes for it. Other test lengths are not reported.
What are the MCQs about?
The one public MCQ page covers data structures, algorithms and complexity. One IIT Roorkee page says each MCQ came with a situation, and one 2023 test timed each MCQ separately.
What happens after the test?
A technical interview of 1 to 3 questions, in four reports. After it, one 2023 candidate had HR and one-on-one rounds, and another a round of 3 puzzles.
Is there a system design round?
Not reported. No record describes one. The closest item is a 2022 technical question on what Redis is and where it is used.
How long does the process take?
Three reports put the whole process at less than two weeks. No report gives a more exact timeline.
What does MyGate do, and where is it based?
MyGate's careers page describes it as a community management app and gives an office address in HSR Layout, Bengaluru.
About this guide
The Codinzhub team researched and wrote this MyGate software engineer interview guide from 8 candidate records: OA questions shared on Codinzhub from campus drives in 2026 (one campus page shows no date), and five interview reports from 2022 to 2024 (one undated). We kept only what candidates described. The question titles are our own short summaries, and the practice links are similar problems, not confirmed exact questions. This dataset is light on the interview rounds and has no experienced-hire reports; if you interviewed with MyGate recently, especially past the OA, share your experience on Codinzhub and we will update this guide.
Disclaimer. MyGate's process changes by role, year and campus. 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 33 questions
Rotate an array
A Mygate online assessment question shared on Codinzhub (IIT Roorkee, 15 October 2026).
Kth permutation of a sequence
A Mygate online assessment question shared on Codinzhub (IIT Roorkee, 15 and 16 October 2026).
Array after K shifts
A Mygate online assessment question shared on Codinzhub (IIT Roorkee, date not shown).
MCQ set on data structures, algorithms and complexity
A Mygate online assessment question shared on Codinzhub (IIT Roorkee, date not shown).
Minimum operations to make an array sorted (non-decreasing)
A Mygate online assessment question shared on Codinzhub (IIT Guwahati, 8 October 2026).
Minimum replacements to sort the array
A Mygate online assessment question shared on Codinzhub (IIT Guwahati, 12 October 2026).
Missing element
A Mygate online assessment question shared on Codinzhub (IIT Guwahati, 12 October 2026).
Longest substring without repeating characters
A Mygate online assessment question shared on Codinzhub (IIT Guwahati, date not shown).
Find the element whose left sum equals its right sum
Level: Associate Software Engineer.
Traverse a 2D array in spiral order (2022)
Level: Backend developer.
What is Redis, and where is it used? (2022)
Level: Backend developer.
Array problems
Level: 6 of 8 records.
Multiple-choice fundamentals
Level: 4 of 8 records.
Complexity analysis
Level: 2 of 8 records.
Backend fundamentals
Level: 2 of 8 records.
Strings
Level: 2 of 8 records.
Linked lists, hashing and puzzles
Level: 1 of 8 records each.
Permutations
Level: 1 of 8 records.
Culture fit
Level: Not reported.
Leadership
Level: Not reported.
Keep preparing on Codinzhub
- MyGate interview questions and experiences — OA questions and interview experiences candidates shared for MyGate.
- Browse MyGate 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.