ZeroCodeHR Team Lead Interview Questions and Answers

It’s an average test experience

Best questions with tricky one

Q1. Salary expectations
Add your answer

Q1. What is useState?
Ans. 
useState is a hook in React that allows functional components to have state.
• useState is a React hook used in functional components to manage state.

• It returns an array with the current state value and a function to update that value.

• Example: const [count, setCount] = useState(0);
Answered by AI
Add your answer
Q2. What's useEffect?
Ans. 
useEffect is a hook in React that allows performing side effects in function components.
• Used in React functional components to perform side effects

• Executes after render and after every update

• Can be used to fetch data, subscribe to events, update the DOM, etc.
Answered by AI
Add your answer
Q3. What is Redux and state management?
Ans. 
Redux is a predictable state container for JavaScript apps. It helps manage the state of an application in a centralized way.
• Redux is a state management library commonly used with React.

• It allows for a single source of truth for the state of an application.

• Actions are dispatched to update the state, and reducers specify how the state changes in response to actions.

• Redux DevTools can be used to track state changes and d...read more
Answered by AI
Add your answer

Q1. Tell Me about yourself
Add your answer
Q2. What is C# and coding.
Add your answer

Q1. What is your CCTC?
Add your answer

2 easy level coding questions to be solved

Q1. One dsa question which needs to be live coded in 45 mins
Add your answer

Q1. Same as first round . But 2 coding questions might be asked
Add your answer

Q1. Did not happen . Don’t know why
Add your answer

It was an online test for interview

Q1. Tell me about dijistkras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

• It maintains a list of tentative distances to each node and updates them as it explores the graph.

• The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

• Example:...read more
Answered by AI
Add your answer
Q2. Tell me about your projects
Add your answer

Q1. Too much delay in all the interviews process
Add your answer
Q2. Qrelated to pay are so many very stinge Hr
Add your answer

Q1. To much discussions on pay
Add your answer

4 coding ques + 15 technical aptitude

4 Coding Ques + 10 technical aptitude

Q1. Coding question
Add your answer
Q2. Group by query, dbms
Add your answer

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

Q1. 
Aggressive Cows Problem Statement
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...read more
Ans. 
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search ...read more
Answered by AI
Add your answer
Q2. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Ans. 
The problem is to find the shortest path between two houses in an unweighted graph.
• The graph represents the city of Ninjaland with houses connected by roads.

• The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

• The output is a vector of nodes representing the shortest path from the starting house to the ending house.

• If there are multiple shor...read more
Answered by AI
Add your answer
Q3. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
• Convert each number from 1 to N into its binary representation

• Count the number of '1' bits in each binary representation

• Sum up the counts of '1' bits for all numbers

• Return the sum modulo 1e9+7
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
• Split the string into words using spaces as delimiters

• Reverse the order of the words

• Join the reversed words with a single space between them

• Remove any leading or trailing spaces
Answered by AI
Add your answer
Q2. 
Reverse Linked List in Groups of K
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...read more
Ans. 
The task is to reverse a linked list in groups of size K.
• Iterate through the linked list in groups of size K

• Reverse each group using a helper function

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

Q1. 
Remove Consecutive Duplicates From String Problem Statement
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, add the current character to the new string

• Return the new string
Answered by AI
Add your answer
Q2. 
Maximum Path Sum in a Matrix
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...read more
Ans. 
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
• Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

• For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

• Store the maximum sum path ending at each cell in a se...read more
Answered by AI
Add your answer