Filter interviews by
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Medium
Timing- 9AM-5PM, can give anytime in the time interval.
We where monitored using webcam durning the online Test.
The online test consisted of many sections-
a-Aptitude
b-English Comprehension
c-Logical
d-Error Spoting(CODE)
e-Writting
You are given an array of N elements that represent the digits of a number. You can perform one swap operation to exchange the values at any two indices. Your task is to de...
Given an array of digits, swap two elements to get the maximum number possible.
Iterate through the array to find the maximum digit.
Swap the maximum digit with the leftmost occurrence of that digit.
If the maximum digit is already at the leftmost position, swap it with the second largest digit.
Round duration - 15 Minutes
Round difficulty - Easy
It was a virtual Interview.
Basically the interviewer did not asked any technical question, i just had a great talk about java and python programing language with the interviewer.
Addition to this interviewer asked me to introduced myself and later we discussed my final year project idea.
It was a great talk.
Python is likely to be more powerful in the future due to its simplicity, versatility, and popularity.
Python is known for its simplicity and readability, making it easier for beginners to learn and use.
Python has a wide range of applications, from web development to data analysis and machine learning.
Python's popularity is continuously growing, with a large community of developers contributing to its libraries and fram...
Tip 1 : Practice programming
Tip 2 : Understand the logic behind the data structure rather than just memorize the concept
Tip 1 : Be pretty confident about the things you write in your Resume.
Tip 2 : Highlight your achievements and Knowledge in your resume.
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Medium
Amcat Test ( WebCam On and in Proctored mode)
The First round was divided into multiple sections Logical, aptitude, English comprehensive writing and Error Handling For given C++ and Java Programs( 6 Programs were there), Each section was time bounded.
Round duration - 30 minutes
Round difficulty - Easy
It was a virtual interview round. The platform consist of an online IDE, Video of Interviewer and a chat window.
Interviewer asked me Tell me about yourself, then programs on patterns , string handling , SQL queries and OOPs concept.
In the End he asked me about my projects and on what project i am currently working. why you want to join DXC. How you got to know about DXC. Do you want to pursue higher education.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the length of the string and the number of test cases.
An inner join combines rows from two tables based on a related column between them.
An inner join returns rows when there is at least one match in both tables based on the join condition.
It is commonly used to retrieve data from multiple tables that have a relationship.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column;
Tip 1 : Practice Aptitude Questions from IndiaBix
Tip 2 : Know Fundamental concepts of every subject you studied in Engineering
Tip 3 : Chose one Programming Language i prefer C++ or Java, Solve Data Structures Problems, Most Frequently asked codes from GeeksForGeeks, Practice at Leetcode
Tip 4 : Be prepared for Behavioural Questions, there are only some set of FAQs that can be followed from youtube vedios.
Tip 5 : Have atleast 1 good technical Project, and Use Technical keywords to mention that project in your Resume.
Tip 6 : Be humble in Interviews.
Tip 7 : Practice at Leetcode atleast top 100 questions.
Tip 1 : Don't put anything in resume that you are not sure of.
Tip 2 : if you don't have any internship experience then you can show your good technical projects and certifications too.
Tip 3 : Use professional Keywords in your resume.
Tip 4 : Highlight your Skills and Achievements. Put only those skills in which you are good like any question can be asked on any particular skill. Like how you will do this in this.
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 Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I appeared for an interview before Feb 2021.
Time - 60mins
Time- 30mins
TCS
Accenture
Cognizant
Infosys