i
Tata CLiQ
Filter interviews by
I applied via Campus Placement
Efficient movement of goods
Supply chain management
Transportation and distribution
Inventory control
To streamline railway ticketing operations, I would implement online ticketing systems, automate processes, improve customer service, and optimize resource allocation.
Implement online ticketing systems to reduce manual ticketing processes and long queues.
Automate ticket booking, cancellation, and refund processes to save time and improve efficiency.
Improve customer service by providing self-service kiosks, mobile ticke...
BPO involves outsourcing of various business processes while call center is a subset of BPO that deals with customer support through phone calls.
BPO includes services like accounting, HR, and IT support while call center focuses solely on customer service through phone calls.
BPO involves outsourcing to third-party vendors while call centers can be in-house or outsourced.
BPO requires a broader skill set while call cente...
Covid has significantly impacted the middle class family.
Many middle class families have faced financial difficulties due to job losses or reduced income.
Remote work and online schooling have become the new norm, leading to additional expenses for technology and home office setup.
The pandemic has also caused mental health issues and increased stress levels for many families.
Travel plans and leisure activities have been...
I applied via Referral and was interviewed in Oct 2021. There were 3 interview rounds.
I remain calm and listen attentively to their concerns, taking breaks when necessary.
I take deep breaths and remind myself to stay calm
I listen attentively to their concerns without interrupting
I empathize with their situation and apologize for any inconvenience
I take breaks when necessary to avoid burnout
I focus on finding a solution to their problem
I maintain a positive attitude and avoid taking their frustration per
Tata CLiQ interview questions for popular designations
I applied via Recruitment Consultant and was interviewed in May 2021. There were 5 interview rounds.
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
The online round was conducted on Hackerearth around 11:30 PM
This round was an online coding plus MCQ round which includes 15 MCQ with positive 4 and negative 1 and 3 coding questions with two questions 10 marks and one was of 20 marks . MCQ were easy to medium and covers all the topic of Networks OOPS DBMS and CPP/JAVA
In Coding section one 20 marks question was medium and two 10 marks were of easy level, like if you practice regularly you can crack two 10 marks means you can score 20 marks out of 40 in coding
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
Iterate through each test case and check if destination is reachable from source using specified moves
Implement a recursive function to simulate the moves and check if destination is reached
Consider constraints to optimize the solution
Example: For input (1, 1, 3, 5), the output should be true as des
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 1D array to store the number of ways to make change for each value from 0 to the target value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the target index of the ar
In Ninja town, represented as an N * M
grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
Santa starts at (0, 0) and needs to reach (N-1, M-1) on Christmas Eve.
Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y).
Travel time between two buildings equals the absolute difference in their heights.
Find the quickest path with least travel time.
Example: For grid [[1, 3, 5], [2,
Round duration - 50 minutes
Round difficulty - Medium
It was a technical interview which was scheduled on 16th October 2020 at 10:00 AM
This round mainly focus on your DSA, DBMS , OS Networking and coding skills like how optimised you can write code
This round was conducted on Zoom
Their were 2 interviewers and both of them were very calm and supportive
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number for each trip...
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.
Maintain two pointers, one moving at twice the speed of the other.
If there is a cycle, the two pointers will eventually meet.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 10 minutes
Round difficulty - Easy
This was the HR round conducted online through ZOOM on 16th October 2020 around 4:00 PM
There were two interviewers and both were quite good and frank
This round mainly focus on basic resume questions and about yourself
Tip 1 : Practice DSA and have a proper grasp on that as cramming wont help you because the questioned asked are different and you might get confused and rather you wont be able to answer at all
Tip 2 : When you are preparing for the company be it off campus or on-campus always go through the job description and read it carefully what technologies they use because they might ask some question related to it
Tip 3 : In my views if you are starting to code then start with GFG , for me it worked you will get all level question from basic and then you can move to platforms like LEETCODE , LEETFREE
Tip 4 : Don't rush ever if you think you are not able to solve question , don't panic everyone is not able to do good but the main thing is to develop your thought process and its done by practicing more and more questions
Tip 5 : While solving don't try to look for answer at once, read the question understand it try to make a flow chart on paper and try to code it if after a long try if you are not able to solve then have a look at it and analyze where you went wrong .
Tip 6 : Always make a time table it will help you to prepare well and on time with every concept
Tip 7 : Do a minimum of 2 to 3 projects that you know well because sometimes they may ask you to run in front of them and explain it so you should be confident enough to explain
Tip 8 : While giving a interview don't ever say a no to any question just try to answer what all you know related to it and reply in positive that you know that much related to this topic and don't try to fool them as they catch mistakes easily
Tip 9 : Last but not least always keep a smile on your face and don't be nervous it will help you to show that you are confident enough and it will be interesting for both of you .
Tip 1 : It should be a one page resume for freshers
Tip 2 : Keep it crisp , don't include everything about yourself , keep those details for the interview
Tip 3 : Read the JD know about the company, its vision and the requisites for the position you are applying for and develop the resume with the things keeping in mind
Tip 4 : You should be also clear about career objective because they may ask on your career objectives in HR or Managerial Round
Tip 5 : Organize the information while writing it , have a proper heading and all the extra information using bullet points and avoid writing paragraphs
Tip 6 : Keep the resume short and simple as the recruiter don't like the long and exaggerated resumes
Tip 7 : While writing your work experiences try to write your accomplishment not your duties .
Tip 8 : Only include the projects that you know well otherwise who knows if they ask something that you know , it may give a bad impression and chances can be low
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
To grow the category, we need to focus on customer needs, expand product offerings, and improve marketing strategies.
Conduct market research to identify customer needs and preferences
Introduce new products or variations to existing products
Collaborate with suppliers to improve product quality and pricing
Develop targeted marketing campaigns to increase brand awareness and attract new customers
Analyze sales data to ident
Top trending discussions
I appeared for an interview in Jan 2016.
To find the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.
Traverse the tree using level order traversal
At each level, keep track of the rightmost node
Add the rightmost node to the result array
Return the result array
Find two missing numbers from an unsorted array in O(n) time complexity.
Calculate the sum of all numbers from 1 to n using the formula n*(n+1)/2
Calculate the sum of all numbers in the given array
Subtract the sum of array from the sum of all numbers to get the sum of missing numbers
Use the sum of missing numbers and the sum of squares of all numbers from 1 to n to calculate the missing numbers using simultaneous equatio
To find average salary without disclosing any one salary
Collect salaries of all employees
Add all salaries and divide by total number of employees
Do not disclose any individual salary
Divide a golden brick into minimum parts to pay daily salary to a worker.
The number of parts needed will depend on the daily salary of the worker.
The size of the parts should be equal.
The parts should be small enough to cover the daily salary but large enough to minimize the number of parts.
The formula to calculate the number of parts is: number of parts = total value of the golden brick / daily salary
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not attack each other.
Generate and print valid configurations where queens are placed safely.
Consider constraints and time limit for efficient solution.
Exam...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Achieve sorting in a single scan over the array without using any extra space.
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, there is a cycle in the linked list.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 2 interviews
Interview experience
based on 187 reviews
Rating in categories
Assistant Category Manager
99
salaries
| ₹7 L/yr - ₹17.4 L/yr |
Assistant Manager
70
salaries
| ₹4.5 L/yr - ₹17.2 L/yr |
Category Manager
51
salaries
| ₹12 L/yr - ₹29 L/yr |
Category Executive
42
salaries
| ₹3.5 L/yr - ₹8 L/yr |
Product Manager
40
salaries
| ₹12.9 L/yr - ₹42.8 L/yr |
MagicBricks
Netmeds.com
Tracxn
Zolo