
MediaTek
Fabless semiconductor company designing chips for smartphones, smart TVs, connectivity, automotive and other devices.
Hsinchu, Taiwan
5,000 and up
5,000 or more peopleNot known
Not known
Not enough signal to say. Check the careers page directly.No careers page on file yet. Try their LinkedIn or the job boards below.
WebsiteHow they hire
MediaTek is a chip company, so most software roles sit close to the hardware and the loop reflects that. Reports come from several countries and routes, so the exact rounds vary.
- 1
Online test
Reported +1Online test1.5 hoursRemoteCandidates report a coding test, with some mentioning an English test. One campus account describes 30 multiple choice questions plus three coding problems in 90 minutes.
COperating systemsComputer architectureData structures - 2
Technical interviews with the team
Reported +1Technical interviewTechnical rounds with future teammates and the direct manager. The campus account describes two rounds of about an hour each.
OS conceptsC and bit manipulationData structures - 3
Senior management or HR interview
Reported +1Senior leadershipA final conversation, reported as either senior management or HR depending on the route.
What comes up
Recurring themes from candidate accounts, not a question bank. Nobody is served by leaked question lists, least of all you in the interview.
Low-level C and operating systems
UnverifiedPointers, endianness, bitwise operations, scheduling and classic concurrency problems such as producer and consumer come up repeatedly.
Linked lists and trees
UnverifiedThe coding problems reported are standard pointer-heavy data structure questions.
Worth reading before you apply
From the Sefism resource library, matched to the rounds above.
A foundations course that builds eleven core data structures from the ground up (arrays, matrices, stacks, queues, linked lists, trees and BSTs, hash tables, hash sets, heaps, graphs and tries), then covers sorting, searching, greedy and divide and conquer. Every chapter has practice problems, flashcards and an assessment. It suits students and career switchers whose foundations came from tutorials and who find pattern courses move too fast.
- Job search
- DSA
- CS fundamentals
A browsable practice library of coding problems that can be filtered by pattern, data structure, difficulty and company, so you can drill exactly the weakness you found this week. Patterns include two pointers, sliding window, hash maps, stacks, backtracking and greedy algorithms, with company filters for Google, Meta, Microsoft, Amazon, Oracle and LinkedIn. Free to browse, with an in-browser editor and solutions.
- Job search
- DSA
A free newsletter of short, focused posts on system design and problem solving, from the team behind the Grokking courses. Recent posts cover company interview processes (such as OpenAI and Anthropic roles), the most asked mobile system design questions and preparation plans, each linking to a fuller article on the blog. It suits engineers who want a steady, low-effort way to keep system design and interview topics fresh between deeper study sessions.
- System design
- DSA
A sequenced path of six text-based courses for the engineering manager interview loop, combining coding, system design, microservices patterns, people management scenarios and senior leadership questions. It suits engineers moving into management and managers changing companies, who need to prepare for both the technical and the leadership rounds without piecing a plan together themselves.
- Career
- Leadership
- Job search
The official site of the ICPC, the university programming contest where teams of three share one computer for five hours and advance from regional contests towards the World Finals. It is where coaches register teams, where the current regional and World Finals rules are published, and where you find contests, results and past problems.
- DSA
- CS fundamentals
Abdul Bari's channel is a classic university-style course on the design and analysis of algorithms, taught on a whiteboard in clear English. It covers complexity, divide and conquer, greedy methods, dynamic programming, backtracking, branch and bound, NP-hard problems and string matching, plus Java programming. It suits computer science students studying algorithms as a subject.
- DSA
- CS fundamentals
- Programming
What it pays
Nothing collected for this company yet, and nothing worth guessing at. A made-up range is worse than no range because people negotiate against it.
Universities they recruit from
No sourced university links yet. A campus drive, a career fair appearance or an internship partnership is what puts a university here.
How to actually get seen
Brush up C, pointers, bit manipulation and operating system basics before algorithms. Expect questions on your own projects in every technical round.
Sources
- MediaTek websiteread 2026-09-22
- Glassdoor interview reports, MediaTek Software Engineerread 2026-09-22
- GeeksforGeeks: MediaTek on-campus interview experienceread 2026-09-22
One campus candidate’s account.
Whole profile last checked 2026-09-22.
Interviewed at MediaTek? Fill in what changed.
Processes change, rounds get added, tests get replaced. If what you went through was different from what is on this page, tell me and I will update it.
Want me to refer you here?
Send me the role, your CV and a few honest paragraphs on why you fit it. Where I know someone inside and your profile matches, I will make the introduction. Where I cannot, I will tell you why and point you at the route that does work. You get an answer either way.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Sessions are free for approved Sefism members, and a few slots open each week.
Follow along
New writing, resources and project ideas land here first.