Filter interviews by
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
posted on 29 Dec 2022
I applied via Naukri.com and was interviewed in Nov 2022. There were 2 interview rounds.
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 before Feb 2021.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 1 question related to DSA and then the majority of the questions were revolving around Java.
Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.
...Round duration - 60 Minutes
Round difficulty - Medium
In this round, I had 2 questions of DSA where I had to first explain my approach with proper compleixt analysis and then write the pseudo code for both of them. After that, I was asked some questions from Java and MVC architecture.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Round duration - 60 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from MVC.
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.
A binary tree is balanced if the height of its left and right subtrees differ by at most 1.
A balanced binary tree has a smoother and faster search time than an unbalanced one.
Balancing a binary tree can be done using various algorithms like AVL tree, Red-Black tree, etc.
An example of a balanced binary tree is the AVL tree, where the heights of the left and right subtrees differ by at most 1.
posted on 29 Mar 2015
The algorithm for the upcoming semester project involves developing an application.
Identify the requirements and objectives of the project
Design the application architecture and user interface
Implement the necessary algorithms and data structures
Test and debug the application
Optimize the performance and efficiency of the code
Document the project for future reference
My favorite subject is computer science.
I enjoy learning about algorithms and data structures.
I find programming languages fascinating and love exploring their features.
I am passionate about software development and enjoy creating applications.
I find the process of problem-solving in application development fulfilling.
I appreciate the continuous learning opportunities in this field.
Implementing queue using linked lists
Create a Node class with data and next pointer
Create a Queue class with head and tail pointers
Enqueue by adding a new node at the tail and dequeue by removing the head node
Check for empty queue by checking if head is null
Reverse a string
Use a loop to iterate through the string and append each character to a new string in reverse order
Alternatively, use the built-in reverse() method for strings in some programming languages
Count the number of palindromes in a given string.
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Iterate through the string and check if each substring is a palindrome.
Use two pointers, one at the beginning and one at the end of the substring, and move them towards each other until they meet in the middle.
If the substring is a palindrome, increment the c...
Interfaces in Java define a contract for classes to implement certain methods.
Interfaces are like a blueprint for classes to follow
They can contain method signatures but no implementation
Classes can implement multiple interfaces
Interfaces can extend other interfaces
Example: Comparable interface for sorting objects
Overloading is when multiple methods have the same name but different parameters. Overriding is when a subclass provides a different implementation of a method inherited from its superclass.
Overloading allows a class to have multiple methods with the same name but different parameters.
Overriding occurs when a subclass provides a different implementation of a method inherited from its superclass.
Overloading is resolved ...
Abstract classes in Java are classes that cannot be instantiated and are used as blueprints for other classes.
Abstract classes cannot be instantiated, meaning you cannot create objects of an abstract class.
Abstract classes can have both abstract and non-abstract methods.
Interfaces in Java are similar to abstract classes, but they cannot have any method implementations.
A class can implement multiple interfaces, but it c...
Find the fifth largest element in a linked list
Traverse the linked list and store the elements in an array
Sort the array in descending order
Return the fifth element in the sorted array
Find the common ancestor of two given nodes in a tree
Traverse the tree from the root node
Check if both nodes are on the same side of the current node
If not, return the current node as the common ancestor
If yes, continue traversing down that side of the tree
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the largest element from the unsorted region and inserts it into the sorted region.
It has a worst-case and average-case time complexity of O(n log n).
Find duplicates in an array
Iterate through the array and compare each element with the rest of the elements
Use a hash table to keep track of the frequency of each element
Sort the array and compare adjacent elements
Use a set to keep track of unique elements and add duplicates to another set
Merge two sorted linked lists
Create a new linked list to store the merged list
Compare the first nodes of both lists and add the smaller one to the new list
Move the pointer of the added node to the next node
Repeat until one of the lists is empty, then add the remaining nodes to the new list
Explanation of three normalizations with examples
First Normal Form (1NF): Eliminate duplicate data and create separate tables for related data
Example: A table with customer information and their orders should be split into two tables
Second Normal Form (2NF): Ensure non-key attributes are dependent on the primary key
Example: A table with customer information and their orders should have separate tables for customer and ...
To find the maximum salary in emp table, use the MAX function on the salary column.
Use the MAX function in SQL to find the highest value in a column
Specify the column name after the MAX function, in this case 'salary'
Example: SELECT MAX(salary) FROM emp
This will return the highest salary value in the emp table
Query to find the employee with highest salary and their department.
Use MAX() function to find the highest salary.
Join the employee and department tables using the department ID.
Select the name and department of the employee with the highest salary.
Semaphore allows multiple threads to access shared resources at the same time, while mutex allows only one thread at a time.
Semaphore is used to control access to a resource with limited capacity, like a printer or database connection pool.
Mutex is used to protect a shared resource from simultaneous access, like a critical section of code.
Semaphore can have a count greater than 1, allowing multiple threads to access th...
The minimum number of races required to find the top 3 among 25 horses is 7.
Divide the 25 horses into 5 groups of 5 horses each.
Race the 5 groups, which will give us the top 3 horses from each group.
Now we have 15 horses remaining.
Race the top 3 horses from each group, which will give us the top 3 horses overall.
This requires a total of 7 races.
Undo operation (ctrl + z) is implemented by maintaining a stack of previous states.
When a change is made, the current state is pushed onto the stack
When undo is called, the top state is popped and applied
Redo is implemented by maintaining a stack of undone states
Some applications may also implement a limit on the number of undo/redo steps
Undo/redo can be implemented at different levels (e.g. character, word, paragraph)
8 Queens Algorithm is a backtracking algorithm to place 8 queens on a chessboard without attacking each other.
The algorithm places one queen in each column, starting from the leftmost column.
If a queen can be placed in a row without attacking another queen, it is placed there.
If no such row exists, the algorithm backtracks to the previous column and tries a different row.
The algorithm continues until all 8 queens are p...
The time complexity of 8 queens algorithm is O(n!).
The algorithm checks all possible permutations of the queens on the board.
The number of permutations is n! where n is the number of queens.
For 8 queens, there are 8! = 40,320 possible permutations.
The algorithm has to check each permutation to find a valid solution.
Therefore, the time complexity is O(n!).
Towers of Hanoi is a classic problem of moving disks from one peg to another with specific rules.
The problem involves three pegs and a number of disks of different sizes.
The goal is to move all the disks from the first peg to the third peg, while following the rules.
The rules are: only one disk can be moved at a time, a larger disk cannot be placed on top of a smaller disk, and all disks must be moved to the third peg.
...
ER diagrams are used to visualize and design relational databases.
ER diagrams show the relationships between entities in a database
They help in identifying the attributes of each entity
They aid in designing the structure of a database
ER diagrams are commonly used in software development
My favorite program is Visual Studio Code because of its user-friendly interface and extensive plugin library.
User-friendly interface with customizable settings
Extensive plugin library for various programming languages and tools
Integrated terminal and debugging features
Supports Git version control
Frequent updates and improvements
Free and open-source
Examples: Python, JavaScript, HTML/CSS, Git
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Senior Consultant
1.3k
salaries
| ₹5.8 L/yr - ₹21 L/yr |
Staff Consultant
1.1k
salaries
| ₹4.5 L/yr - ₹13.6 L/yr |
Associate Consultant
1.1k
salaries
| ₹3.2 L/yr - ₹10 L/yr |
Principal Consultant
717
salaries
| ₹10 L/yr - ₹29 L/yr |
Application Developer
492
salaries
| ₹6 L/yr - ₹23 L/yr |
Oracle
TCS
Infosys
Wipro