Upload Button Icon Add office photos

Times Internet

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Times Internet Software Developer Interview Questions, Process, and Tips

Updated 14 Jan 2022

Top Times Internet Software Developer Interview Questions and Answers

  • 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 ...read more
  • Q2. 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 ...read more
  • Q3. 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 r ...read more
View all 20 questions

Times Internet Software Developer Interview Experiences

5 interviews found

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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - The campus process included 2 Technical and an HR round, First round was coding, second was to check theoretical knowledge and third HR round.

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(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...

  • Answered by AI
  • 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...

  • Answered by AI
  • 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.

  • Answered by AI
  • 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...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPATimes Internet interview preparation:Topics to prepare for the interview - SQL, Algorithms, Data Structures, C++, PHPTime required to prepare for the interview - 6 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 : 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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview Preparation Tips

Round: Test
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.

Software Developer Interview Questions & Answers

user image Shreyas Ashok Keote

posted on 6 Dec 2015

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
  • Ans. 

    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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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 ...

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI
  • Q18. Do you have any question for us?

Interview Preparation Tips

Round: Test
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

Times Internet interview questions for designations

 Software Engineer

 (4)

 Senior Software

 (1)

 Software Manager

 (1)

 Java Developer

 (2)

 Senior Software Engineer

 (3)

 Senior Android Developer

 (2)

 Full Stack Developer

 (1)

 Senior IOS Developer

 (1)

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(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

  • Answered by AI
  • Q2. 

    First Missing Positive Problem Statement

    You are provided with an integer array ARR of 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.

  • Answered by AI
Round 2 - Face to Face 

(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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI
Round 3 - Face to Face 

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 4 - HR 

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

Eligibility criteriaAbove 7 CGPATimes Internet interview preparation:Topics to prepare for the interview - Confidence, Communication, Puzzle Solving Capability, Algorithms And Data Structures, Basic C/C++Time required to prepare for the interview - 6 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

Get interview-ready with Top Times Internet Interview Questions

Interview questions from similar companies

I was interviewed 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

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Times Internet Interview FAQs

How to prepare for Times Internet Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Times Internet. The most common topics and skills that interviewers at Times Internet expect are Javascript, SQL, API Testing, Ad Server and Application Development.
What are the top questions asked in Times Internet Software Developer interview?

Some of the top questions asked at the Times Internet Software Developer interview -

  1. 20 red balls and 16 blue balls are present in a bag. 2 balls are removed, if th...read more
  2. Find the second largest prime number from a given array of positive integers. A...read more
  3. If a person travels from point A to point B at 20 km/h and returns at 30 km/h, ...read more

Recently Viewed

INTERVIEWS

Videocon d2h

No Interviews

SALARIES

Nykaa

INTERVIEWS

Matrimony.com

No Interviews

INTERVIEWS

Videocon d2h

No Interviews

INTERVIEWS

Times Internet

50 top interview questions

SALARIES

Matrimony.com

SALARIES

Matrimony.com

REVIEWS

Matrimony.com

No Reviews

INTERVIEWS

Matrimony.com

No Interviews

INTERVIEWS

Matrimony.com

No Interviews

Tell us how to improve this page.

Times Internet Software Developer Interview Process

based on 1 interview

Interview experience

2
  
Poor
View more
Times Internet Software Developer Salary
based on 95 salaries
₹5.5 L/yr - ₹22.7 L/yr
66% more than the average Software Developer Salary in India
View more details

Times Internet Software Developer Reviews and Ratings

based on 12 reviews

2.4/5

Rating in categories

2.7

Skill development

2.1

Work-life balance

2.7

Salary

2.4

Job security

2.1

Company culture

1.9

Promotions

2.3

Work satisfaction

Explore 12 Reviews and Ratings
Senior Software Engineer
145 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
107 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
95 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
73 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
64 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Times Internet with

Info Edge

3.9
Compare

Network 18

3.5
Compare

Times Group

3.8
Compare

INDIA TODAY GROUP

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview