Filter interviews by
I applied via Approached by Company and was interviewed before Jul 2021. There was 1 interview round.
Moderating focus groups requires preparation, active listening, and effective communication.
Prepare a discussion guide to keep the conversation on track
Encourage participation from all group members
Listen actively to what participants are saying and ask follow-up questions
Facilitate respectful and constructive dialogue among participants
Avoid expressing personal opinions or biases
Be aware of nonverbal cues and body lan...
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
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)
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I appeared for an interview before Jun 2016.
I am a passionate software developer with 5 years of experience in web development and a strong background in computer science.
5 years of experience in web development
Strong background in computer science
Passionate about software development
To separate personal and professional calls, and to ensure availability and accessibility.
Separate personal and professional calls
Ensure availability and accessibility
Maintain work-life balance
Avoid mixing personal and work-related contacts
I appeared for an interview before Jun 2016.
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MongoDB and MySQL
Familiar with version control systems like Git and deployment tools like Heroku
I appeared for an interview before Jul 2016.
I am a passionate software engineer with experience in developing web applications and solving complex problems.
Experienced in developing web applications using technologies like HTML, CSS, JavaScript, and React
Skilled in problem-solving and debugging code to ensure optimal performance
Strong understanding of data structures and algorithms
Familiar with Agile development methodologies and version control systems like Git
I appeared for an interview before May 2016.
You need to take 36 turns to find a perfect pair.
You need to pick 19 gloves to ensure a perfect pair.
The worst case scenario is picking 18 white gloves and then the 19th glove is black.
In that case, you need to pick 17 more gloves to find a black one and complete the pair.
The seven layers of networking refer to the OSI model which defines how data is transmitted over a network.
The seven layers are: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has a specific function and communicates with the layers above and below it.
For example, the Physical layer deals with the physical transmission of data, while the Application layer deals with user inte...
Sort a list of people by their cities and states.
Use a sorting algorithm like quicksort or mergesort.
Create a custom comparator function that compares the city and state of each person.
If two people belong to the same city and state, sort them by their names.
Example: [{name: 'John', city: 'New York', state: 'NY'}, {name: 'Jane', city: 'Boston', state: 'MA'}]
Example output: [{name: 'Jane', city: 'Boston', state: 'MA'},
TCS
Accenture
Wipro
Cognizant