Filter interviews by
Clear (1)
I was interviewed in Nov 2020.
Round duration - 180 minutes
Round difficulty - Easy
The exam was conducted from home via the software designed by TCS. The test consists of logical reasoning, Verbal Ability, Numerical Ability, Programming Logic questions. It was a medium level difficulty test.
You are given a doubly linked list of integers along with a positive integer K
that represents the group size. Your task is to modify the linked list by reversin...
Reverse groups of K nodes in a doubly linked list.
Iterate through the linked list in groups of K nodes
Reverse each group of K nodes
Handle cases where the number of nodes is less than K
Update the pointers accordingly
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in-place using a single scan.
Iterate through the array and maintain three pointers for 0s, 1s, and 2s.
Swap elements based on the current element's value and the pointers.
Example: If current element is 0, swap with the 0s pointer and increment both pointers.
Round duration - 40 minutes
Round difficulty - Easy
The interview was scheduled in the day. The interviewer asked some HR type questions although it was my technical interview. Salary expectations, work location choices, management questions, etc. formed a big part of the interview. Then typical questions around the concept of OOPS, networking, DBMS fill the remaining time.
Questions like searching and sorting and projects were focused in the other half of the interview.
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.
The Merge Sort...
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.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balanced Binary Search Tree (BST) using th...
Convert a sorted linked list into a Balanced Binary Search Tree (BST) using the same data values.
Create a function to convert the linked list to a BST by recursively dividing the list into halves
Maintain a pointer to the middle element of the list as the root of the BST
Recursively set the left and right children of the root using the left and right halves of the list
Perform level order traversal to output the values of
Tip 1 : Have a good grasp on the project topics mentioned in the resume.
Tip 2 : Machine Learning projects are a big plus.
Tip 3 : Your "Tell me about yourself" should be impressive.
Tip 1 : Please only mention the things you really know about. It's very important.
Tip 2 : Machine learning projects in the resume is a big plus.
Top trending discussions
I applied via Campus Placement and was interviewed before Feb 2021. There were 3 interview rounds.
Aptitude round consists Logical reasoning, General Aptitude, Grammar related questions etc. All are moderate level questions.
OOPs is a programming paradigm that uses objects to represent real-world entities. Java is an OOPs language.
OOPs stands for Object-Oriented Programming System
Java is a class-based OOPs language
Encapsulation, Inheritance, Polymorphism, and Abstraction are the four pillars of OOPs
Objects have state and behavior
Java supports interfaces, which allow for multiple inheritance
Example: A car can be represented as an object wit...
Java solves machine dependency by using bytecode and virtual machine.
Java code is compiled into bytecode which is platform-independent
The bytecode is executed by the Java Virtual Machine (JVM) which is platform-specific
JVM translates bytecode into machine code for the specific platform
This allows Java code to run on any platform with a JVM installed
Example: A Java program compiled on Windows can run on Linux or Mac as
I applied via Campus Placement and was interviewed before Feb 2021. There were 3 interview rounds.
The medium level questions are present
There was no gd
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
It was a basic aptitude test.
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
- basic programming on C
I applied via Campus Placement and was interviewed before Oct 2021. There were 3 interview rounds.
English reasoning and logical question
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
English is the main focussed part
Operations Executive
253
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
151
salaries
| ₹0 L/yr - ₹0 L/yr |
System Engineer
126
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
118
salaries
| ₹0 L/yr - ₹0 L/yr |
IT Manager
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Wipro
Amazon
TCS
Infosys