TEKsystems Software Developer Interview Questions and Answers for Experienced

DSA

About Social changes

Q1. Tell me about yourself.
Add your answer
Q2. Very basic questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

Q1. 
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...read more
Ans. 
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of unique paths at each cell.

• Initialize the first row and first column with 1 as there is only one way to reach them.

• For each cell (i, j), the number of unique paths is the sum of paths...read more
Answered by AI
Add your answer
Q2. 
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...read more
Ans. 
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
• Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

• Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

• The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

Q1. 
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...read more
Ans. 
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
• Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

• Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

• Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the element pointed to by the slow pointer
Answered by AI
Add your answer

Q1. Core java basic questions
Add your answer

Q1. Oops questions, Garbage collection, Asp .net related questions, Sql queries, Sql Joins
Add your answer

Q1. .Net related questions, Sql queries, previous Project related questions
Add your answer

Q1. CTC related questions, Joining & Onboarding related questions
Add your answer

Q1. 1. what is ITSM 2. business rule, client script 3. recent task 4. integration
Add your answer

Q1. Remove Duplicates
Ans. 
Remove duplicates from a given array or list.
• Iterate through the array and add each element to a set.

• If the element already exists in the set, remove it from the array.

• Return the modified array without duplicates.
Answered by AI
Add your answer
Q2. Find closest using binary search
Ans. 
Binary search algorithm to find the closest element in a sorted array
• Sort the array in ascending order

• Find the middle element of the array

• Compare the middle element with the target value

• If the middle element is greater than the target value, search the left half of the array

• If the middle element is less than the target value, search the right half of the array

• Repeat until the closest element is found
Answered by AI
Add your answer

Q1. What are the fundamental concepts of Java programming?
Ans. 
Java programming is based on key concepts like OOP, inheritance, polymorphism, encapsulation, and abstraction.
• Object-Oriented Programming (OOP): Java is built on OOP principles, allowing for modular and reusable code.

• Inheritance: Enables a new class to inherit properties and methods from an existing class. Example: 'class Dog extends Animal'.

• Polymorphism: Allows methods to do different things based on the object it is ...read more
Answered by AI
Add your answer
Q2. What is SQL?
Ans. 
SQL (Structured Query Language) is a standard programming language for managing and manipulating relational databases.
• SQL is used to perform tasks such as querying data, updating records, and managing database structures.

• Common SQL commands include SELECT (to retrieve data), INSERT (to add data), UPDATE (to modify data), and DELETE (to remove data).

• SQL supports various data types, including INTEGER, VARCHAR, DATE, and ...read more
Answered by AI
Add your answer