Filter interviews by
I have consistently exceeded targets, led successful projects, and contributed to team growth and development.
Achieved a 20% increase in recruitment efficiency by implementing a new applicant tracking system.
Led a team of 5 in a project that reduced time-to-hire from 45 to 30 days.
Developed a training program for new recruiters, resulting in a 15% improvement in onboarding satisfaction scores.
Successfully filled 100+ p...
I applied via Walk-in and was interviewed in Aug 2023. There were 3 interview rounds.
Aptitude rounds includes all the basic questions of the ds,oops,java,os questions
I applied via Recruitment Consulltant and was interviewed before Nov 2021. There were 2 interview rounds.
Core Java concepts include OOP, inheritance, polymorphism, encapsulation, and abstraction.
Object-oriented programming (OOP) is a programming paradigm based on the concept of objects.
Inheritance allows a class to inherit properties and methods from another class.
Polymorphism allows objects to take on multiple forms or behaviors.
Encapsulation is the practice of hiding data and methods within a class.
Abstraction is the pr...
Java 8 features like streams and lambdas make collections more efficient and concise.
Java 8 introduced streams which allow for functional-style operations on collections.
Lambdas can be used to define custom operations on collections.
The 'filter' method can be used to select elements from a collection based on a condition.
The 'map' method can be used to transform elements in a collection.
The 'reduce' method can be used ...
Java program to solve vehicle-manufacturer relationship problem using custom objects
Create custom Java objects for vehicle and manufacturer
Establish relationship between them using appropriate data structures
Write a program to solve the problem using the objects and their relationships
Use object-oriented programming principles to ensure code reusability and maintainability
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
based on 5 interviews
Interview experience
based on 23 reviews
Rating in categories
Information Technology Recruiter
16
salaries
| ₹2.7 L/yr - ₹3.5 L/yr |
Enterprise Application Engineer
5
salaries
| ₹12 L/yr - ₹16 L/yr |
Oracle SCM Functional Consultant
4
salaries
| ₹11 L/yr - ₹16 L/yr |
Technical Lead
3
salaries
| ₹25 L/yr - ₹38 L/yr |
Project Engineer
3
salaries
| ₹3.8 L/yr - ₹5 L/yr |
Infosys
TCS
Wipro
HCLTech