AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Times Internet Software Developer Interview Questions and Answers
19 Interview questions
To delete a node in a linked list, we need to find the node and update the pointers of its previous and next nodes.
Find the node to be deleted by traversing the linked list
Update the pointers of the previous and next nodes to skip the node to be deleted
Free the memory occupied by the node to be deleted
The data structure to program a jigsaw puzzle program would be a graph.
Use a graph data structure to represent the puzzle pieces and their connections.
Each puzzle piece can be represented as a node in the graph.
Edges between nodes represent the connections between puzzle pieces.
To solve the puzzle, use graph traversal algorithms like depth-first search or breadth-first search.
Apply puzzle-solving strategies like f...
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.
Method overloading allows multiple methods with the same name but different parame...
The minimum number of steps to find the defective ball is 2.
Divide the 8 balls into 3 groups of 3, 3, and 2 balls.
Compare the weights of the two groups of 3 balls.
If one group is heavier, divide it into 2 balls and compare their weights.
If the two balls have different weights, the heavier ball is the defective one.
If the two balls have the same weight, the remaining ball in the first group of 3 is the defective on...
Find the second largest prime number and its index from an array of positive integers.
Iterate through the array and check if each number is prime
Store the largest and second largest prime numbers found so far
Also store their indices
Return the second largest prime number and its index
Operator overloading is the ability to redefine operators for custom classes.
Allows operators to be used with custom classes
Example: '+' operator can be used to concatenate strings
Can improve readability and simplify code
Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a method in a subclass with the same name, return type, and parameters as a method in its superclass.
Method overloading is achieved within the same class.
Method overriding occurs in a subclass that inherits from a superclass.
Method overloading is determined at compile-time based on the number, typ...
Find the first missing positive number in an array of positive and negative integers.
Sort the array in ascending order
Iterate through the sorted array and find the first positive number that is missing
If no positive number is missing, return the next positive number after the largest positive number in the array
The average speed can be calculated by taking the harmonic mean of the two speeds.
To calculate the harmonic mean, divide the sum of the speeds by the reciprocal of the sum of their reciprocals.
In this case, the harmonic mean can be calculated as 2/(1/20 + 1/30) = 24 km/h.
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or n...
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time c...
Times Internet Software Developer Interview Experiences
5 interviews found
Yuvraj Chandrawanshi
Interview Questionnaire
1 Question
- Q1. Delete a Node in Linked list.
- Ans.
To delete a node in a linked list, we need to find the node and update the pointers of its previous and next nodes.
Find the node to be deleted by traversing the linked list
Update the pointers of the previous and next nodes to skip the node to be deleted
Free the memory occupied by the node to be deleted
Interview Preparation Tips
Skills evaluated in this interview
Interview Preparation Tips
Tips: Prepare for CAT. Be Fast. Develop a decent proficiency in English.
Round: Interview
Experience: There could be Multiple rounds. You will be grilled thoroughly on your CV. Logical Puzzle Solving skills will be put to test. Your common sense about the internet will also provide a boost.
Tips: Do not prepare. Be yourself. CV should not be exaggerated. Prepare a CV customized for the company.
General Tips: Be Yourself and Win it!
College Name: IIT KHARAGPUR
Motivation: Best in business.
Shreyas Ashok Keote
Interview Questionnaire
18 Questions
- Q1. Introduce yourself.
- Q2. Being from a non-CS background (Civil Engineering branch), he asked me which coding language i am best at
- Q3. Find the second largest prime number from a given array of positive integers. Also return it's index in most optimal way
- Q4. Given an array of positive and negative integers, find the first missing positive number in the most optimal way
- Ans.
Find the first missing positive number in an array of positive and negative integers.
Sort the array in ascending order
Iterate through the sorted array and find the first positive number that is missing
If no positive number is missing, return the next positive number after the largest positive number in the array
- Q5. Which data structure would i use to program a jigsaw puzzle program and what methods would i use to solve the puzzle
- Ans.
The data structure to program a jigsaw puzzle program would be a graph.
Use a graph data structure to represent the puzzle pieces and their connections.
Each puzzle piece can be represented as a node in the graph.
Edges between nodes represent the connections between puzzle pieces.
To solve the puzzle, use graph traversal algorithms like depth-first search or breadth-first search.
Apply puzzle-solving strategies like findin...
- Q6. Questions based on my resume
- Q7. What do i know about Times Internet and the work that happens in TIL
- Ans.
Times Internet Limited (TIL) is a digital products company that operates various online platforms and services.
TIL is a subsidiary of Bennett Coleman & Co. Ltd (BCCL), which is India's largest media conglomerate.
TIL operates popular websites and apps like Times of India, Economic Times, Gaana, MX Player, and Cricbuzz.
TIL focuses on digital content, e-commerce, and technology solutions.
TIL has a diverse portfolio of...
- Q8. Why was i opting for a job as software developer though i was from Civil Engineering background
- Ans.
I transitioned to software development due to my passion for coding and problem-solving.
I discovered my interest in coding during my civil engineering studies
I took online courses and attended coding bootcamps to learn software development skills
I completed projects and internships in software development to gain practical experience
I enjoy the creativity and problem-solving aspects of software development
- Q9. Asked me questions based on my CV
- Q10. If a person travels from point A to point B at 20 km/h and returns at 30 km/h, calculate the average speed without using pen and paper.
- Ans.
The average speed can be calculated by taking the harmonic mean of the two speeds.
To calculate the harmonic mean, divide the sum of the speeds by the reciprocal of the sum of their reciprocals.
In this case, the harmonic mean can be calculated as 2/(1/20 + 1/30) = 24 km/h.
- Q11. Asked the above question with different speeds to travelling
- Q12. Given 8 balls of the same properties and one of these balls is defective and is heavier than the others. Calculate the minimum no. of steps to find the defective ball
- Ans.
The minimum number of steps to find the defective ball is 2.
Divide the 8 balls into 3 groups of 3, 3, and 2 balls.
Compare the weights of the two groups of 3 balls.
If one group is heavier, divide it into 2 balls and compare their weights.
If the two balls have different weights, the heavier ball is the defective one.
If the two balls have the same weight, the remaining ball in the first group of 3 is the defective one.
- Q13. Asked the above question, but this time we don't know whether the defective ball is heavier or lighter than the others
- Q14. 20 red balls and 16 blue balls are present in a bag. 2 balls are removed, if they are of the same color, then they are replaced by a red ball. If they are of different color, then they are replaced with a...
- Q15. What is polymorphism with examples
- Ans.
Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.
Polymorphism is achieved through method overriding and method overloading.
Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.
Method overloading allows multiple methods with the same name but different parameters ...
- Q16. What is operator overloading?. Give an example
- Ans.
Operator overloading is the ability to redefine operators for custom classes.
Allows operators to be used with custom classes
Example: '+' operator can be used to concatenate strings
Can improve readability and simplify code
- Q17. Differentiate between method overloading and method overriding
- Ans.
Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a method in a subclass with the same name, return type, and parameters as a method in its superclass.
Method overloading is achieved within the same class.
Method overriding occurs in a subclass that inherits from a superclass.
Method overloading is determined at compile-time based on the number, type, an...
- Q18. Do you have any question for us?
Interview Preparation Tips
Experience: The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.
Tips: 1. Practice questions on Geekquiz.
2. Practice coding problems. There are various websites like HackerRank, HackerEarth etc. which have a lot of coding problems.
Duration: 90 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.
Round: Puzzle Interview
Experience: The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.
Round: HR Interview
Experience: This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.
General Tips: Be confident, think loudly, never panic and have a smile to your face always. You have already prepared hard for the recruitment process, it is just the confidence that matters. Don't lose hope, there are many opportunities for you.
Skills: Confidence, Communication, Puzzle Solving Capability, Algorithms And Data Structures, Basic C/C++
College Name: IIT Varanasi
Motivation: TIL has a wide range of products and the compensation is good
Funny Moments: The HR interview was more of a friendly talk and i shared my hobbies which led to a longer discussion.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(5 Questions)
Round duration - 60 minutes
Round difficulty - Easy
I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.
- Q1. Can you introduce yourself?
- Q2. What is a Binary Search Tree (BST)?
- Ans.
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.
BST allows for efficient search...
- Q3.
Binary Search Tree Insertion
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...
- Ans.
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.
Insert the new node as a leaf node in the appropriate position to maintain the BST properties.
Ensure that the resulting tree is a valid binary search tree by follow...
- Q4.
Delete Node in Binary Search Tree Problem Statement
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
- Ans.
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
Traverse the BST to find the node to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Perform inorder traversal after deletion to get the modified BST.
- Q5.
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
- Ans.
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time comple...
Interview Preparation Tips
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 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.
- Q1.
Largest Prime Factor Problem Statement
You are given a positive integer
n. Your task is to identify the largest prime factor of this given positive integer.If there is no prime factor for a given intege...
- Ans.
Identify the largest prime factor of a given positive integer.
Iterate from 2 to sqrt(n) to find prime factors
Check if each factor is prime and update largest prime factor
If no prime factor found, output -1
- Q2.
First Missing Positive Problem Statement
You are provided with an integer array
ARRof length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T... - Ans.
Find the smallest positive integer missing from an array of integers.
Iterate through the array and mark positive integers as visited using index as a reference.
After marking, iterate again to find the first unmarked index which represents the missing positive integer.
Handle edge cases like duplicates and negative numbers appropriately.
Example: For input [3, 4, -1, 1], the output should be 2.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.
- Q1.
Binary Array Sorting Problem Statement
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
Input:
The fir...
- Ans.
Yes, the binary array can be sorted in linear time and constant space using a single traversal.
Use two pointers approach to swap 0s to the left and 1s to the right.
Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.
Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.
- Q2. What is polymorphism in object-oriented programming?
- Ans.
Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.
Polymorphism allows for flexibility and reusability in code.
It enables a single interface to be used for different data types.
Examples include method overriding and method overloading.
- Q3. What is operator overloading?
- Ans.
Operator overloading is the ability to redefine the behavior of operators for user-defined data types.
Allows operators to be used with custom data types
Can define custom behavior for operators like +, -, *, etc.
Helps make code more readable and intuitive
Example: Overloading the + operator for a custom Vector class to add two vectors
- Q4. What is the difference between method overloading and method overriding?
- Ans.
Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.
Method overloading involves multiple methods with the same name but different parameters.
Method overriding involves a subclass redefining a method from its superclass with the same name and paramete...
Round duration - 45 minutes
Round difficulty - Easy
The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.
Round duration - 30 minutes
Round difficulty - Easy
This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.
Interview Preparation Tips
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.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was held during university hours and consisted of 2 coding questions.
(1 Question)
Round duration - 120 minutes
Round difficulty - Easy
Make sure you do no cutting and are clear about the approach you'd be following.
- Q1. What is the running median of an input stream?
- Ans.
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.
Keep the number of elements in the two heaps balanced or differ by at most 1.
If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...
Interview Preparation Tips
Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.
Application resume tips for other job seekersBe sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
Medium level competitive programming question. Interviewer looked for the approach and working code.
- Q1.
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
- Ans.
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Round duration - 40 minutes
Round difficulty - Medium
Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.
Interview Preparation Tips
Tip 1 : Leave a subject to prepare, but never leave a topic.
Tip 2 : Must go through previous years questions / interview experiences.
Tip 3 : Atleast 4 projects in CV
Tip 1 : At least 4 projects (working)
Tip 2 : Never put false things on resume.
Skills evaluated in this interview
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...
Interview Preparation Tips
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
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
Times Internet Interview FAQs
Some of the top questions asked at the Times Internet Software Developer interview -
Tell us how to improve this page.
Times Internet Interviews By Designations
- Times Internet Software Developer Interview Questions
- Times Internet Software Engineer Interview Questions
- Times Internet Senior Software Engineer Interview Questions
- Times Internet Data Scientist Interview Questions
- Times Internet Marketing Trainee Interview Questions
- Times Internet Marketing Intern Interview Questions
- Times Internet Digital Content Producer Interview Questions
- Times Internet Java Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Top Skills for Times Internet Software Developer
Software Developer Interview Questions from Similar Companies
Times Internet Software Developer Reviews and Ratings
based on 13 reviews
Rating in categories
|
Senior Software Engineer
149
salaries
|  ₹20.9 L/yr - ₹33.6 L/yr |
|
Product Manager
108
salaries
| ₹21 L/yr - ₹31.6 L/yr |
|
Software Developer
99
salaries
| ₹13 L/yr - ₹27 L/yr |
|
Manager
74
salaries
| ₹12.5 L/yr - ₹22 L/yr |
|
Accounts Manager
67
salaries
| ₹5.5 L/yr - ₹11.4 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket
- Home >
- Interviews >
- Times Internet Interview Questions
