Filter interviews by
I applied via Campus Placement and was interviewed before Jan 2023. There were 4 interview rounds.
It include 2 coding questions, 15 aptitude questions , 15 subject based questions
The longest common subsequence problem is finding the longest subsequence that two or more strings have in common.
A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
The longest common subsequence does not require consecutive elements.
Dynamic programming is commonly used to solve this problem efficiently.
Example: For ...
The implementation of a query
Understand the requirements of the query
Design the query based on the database structure
Write the query using appropriate syntax and functions
Test the query to ensure it returns the desired results
I applied via Campus Placement and was interviewed before Oct 2021. There was 1 interview round.
I was interviewed in Aug 2021.
Round duration - 120 Minutes
Round difficulty - Medium
It's MCQ based round. And there is different different sections of analog ,digital , aptitude and computer fundamentals. -ve marking is also there -0.5 for each wrong question.
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!
, is the product of all positive integ...
Round duration - 50 minutes
Round difficulty - Easy
1 coding question
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Round duration - 55 minutes
Round difficulty - Medium
It's pure coding, project explaination and oops concepts based round.
Design a data structure that implements ‘N’ stacks using a single array of size ‘S’. The data structure should support the following operations:
push(X, M)
: Pushe...Tip 1 : good with basics and have a good command on basic electronics concepts to solve the circuits.
Tip 2 : Deep understanding of OOPs concepts is must. Do Avg To meadium level coding questions. Have a good command on DP and recursion.
Tip 3 : And be clear with your approach to solve any question and explain everything about that question.
Tip 1 : have 2-3 good projects on your resume some basic projects also can be there try to make projects on real-world solution.
Tip 2 : also mentioned all the things which you have done in your academic.
I was interviewed in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.
Consider 'N' individuals standing in a circle, numbered consecutively from 1 to N, in a clockwise direction. Initially, the person at position 1 starts counting and will skip K-...
This question is about finding the position of the last person surviving in a circle of N people, where each person kills the Kth person in a clockwise direction.
Implement a function that takes the number of test cases, N, and K as input
For each test case, simulate the killing process by iterating through the circle and skipping K-1 people
Keep track of the position of the last person surviving and return it as the outp
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
The task is to find the minimum number of conference rooms required to organize all the meetings.
Sort the meetings based on their start time.
Initialize a priority queue to store the end times of the meetings in ascending order.
Iterate through the sorted meetings and check if the start time of the current meeting is greater than the end time of the meeting at the top of the priority queue.
If it is, remove the meeting fr...
Round duration - 75 minutes
Round difficulty - Medium
A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
The question is about finding the minimum number of throws required to reach the last cell on a Snake and Ladder board.
The board is represented as a 2D matrix with N rows and N columns.
Each square on the board can have a snake or ladder, represented by a non-negative number.
The destination of a snake or ladder is the value at the corresponding square.
You can only take a snake or ladder once per move.
If the destination ...
You are given an array/list HEIGHTS
of length N
, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
The task is to find the largest rectangle possible in a given histogram and return its area.
Iterate through the histogram and maintain a stack to keep track of the indices of the bars in non-decreasing order of heights.
For each bar, calculate the area of the rectangle that can be formed using that bar as the smallest bar.
To calculate the area, pop the bars from the stack until a bar with a smaller height is encountered...
Round duration - 60 minutes
Round difficulty - Easy
The face to face round was held on Google Meet where initially Interviewer asked a DS/Algo problem and then Later Manager Joined and asked about our resume projects in detail.
The time was 10:00 AM
Given an M x N matrix of integers ARR
, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
The first line of input co...
The task is to find the maximum sum rectangle in a given matrix of integers.
Iterate through all possible rectangles in the matrix
Calculate the sum of each rectangle
Keep track of the maximum sum rectangle found so far
Return the maximum sum
Assume you initially have an empty array called ARR
. You are required to return the updated array after executing Q
number of queries on this array.
There are two types of que...
The problem requires updating an array based on a series of queries, where each query can either insert a value or perform a bitwise XOR operation on all elements.
Use a loop to iterate through each query and update the array accordingly
For type 1 query, append the value to the end of the array
For type 2 query, perform a bitwise XOR operation on each element of the array with the given value
Return the updated array afte
Tip 1 : Prepare OS,DBMS,OOPs too
Tip 2 : Mention atleast one project or past work experience in your resume
Tip 3 : Try maintaining 8+ CGPA as sometimes shortlist is done based on CGPA
Tip 4 : Try past interview questions from Coding Ninjas Site.
Tip 1 : Try to Keep Resume 1 Pager
Tip 2 : Have atleast one project or past work experience mentioned
Tip 3 : Don't put false things on Resume as questions are asked in detail from Resume
Texas Instruments interview questions for popular designations
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Basics appt ...
graph
case study
basic maths
Get interview-ready with Top Texas Instruments Interview Questions
I applied via Campus Placement and was interviewed before May 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed in Dec 2021. There was 1 interview round.
Design exor, nand and d latch using 2:1 mux and frequency divide by 3 circuit
For exor using 2:1 mux, connect one input to select line and other to output of nand gate using 2:1 mux
For nand using 2:1 mux, connect one input to select line and other to inverted output of and gate using 2:1 mux
For d latch using 2:1 mux, connect data input to select line and connect inverted output to one input and output to other input
For ...
I applied via Campus Placement and was interviewed in Aug 2021. There were 3 interview rounds.
2 parts: Analog (Mostly OpAmps) & Aptitude
I am a highly skilled Field Application Engineer with expertise in troubleshooting and providing technical support for complex systems.
Experienced in analyzing customer requirements and designing customized solutions
Proficient in conducting product demonstrations and training sessions
Strong problem-solving skills and ability to work under pressure
Excellent communication and interpersonal skills
Familiarity with various ...
My family background is diverse and multicultural, with members from different professions and backgrounds.
My father is a doctor and my mother is a teacher.
I have two siblings, one is an engineer and the other is a lawyer.
We have relatives living in different countries, which has exposed me to various cultures and traditions.
Growing up, family gatherings were always filled with lively discussions and debates on various...
I applied via Company Website and was interviewed in May 2021. There were 3 interview rounds.
Top trending discussions
Some of the top questions asked at the Texas Instruments interview -
The duration of Texas Instruments interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 66 interviews
Interview experience
based on 182 reviews
Rating in categories
Analog Design Engineer
150
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Design Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Digital Design Engineer
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Application Developer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Analog Devices
NXP Semiconductors
Microchip Technology
STMicroelectronics