Upload Button Icon Add office photos

Times Internet

Compare button icon Compare button icon Compare

Filter interviews by

Times Internet Assistant Manager Customer Delight Interview Questions and Answers for Experienced

Updated 11 Apr 2018

Times Internet Assistant Manager Customer Delight Interview Experiences for Experienced

1 interview found

I applied via Approached by Company and was interviewed in Mar 2018. There were 2 interview rounds.

Interview Preparation Tips

Round: Resume Shortlist
Experience: My Resume was shortlisted and asked to comedown for Interview. On the day they re-scheduled it for some other day and when i was trying to contact them again via call and when i thought its not professional so e-mailed them. However unfortunately could not get any response from them and it's been more than 1 month

General Tips: My Resume was shortlisted and asked to comedown for Interview. On the day they re-scheduled it for some other day and when i was trying to contact them again via call and when i thought its not professional so e-mailed them. However unfortunately could not get any response from them and it's been more than 1 month
Skills: Problem Solving
Duration: <1 week

Top trending discussions

View All
Salary Discussions, Hike & Promotions
2w
a senior executive
GF salary Vs. My salary
Me and my gf have been dating for 5 years. Back in 2020, I started my career with a package of ₹5 LPA. Over the years, I’ve reached ₹22 LPA in 2025. She started her journey with ₹3 LPA(2020) and is now earning ₹8 LPA(2025). We’ve been in a live-in relationship for around 2 years, and the idea was to share expenses equally. But, equal sharing never really happened. If we go to a café she likes, especially with friends, I will pay the entire bill. We only split the house rent and grocery bills. I told her lots of time to cut down these costly cafe expenses or earn more money, increase your package, study and work hard, but.....she is now in her comfort zone. Being from a tech background, I have seen people upgrade their skills and package for a good life in metro cities. I am ready to support her in her studies, but she is like I am earning enough for myself.... No, you are not. I love her, but I don't know how to overcome this issue between us. Please suggest!
Got a question about Times Internet?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Dec 2015.

Interview Questionnaire 

2 Questions

  • Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
  • Q2. Why do you want to join the company?
  • Ans. 

    I am excited to join the company because of its reputation for innovation and commitment to employee growth.

    • I am impressed by the company's track record of developing cutting-edge software solutions.

    • I appreciate the company's focus on fostering a culture of learning and development.

    • I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.

    • I believe that the co...

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)

Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.

Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions

Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad

Interview Preparation Tips

Round: Technical Interview
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.

Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA

I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
  • Ans. 

    Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

    • Iterate through the matrix and find the doors

    • Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

    • Update the distance matrix with the minimum distances

  • Answered by AI
  • Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
  • Ans. 

    Find kth smallest element in unordered array with O(1) space

    • Use the QuickSelect algorithm to partition the array and find the kth smallest element

    • Choose a pivot element and partition the array into two subarrays

    • Recursively partition the subarray that contains the kth smallest element

    • Repeat until the pivot element is the kth smallest element

    • Time complexity: O(n) average case, O(n^2) worst case

  • Answered by AI
  • Q3. Design question
  • Q4. Find friends of friend who already are not friends with you
  • Ans. 

    To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

    • Get your list of friends

    • For each friend, get their list of friends

    • Exclude yourself and your friends from the final list of friends of friends

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.

Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.

Round: Other Interview
Experience: This was bar-raiser round.

Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

  • Q1. 

    Kth Largest Element Problem Statement

    Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.

    Example:

    Input:
    Array: [2,1,5,6,3,8], K ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order

    • Return the Kth element from the sorted array

    • Handle multiple test cases

  • Answered by AI
  • Q2. 

    Orange Rotting Problem Statement

    Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:

    • Value 0: Represents an empty cell.
    • Value 1: Represents a fresh orang...
  • Ans. 

    The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.

    • Create a queue to store the rotten oranges and their time of rotting.

    • Iterate through the grid to find the initial rotten oranges and add them to the queue.

    • Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

    • Continue until the queue is empty, ke...

  • Answered by AI
Round 2 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAUber interview preparation:Topics to prepare for the interview - Design, Algorithms And Data Structures, Graph Theory, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as ...

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

I applied via Referral

Interview Questionnaire 

6 Questions

  • Q1. Design the most optimal data structures for an LRU cache
  • Ans. 

    Design optimal data structures for LRU cache

    • Use a doubly linked list to keep track of recently used items

    • Use a hash table to store key-value pairs for quick access

    • When an item is accessed, move it to the front of the linked list

    • When the cache is full, remove the least recently used item from the back of the linked list and hash table

  • Answered by AI
  • Q2. Convert a sorted array to balanced binary search tree
  • Ans. 

    Convert a sorted array to balanced binary search tree

    • Find the middle element of the array and make it the root of the tree

    • Recursively construct the left subtree using the left half of the array

    • Recursively construct the right subtree using the right half of the array

    • Repeat until all elements are added to the tree

  • Answered by AI
  • Q3. Reverse a singly linked list in groups of k in­place
  • Ans. 

    Reverse a singly linked list in groups of k in­place

    • Divide the linked list into groups of k nodes

    • Reverse each group of k nodes

    • Connect the reversed groups to form the final linked list

  • Answered by AI
  • Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
  • Q5. Write a recursive routine to calculate a ^ n
  • Ans. 

    A recursive routine to calculate a ^ n

    • The base case is when n is 0, in which case the result is 1

    • For any other value of n, the result is a multiplied by the result of a^(n-1)

    • The recursive function should call itself with a^(n-1) as the new input

  • Answered by AI
  • Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
  • Ans. 

    Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.

    • Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.

    • Maintain two heaps, one for kth largest and one for kth smallest.

    • For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.

    • Alternatively, use a...

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I appeared for an interview in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.0
 • 5.4k Interviews
Flipkart Interview Questions
3.9
 • 1.5k Interviews
PolicyBazaar Interview Questions
3.7
 • 472 Interviews
BigBasket Interview Questions
3.9
 • 399 Interviews
JustDial Interview Questions
3.5
 • 358 Interviews
Info Edge Interview Questions
3.9
 • 349 Interviews
Eternal Limited Interview Questions
3.7
 • 327 Interviews
Naukri Interview Questions
4.1
 • 200 Interviews
Uber Interview Questions
4.2
 • 155 Interviews
View all
Senior Software Engineer
148 salaries
unlock blur

₹11 L/yr - ₹40 L/yr

Product Manager
108 salaries
unlock blur

₹12.9 L/yr - ₹36.8 L/yr

Software Developer
99 salaries
unlock blur

₹7.5 L/yr - ₹27 L/yr

Manager
74 salaries
unlock blur

₹7.5 L/yr - ₹30 L/yr

Accounts Manager
68 salaries
unlock blur

₹4 L/yr - ₹14.5 L/yr

Explore more salaries
Compare Times Internet with

Amazon

4.0
Compare

Flipkart

3.9
Compare

Indiamart Intermesh

3.6
Compare

BigBasket

3.9
Compare
write
Share an Interview