Texas Instruments Application Developer Interview Questions and Answers

1st round is combination of aptitude and technical mcqs

Q1. Tell me about ur projects
Ans. 
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
• Developed a web-based inventory management system using React and Node.js

• Created a mobile app for tracking fitness goals using Flutter

• Collaborated with a team to implement new features and fix bugs in existing projects
Answered by AI
Add your answer
Q2. Tell me about two sum code in python
Ans. 
Two sum code in Python finds two numbers in an array that add up to a specific target.
• Use a dictionary to store the difference between the target and each element in the array.

• Iterate through the array and check if the current element's complement is in the dictionary.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer

Q1. What are your top 3 strengths?
Add your answer
Q2. What are your top 3 weaknesses?
Ans. 
I am always striving to improve, but my current weaknesses are: perfectionism, public speaking, and delegating tasks.
• Perfectionism can lead to spending too much time on small details and missing deadlines.

• Public speaking can make me nervous and I may need to practice more to feel confident.

• Delegating tasks can be difficult for me because I like to have control over the outcome, but I am working on trusting others to ha
Answered by AI
Add your answer

Standard questions with moderate difficulty

Q1. Linked list based questions
Add your answer
Q2. Oracle/DB specific questions
Add your answer

Q1. Scenario based questions
Add your answer

Q1. Standard HR question
Add your answer

Linkedlist questions

Q1. Depth Os and C
Add your answer
Q2. Multi threading and semaphores
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:00 PM.

Q1. 
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...read more
Ans. 
Merge overlapping intervals and return sorted list of merged intervals.
• Iterate through intervals and merge overlapping ones

• Sort merged intervals based on starting times

• Handle edge cases like empty input or single interval

• Use a data structure like list or array to store merged intervals
Answered by AI
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. 
Given a rotated sorted array, find the index of a given integer 'K'.
• Use binary search to find the pivot point where the array is rotated.

• Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.

• Handle cases where 'K' is not present in the array by returning -1.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on CodePair : Hackerearth. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Hackerearth & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 11:00 A.M to 12:00 P.M

Q1. 
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...read more
Ans. 
Find the minimum number of fountains to activate to water the entire garden.
• Iterate through the array to find the coverage of each fountain.

• Keep track of the farthest coverage reached by activating fountains.

• Activate the fountain that covers the farthest point not yet covered.

• Repeat until the entire garden is watered.
Answered by AI
Add your answer
Q2. 
Bellman Ford Shortest Path Problem
Given a directed weighted graph comprised of vertices labeled 1 to N and M edges, where each edge connects two nodes u and v with a weight w representing the distance be...read more
Ans. 
Bellman Ford algorithm is used to find the shortest path in a graph with negative weights.
• Initialize distances from source to all vertices as infinity, and distance to source as 0.

• Relax all edges V-1 times to find shortest path.

• If any distance is updated in Vth iteration, then there is a negative weight cycle.

• Return the distance to destination vertex after V-1 iterations.

• Example: For the given graph, shortest path from
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a Google Meet Video Call. The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.