Filter interviews by
I applied via Company Website and was interviewed in Feb 2022. There was 1 interview round.
Kangaroo rats and desert mice are known to survive without drinking water.
Kangaroo rats and desert mice have adapted to arid environments and obtain water from the food they eat.
These animals have highly efficient kidneys that minimize water loss.
They can also conserve water by producing highly concentrated urine.
Kangaroo rats can obtain sufficient moisture from the metabolic breakdown of seeds they consume.
Desert mice...
Top trending discussions
Absolute xpath specifies the complete path from the root element to the desired element, while relative xpath specifies the path relative to the current element.
Absolute xpath starts with a single forward slash (/) and is more specific.
Relative xpath starts with a double forward slash (//) and is more flexible.
Absolute xpath is more prone to breaking if the structure of the page changes.
Relative xpath is easier to main...
Operating system data base management system
I am a dedicated and hardworking individual with a passion for learning and growth.
I have a background in finance and have worked in the industry for 5 years.
I am currently pursuing my MBA to further enhance my skills and knowledge.
I am a team player and enjoy collaborating with others to achieve common goals.
I led a team to develop a mobile app for tracking fitness goals and progress.
Responsible for project planning, design, and implementation
Collaborated with developers, designers, and stakeholders
Implemented features such as goal setting, workout tracking, and progress visualization
I applied via Company Website and was interviewed in Aug 2023. There were 2 interview rounds.
I applied via Referral and was interviewed before Jul 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed in Mar 2022. There was 1 interview round.
I applied via Walk-in and was interviewed before Jul 2020. There were 3 interview rounds.
I appeared for an interview before Feb 2023.
Java and micro service design patterns involve structuring code for scalability and flexibility.
Use of design patterns like Singleton, Factory, and Observer for creating microservices in Java.
Implementing Circuit Breaker pattern to handle failures and prevent cascading failures in microservices architecture.
Applying API Gateway pattern to manage and secure communication between microservices.
Utilizing Service Registry ...
Java 8 introduced several new features such as lambda expressions, functional interfaces, streams, and default methods.
Lambda expressions allow for more concise code by enabling functional programming.
Functional interfaces are interfaces with a single abstract method, which can be implemented using lambda expressions.
Streams provide a way to process collections of objects in a functional style.
Default methods allow int...
I appeared for an interview before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
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.
based on 1 review
Rating in categories
Legal Associate
10
salaries
| ₹3 L/yr - ₹6 L/yr |
Advocate
5
salaries
| ₹3.6 L/yr - ₹6 L/yr |
Advocate Lawyer
5
salaries
| ₹4.2 L/yr - ₹8 L/yr |
Senior Associate
4
salaries
| ₹3.8 L/yr - ₹6.6 L/yr |
Court Clerk
4
salaries
| ₹3.2 L/yr - ₹5 L/yr |
Amazon Sellers Services
Primus Global Technologies
GAMMON INDIA
Practo