Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
Two questions in python simple and two questions in Java all four must be excuted
I applied via Walk-in and was interviewed before Apr 2023. There were 2 interview rounds.
EASY and Basics need to be Strong
DSA based questions and hard
I applied via Company Website
Present a solution for a machine learning problem and create a PowerPoint presentation.
I applied via LinkedIn and was interviewed in Nov 2024. There were 2 interview rounds.
Oops in python asked
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Types of inheritance include single inheritance, where a class inherits from only one parent class, and multiple inheritance, where a class inherits from multiple parent classes.
Inheritance allows for code reusability and promotes the concept of hierarchical classification.
Example: Class B inheriti
I appeared for an interview in Aug 2021.
Round duration - 180 minutes
Round difficulty - Medium
It was a long round of around 3 hours divided into 2 parts
1. Aptitude(MCQ)
2. Coding(Subjective)
You are tasked with scheduling meetings in a single meeting room. Given N
meetings, each with a start time Start[i]
and end time End[i]
, determine the maximum number of meetings...
Given start and end times of meetings, find the maximum number of meetings that can be scheduled in a single room.
Sort the meetings based on their end times in ascending order.
Iterate through the sorted meetings and select the ones that do not overlap with the previously selected meetings.
Keep track of the selected meetings and return their indices.
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...
The problem involves dividing an array into K subsets with equal sum.
Use backtracking to try all possible combinations of subsets.
Keep track of the sum of elements in each subset and check if they are equal to the target sum.
Optimize by sorting the array in descending order and assigning elements to subsets greedily.
Handle edge cases like when the sum of elements is not divisible by K.
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...
Merge k sorted linked lists into one single sorted linked list.
Create a min-heap to store the heads of all linked lists.
Pop the smallest element from the heap and add it to the result list.
If the popped element has a next element, push it back to the heap.
Repeat until all elements are merged into a single sorted list.
Given a doubly-linked list with N
nodes, where each node’s position deviates at most K
positions from its position in the sorted list, your task is to sort this given ...
Sort a doubly linked list where each node's position deviates at most K positions from its position in the sorted list.
Iterate through the doubly linked list and maintain a min-heap of size K+1 to keep track of the next smallest element.
Remove the smallest element from the heap and add it to the sorted list. Update the heap with the next element from the removed node's next position.
Continue this process until all node
Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...
Find root values of duplicate subtrees in a binary tree.
Traverse the tree in a bottom-up manner to identify duplicate subtrees.
Use a hashmap to store the subtree structures and their frequencies.
Return the root values of duplicate subtrees based on hashmap entries.
Round duration - 25 minutes
Round difficulty - Medium
The technical Interview round was not at all difficult. The main focus of the interviewer was my projects and development fields.
He also asked some DS/Algo questions that were at a medium level, and some easy questions for database management.
Keys in database management systems are unique identifiers for rows in a table.
Keys ensure data integrity by enforcing uniqueness and relationships between tables.
Primary key uniquely identifies each record in a table (e.g. employee ID).
Foreign key establishes a link between two tables by referencing the primary key of another table.
Round duration - 15 minutes
Round difficulty - Easy
It took place on the same day as the technical round. It was quite the easiest round of all. The interviewer just asked me to introduce myself, projects I have worked on, my Internships experience, and were they internships paid.
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impact a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
OOPs stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects, which can contain data and code.
OOPs allows for the organization of code into reusable components called objects.
Encapsulation, inheritance, and polymorphism are key principles of OOPs.
Examples of OOPs languages include Java, C++, and Python.
I appeared for an interview before Nov 2016.
I am a dedicated and experienced consultant with a strong background in problem-solving and client management.
Over 5 years of experience in consulting roles
Skilled in analyzing data and providing strategic recommendations
Excellent communication and interpersonal skills
Proven track record of successfully managing client relationships
Strong ability to work in fast-paced environments and meet deadlines
I appeared for an interview in Sep 2016.
Developed a web application for tracking student attendance and performance
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Integrated authentication and authorization features for secure access
based on 1 interview
Interview experience
Netsuite Technical Consultant
11
salaries
| ₹7 L/yr - ₹16 L/yr |
Technical Consultant
7
salaries
| ₹3.8 L/yr - ₹13.1 L/yr |
Training Consultant
6
salaries
| ₹4 L/yr - ₹5 L/yr |
Associate Consultant
5
salaries
| ₹4.3 L/yr - ₹5 L/yr |
Consultant
4
salaries
| ₹6.5 L/yr - ₹10.5 L/yr |
Cognizant
Sutherland Global Services
Optum Global Solutions
Hexaware Technologies