Filter interviews by
Garbage collector algorithm manages memory allocation and deallocation in a program.
Garbage collector automatically frees up memory that is no longer in use.
It identifies and removes objects that are no longer referenced by the program.
There are different types of garbage collector algorithms such as mark-and-sweep, reference counting, and generational.
Java and .NET languages use garbage collector by default.
Garbage co...
Top trending discussions
Classes can have both implementation and data members, while interfaces can only have method signatures.
Classes can have constructors, interfaces cannot.
Classes can have access modifiers for their members, interfaces cannot.
A class can implement multiple interfaces, but can only inherit from one class.
Interfaces are used to achieve abstraction and multiple inheritance in Java.
Example: Class 'Animal' can have methods li...
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
Asked QRE question and some query questions
I am a passionate application developer with experience in creating innovative solutions for various industries.
Experienced in developing web and mobile applications using languages such as Java, JavaScript, and Swift
Proficient in database management and integration with applications
Strong problem-solving skills and ability to work in a team environment
Familiar with Agile development methodologies and continuous integr
I am familiar with a variety of technologies including Java, Python, SQL, HTML, CSS, JavaScript, and Git.
Java
Python
SQL
HTML
CSS
JavaScript
Git
I was interviewed in Jun 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This was a proctured online coding test where we had 2 questions to solve under 60 minutes.
Given an array COORDINATES
representing the integer coordinates of some points on a 2D plane, determine the minimum cost required to connect all points...
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...
Round duration - 60 Minutes
Round difficulty - Medium
This round had 1 question of DSA followed by some questions from DBMS and Java. I was also made to execute a SQL query at the end.
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Round duration - 60 Minutes
Round difficulty - Medium
This round had two preety straight forward questions related to DSA and then there were 2 puzzles.
You are provided with a matrix of characters, CHARACTER_MATRIX
of size M x N
, and a string WORD
. Your goal is to locate and display all occurrences of the string within the ...
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...
Round duration - 30 Minutes
Round difficulty - Easy
This was a typical HR round with some standard Behavioral questions.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Naukri.com and was interviewed in Nov 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
I applied via campus placement at Chaitanya Bharathi Institute of Technology, Hyderabad and was interviewed before Jun 2020. There were 4 interview rounds.
Print all possible paths from start to end in a linear way, moving either one or two steps right.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths to each position
Start from the end position and work backwards
At each position, calculate the number of paths by summing the number of paths from the next two positions
Print all the paths by backtracking from the start position
The program prints the substring after a specified character has occurred a certain number of times in a given string.
Iterate through the string to find the specified character.
Keep track of the count of occurrences of the character.
Once the count reaches the specified count, extract the substring after that position.
Handle corner cases such as when the character is not in the string or when it doesn't occur the specif
Design a website similar to bookmyshow.com for booking cinema tickets for a single location with multiple theatres.
Design a user-friendly GUI with options for advance booking, user login, user registration, movie rating, and saving card details.
Create relevant database tables to store information about movies, theatres, bookings, user details, and card details.
Link the GUI to the database to enable data flow and retrie...
The code prints the transpose of a given matrix.
Iterate through each row and column of the matrix.
Swap the elements at the current row and column with the elements at the current column and row.
Print the transposed matrix.
Code to find the middle element of a linked list
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 element
If the linked list has even number of elements, return the second middle element
Multitasking is the ability of an operating system to run multiple tasks concurrently while multiprogramming is the ability to run multiple programs concurrently.
Multitasking allows multiple tasks to run concurrently on a single processor system.
Multiprogramming allows multiple programs to run concurrently on a single processor system.
Multitasking is achieved through time-sharing, where the processor switches between t...
The code inserts two numbers in a text file, ensuring that the second number is greater than the first and there is no overlap between entries.
Read the existing entries from the text file
Check if the new numbers satisfy the conditions
If conditions are met, insert the new numbers into the file
Otherwise, display an error message
Code to count the number of times '1' occurs from 1 to 999999
Loop through all numbers from 1 to 999999
Convert each number to a string and count the number of '1's in it
Add the count to a running total
Return the total count
based on 9 reviews
Rating in categories
Senior Member Technical
1.6k
salaries
| ₹7 L/yr - ₹21.5 L/yr |
Senior Process Associate
1.4k
salaries
| ₹2 L/yr - ₹8.2 L/yr |
Analyst
1.3k
salaries
| ₹2.9 L/yr - ₹10.5 L/yr |
Consultant
1.2k
salaries
| ₹10 L/yr - ₹40 L/yr |
Member Technical
877
salaries
| ₹3.5 L/yr - ₹11.4 L/yr |
TCS
Infosys
Wipro
HCLTech