Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. TSMC

TSMC LeetCode Interview Questions

Practice 22 real coding problems frequently asked in TSMC technical interviews. Master these questions to ace your next TSMC software engineering interview.

6 Easy
13 Medium
3 Hard

Top Topics at TSMC

ArrayDynamic ProgrammingBinary SearchTwo PointersSorting

Ace your TSMC interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

TSMC Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Minimum Limit of Balls in a Bag
100%
MediumM
100%
ArrayBinary Search
Solve→
Best Time to Buy and Sell Stock
91%
EasyE
91%
ArrayDynamic Programming
Solve→
Find the Index of the First Occurrence in a String
82%
EasyE
82%
Two PointersString+1
Solve→
Unique Paths II
79%
MediumM
79%
ArrayDynamic Programming+1
Solve→
Minimum Difference in Sums After Removal of Elements
78%
HardH
78%
ArrayDynamic Programming+1
Solve→
Moving Average from Data Stream
77%
EasyE
77%
ArrayDesign+2
Solve→
Rank Transform of a Matrix
74%
HardH
74%
ArrayUnion Find+4
Solve→
Same Tree
73%
EasyE
73%
TreeDepth-First Search+2
Solve→
Maximum Sum of Distinct Subarrays With Length K
70%
MediumM
70%
ArrayHash Table+1
Solve→
Count Unhappy Friends
70%
MediumM
70%
ArraySimulation
Solve→
Add Two Numbers
69%
MediumM
69%
Linked ListMath+1
Solve→
Friends Of Appropriate Ages
65%
MediumM
65%
ArrayTwo Pointers+2
Solve→
Combination Sum
64%
MediumM
64%
ArrayBacktracking
Solve→
Best Time to Buy and Sell Stock II
61%
MediumM
61%
ArrayDynamic Programming+1
Solve→
Min Stack
59%
MediumM
59%
StackDesign
Solve→
Frequency of the Most Frequent Element
54%
MediumM
54%
ArrayBinary Search+4
Solve→
Remove Duplicates from Sorted Array II
52%
MediumM
52%
ArrayTwo Pointers
Solve→
Expression Add Operators
45%
HardH
45%
MathString+1
Solve→
Merge Two Sorted Lists
44%
EasyE
44%
Linked ListRecursion
Solve→
Combination Sum II
27%
MediumM
27%
ArrayBacktracking
Solve→
Maximum Swap
23%
MediumM
23%
MathGreedy
Solve→
Range Sum of BST
22%
EasyE
22%
TreeDepth-First Search+2
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

3m
22 problems
Accolite Digital
22 problems
Amgen
22 problems
Arrival
22 problems
Blinkit
22 problems
Bolt
22 problems

Frequently Asked Questions

What LeetCode problems does TSMC ask in interviews?

TSMC commonly asks 22 coding problems in technical interviews, including Minimum Limit of Balls in a Bag, Best Time to Buy and Sell Stock, Find the Index of the First Occurrence in a String. The difficulty breakdown is 6 Easy, 13 Medium, and 3 Hard problems.

How should I prepare for a TSMC coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. TSMC interviews typically emphasize Array and Dynamic Programming. Practice explaining your thought process while coding.

What is the difficulty level of TSMC coding interviews?

Based on our data, TSMC interviews include 6 Easy (27%), 13 Medium (59%), and 3 Hard (14%) problems.

Ready to ace your TSMC interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.