Coding questions
Texas Instruments Online Assessment
Overview
Here is how public prep guides and student write-ups describe the Texas Instruments online assessment. This is not an official company brochure.
Profile-split OA (Analog / Digital / Embedded) with a shared aptitude section; at most two profiles. Core interviews are project- and fundamentals-heavy rather than LeetCode-contest style for analog/digital roles.
Usual selection rounds
Rounds students usually mention: Online Assessment (HirePro on many campuses) → Technical interview (1-2 rounds, sometimes 1-3) → HR interview
| Item | From student reports |
|---|---|
| Platform | HirePro (reported on multiple campus drives) |
| Online test summary | Common aptitude section for everyone, then profile-specific technical MCQs. Candidates may attempt at most two profiles (e.g. Analog + Digital). No coding round in the classic core profiles; Software/Embedded accounts differ by drive. |
| Eligibility notes | Typically 7.0+ CGPA (IIT Kharagpur / IIT Guwahati campus accounts) |
| Branches (reported) | ECE, EEE, Instrumentation, CSE for Embedded Software / some Software roles, Engineering Physics (some drives) |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Aptitude (common) | ~14-20 | ~20-30 min | Negative marking reported; accuracy over volume. Topics: arithmetic, time-work, probability, PnC, basic number theory, some logic/verbal. |
| Analog Design technical | ~20 | ~30-45 min | RC intuition, op-amps, MOSFET regions, current mirrors - often up to 2nd-year curriculum depth asked in tricky ways. |
| Digital Design technical | ~20 | ~30-45 min | Boolean, sequential logic, FSM, timing, architecture basics, sometimes Verilog. |
| Embedded Software technical | ~20 | ~30-45 min | DSA, C/C++ pointers/memory, OOPs, OS, networks, DBMS, bit manipulation. |
Extra notes from sources
- IIT Guwahati internship account: 20 aptitude + 20 per role; aptitude 30 min, each role section 45 min on HirePro.
- IIT Kharagpur 2024 account: aptitude ~14-15 everyday arithmetic questions before profile technicals.
- FACE Prep / KGP reports: ~11-12 correct / ~20 often enough on aptitude because of negative marking - do not blind-guess.
- Software-role campus account (GFG): 20 aptitude (30 min) + 10 technical MCQs (45 min), no coding in written; shortlist heavily accuracy-based.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real Texas Instruments live paper.
Coding Q1: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
Texas Instruments tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
Texas Instruments tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Check prime
Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.
Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.
Complexity: O(√n) time
Texas Instruments tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Valid parentheses
Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.
Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.
Complexity: O(n) time, O(n) space
Texas Instruments tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- For Analog: practice RC bode/transient by inspection (Razavi/Neamen + problem sets); defend every CV project to component level.
- For Digital: FSM design end-to-end, setup/hold, Verilog blocking vs non-blocking.
- For Embedded/Software: C pointers, bit manipulation, OS/cache; be ready to write/debug on a shared screen.
- Aptitude: accuracy first because of negative marking - skip uncertain items.
Sources
- Texas Instruments Placement Papers: Test Pattern 2026 (faceprep)
- FORESIGHT 2024 Placement at Texas Instruments - Arpan Deb (medium)
- FORESIGHT 2025 Placement at Texas Instruments - Satya Sai Kommana (medium)
- TI Interview Experience for Internships (On-Campus) - GFG IIT Guwahati (gfg)
- TI Interview Experience (On-Campus) Software - GFG (gfg)
- CQ Core Combat - Utsav Agarwal TI Analog Intern (medium)
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.