Filter interviews by
JDK stands for Java Development Kit, which is a set of tools used for developing Java applications.
JDK includes the Java Runtime Environment (JRE), an interpreter/loader (Java), a compiler (javac), an archiver (jar), a documentation generator (Javadoc), and other tools.
It provides everything needed to develop, compile, debug, and run Java programs.
JDK is platform-independent and can be used on various operating systems
I applied via Walk-in and was interviewed in Dec 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
I am a highly motivated and detail-oriented individual with a background in marketing and a passion for data analysis.
Background in marketing
Passion for data analysis
Highly motivated and detail-oriented
I chose BPO because of the opportunity to work with diverse clients, develop strong communication skills, and gain valuable experience in a fast-paced environment.
Opportunity to work with diverse clients
Develop strong communication skills
Gain valuable experience in a fast-paced environment
I am a highly motivated and detail-oriented individual with a background in marketing and a passion for project management.
Background in marketing
Passion for project management
Detail-oriented
Highly motivated
Sales is the process of selling products or services to customers by understanding their needs and providing solutions.
Build rapport with the customer by actively listening and asking questions to understand their needs
Highlight the benefits of the product or service that meet the customer's needs
Handle objections by addressing concerns and providing additional information or alternatives
Close the sale by asking for th...
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Asked array questions medium level
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
Find the celebrity in a party of N people where only one person is known to everyone.
The celebrity doesn't know anyone in the party.
We can use a stack to keep track of potential celebrities.
If a person knows someone, they cannot be a celebrity.
If a person doesn't know someone, we can push them onto the stack.
After iterating through all people, we check if the stack has only one person and if that person is known to eve
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
I applied via Company Website and was interviewed in Apr 2022. There were 2 interview rounds.
Rejaning
Programing
based on 1 interview
Interview experience
Technical Lead
3
salaries
| ₹24 L/yr - ₹24 L/yr |
Product Manager
3
salaries
| ₹7 L/yr - ₹15 L/yr |
Marketing Manager
3
salaries
| ₹9 L/yr - ₹9 L/yr |
Udaan
Swiggy
CARS24
BlackBuck