TP Southern Odisha Distribution Software Developer Interview Questions and Answers

Thre are aptitude question with coding round

Q1. Introduction Basics of programming
Add your answer

Q1. HR questions introduced yourself family background
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was very good

Q1. 
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...read more
Ans. 
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
• Use dynamic programming to check if substrings are palindromes

• Iterate through the string and expand around each character to find palindromic substrings

• Keep track of the longest palindromic substring found
Answered by AI
Add your answer
Q2. 
Minimum Sum in Matrix Problem Statement
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...read more
Ans. 
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
• Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.

• Keep track of the minimum sum achieved so far.

• Avoid selecting elements directly beneath previously selected elements.

• Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio...read more
Answered by AI
Add your answer

Round duration - 1 hour
Round difficulty - Medium

It was a good interview

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning. Coding questions were mainly from data structures and Algorithms. Aptitude part was easy to solve that was more based on reasoning.

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Time complexity of Merge Sort is O(n log n).

• Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the afternoon. Questions were mainly from OS/DBMS based.

Round duration - 15 minutes
Round difficulty - Easy

It was in the evening. Interviewer is there who is very calm and of friendly nature. It was very interesting session.

30 mins 20 questions

Based on Percentage,time,speed,coding

Q1. Like write the small codes
Ans. 
Demonstrate coding skills with small code snippets
• Use loops to iterate through arrays or perform repetitive tasks

• Implement basic algorithms like sorting or searching

• Show understanding of data structures like arrays, strings, or objects
Answered by AI
Add your answer
Q2. About your self and some basics about you prefered courses
Add your answer
Q3. Plzz inform to me any other company vacancies
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on C# and .NET core concepts.

Q1. What is inheritance in C#?
Ans. 
Inheritance is a mechanism in object-oriented programming where a class inherits properties and behaviors from another class.
• Inheritance allows code reuse and promotes code organization.

• A derived class can inherit from a base class and extend or modify its functionality.

• In C#, inheritance is achieved using the 'class' keyword and the ':' symbol.

• Example: class Dog : Animal { }

• The derived class can access the public and ...read more
Answered by AI
Add your answer
Q2. What is a class in object-oriented programming?
Ans. 
A class is a blueprint for creating objects in object-oriented programming.
• A class is a template that defines the properties and behaviors of objects.

• It encapsulates data and methods that operate on that data.

• Objects are instances of a class, created using the class blueprint.

• Classes support inheritance, allowing for the creation of subclasses with additional or modified functionality.
Answered by AI
Add your answer
Q3. What is an abstract class?
Ans. 
An abstract class is a class that cannot be instantiated and is meant to be subclassed.
• An abstract class serves as a blueprint for other classes.

• It can have both abstract and non-abstract methods.

• Abstract methods are declared without an implementation and must be implemented by the subclasses.

• An abstract class can have instance variables and constructors.

• It provides a common interface for all its subclasses.
Answered by AI
Add your answer
Q4. What is a destructor in object-oriented programming?
Ans. 
A destructor is a special member function in object-oriented programming that is used to destroy an object.
• Destructors are called automatically when an object goes out of scope or is explicitly deleted.

• They are used to release resources held by the object, such as memory or file handles.

• Destructors have the same name as the class preceded by a tilde (~).

• They do not have return types or parameters.

• Example: class MyClass...read more
Answered by AI
Add your answer
Q5. What is an interface?
Ans. 
An interface is a programming construct that defines a contract for classes to implement certain methods or behaviors.
• An interface provides a way to achieve multiple inheritance in programming languages that do not support it.

• Interfaces are used to achieve loose coupling and promote code reusability.

• Classes that implement an interface must provide an implementation for all the methods defined in the interface.

• Interface...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

Q1. 
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...read more
Ans. 
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
• Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

• Compare the two lists and find the last common node.

• Return the last common node as the lowest common ancestor.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Ans. 
The problem is to find a subarray with the maximum sum in a given array.
• Iterate through the array and keep track of the maximum sum and the current sum.

• If the current sum becomes negative, reset it to 0.

• Update the maximum sum if the current sum is greater.

• Also keep track of the start and end indices of the subarray with the maximum sum.

• Return the subarray using the start and end indices.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in an array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that have a greater element to their right.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empty, the...read more
Answered by AI
Add your answer
Q2. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right side of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

• Sum up the amount of water trapped at each bar to get the total amo...read more
Answered by AI
View 5 more answers

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc