Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
In second round they asked about Data Structure questions and also some Database related things along with a little discussion on my project.
Top trending discussions
posted on 3 May 2024
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
It was machine coding round- given problem statement you have to code the entire application in java in 90 minutes
posted on 20 Dec 2024
I applied via campus placement at Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT), Gandhinagar and was interviewed in Nov 2024. There were 4 interview rounds.
Five coding questions along with technical questions focusing on Object-Oriented Programming (OOP) and the expected output of Java programs.
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Graduated with a degree in Computer Science
Proficient in programming languages such as Java, Python, and C++
Completed internships at tech companies like Google and Microsoft
Enthusiastic about learning new technologies and collaborating with team members
The candidate is asked to solve three common coding problems related to binary trees, strings, and matrices.
To find the height of a binary tree, you can use a recursive function to traverse the tree and calculate the height at each node.
To find the first repeating character in a string, you can use a hashmap to store the frequency of each character and then iterate through the string to find the first character with a ...
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Test contains 26 questions for me 13 are java based 13 are c++ based
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
Types of indexes include clustered, non-clustered, unique, and composite indexes.
Examples of indexing techniques include B-tree, hash, and bitmap indexes.
Indexing can...
Check if two strings are anagrams by comparing the sorted characters in each string.
Sort the characters in both strings and compare if they are equal.
Ignore spaces and punctuation when comparing the strings.
Example: 'listen' and 'silent' are anagrams.
Example: 'hello' and 'world' are not anagrams.
Use a stack to simulate the recursive inorder traversal process
Create an empty stack to store nodes
Start with the root node and push it onto the stack
While the stack is not empty, keep traversing left and pushing nodes onto the stack
Once you reach a leaf node, pop it from the stack, print its value, and move to its right child
Repeat the process until all nodes have been visited
To make a class final, use the 'final' keyword in the class declaration.
Use the 'final' keyword before the 'class' keyword in the class declaration
A final class cannot be subclassed or extended
Final classes are often used for utility classes or classes that should not be modified
A string is a sequence of characters used to represent text.
Strings are typically enclosed in quotation marks
Strings can contain letters, numbers, symbols, and spaces
Strings can be manipulated using various string functions
An array is a data structure that stores a collection of elements of the same type in a contiguous memory location.
Arrays can be of different types such as integer arrays, float arrays, or string arrays.
Example: string[] names = {"Alice", "Bob", "Charlie"};
Arrays in most programming languages are zero-indexed, meaning the first element is at index 0.
Arrays allow for efficient access and manipulation of elements based o
Very few question asking like time and work
posted on 15 Jan 2025
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
I applied via Campus Placement
90 mins, easy, Data structures and algorithm basics
Remove duplicates from array of strings in place
Use a HashSet to keep track of unique elements
Iterate through the array and remove duplicates by checking if element is already in the HashSet
Update the array in place by shifting elements to fill in the removed duplicates
Caching is the process of storing data in a temporary location to reduce access time and improve performance.
Caching helps reduce the load on servers by serving frequently accessed data quickly
It can improve performance by reducing the time needed to retrieve data from the original source
Examples include browser caching, CDN caching, and database caching
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
I was interviewed in Jul 2024.
2 Graph question of leetcode
I applied via campus placement at Pondicherry University and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude with tracing program
3 problem with easy to hard
based on 2 reviews
Rating in categories
Assistant Manager
40
salaries
| ₹6 L/yr - ₹12.8 L/yr |
Software Developer
31
salaries
| ₹5 L/yr - ₹18 L/yr |
Senior Executive
31
salaries
| ₹3 L/yr - ₹8.2 L/yr |
Senior Software Developer
25
salaries
| ₹5.7 L/yr - ₹22.1 L/yr |
Product Manager
21
salaries
| ₹14 L/yr - ₹41 L/yr |
Paytm
Ticket New
PVR Inox
Cinépolis