Upload Button Icon Add office photos

Times Internet

Compare button icon Compare button icon Compare

Filter interviews by

Times Internet Software Developer Interview Questions and Answers

Updated 14 Jan 2022

19 Interview questions

A Software Developer was asked
Q. Write a function to delete a node in a singly linked list, given only access to that node.
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

A Software Developer was asked
Q. 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, typ...

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 Rakuten
Q2. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Amazon
Q3. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
asked in PhonePe
Q5. Form a Triangle Problem Statement You are given an array of integ ... read more
A Software Developer was asked
Q. Find the second largest prime number from a given array of positive integers. Also return its index in the 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

A Software Developer was asked
Q. 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

A Software Developer was asked
Q. Which data structure would you use to program a jigsaw puzzle program, and what methods would you 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 f...

A Software Developer was asked
Q. 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.

Times Internet HR Interview Questions

15 questions and answers

Q. Why do you want to join?
Q. What projects did you work on in your previous organization?
Q. How will you react in a situation where you have to make a quick decision t ... read more
A Software Developer was asked
Q. Given 8 balls of the same properties and one of these balls is defective and is heavier than the others, what is the minimum number of steps required 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 on...

Are these interview questions helpful?
A Software Developer was asked
Q. What is polymorphism? Can you provide some 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 parame...

A Software Developer was asked
Q. What is operator overloading? Give an example.
Ans. 

Operator overloading allows custom definitions for operators to work with user-defined types in programming languages.

  • Enables intuitive use of objects with operators like +, -, *, etc.

  • Example in C++: Overloading the + operator for a 'Vector' class to add two vectors.

  • Improves code readability and maintainability.

  • Can be applied to various operators, including arithmetic, comparison, and assignment.

A Software Developer was asked
Q. 

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

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.

Times Internet Software Developer Interview Experiences

5 interviews found

Software Developer Interview Questions & Answers

user image Yuvraj Chandrawanshi

posted on 11 Jan 2022

Interview Questionnaire 

1 Question

  • Q1. Delete a Node in Linked list.

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

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

    I'm a passionate software developer with experience in full-stack development, eager to solve complex problems and build innovative solutions.

    • Background in Computer Science with a degree from XYZ University.

    • Experience in developing web applications using React and Node.js.

    • Worked on a team project that improved application performance by 30%.

    • Strong understanding of algorithms and data structures, demonstrated in coding ...

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

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

    I would like to understand more about the team dynamics and the projects I would be working on.

    • Can you describe the team structure and how collaboration typically works?

    • What are the current projects the team is working on, and what technologies are being used?

    • How does the company support professional development and continuous learning?

    • What are the key challenges the team is currently facing?

    • Can you share more about th...

  • Answered by AI

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

I appeared for an interview 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

I appeared for an interview 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

Top trending discussions

View All
Interview Hub
1w (edited)
anshitanegi
·
ex -
Planet Spark
When HR’s Chinese English made me drop the interview!
So, I talked to the HR yesterday about the interview. I asked Please send me the location But their English… bro I was shocked! It was like talking to someone jisne english nahi kuch ar hi seekh liya ho, if the HR’s English is this I can only imagine the rest of the company I decided to drop the interview with this chinese english😶‍🌫️
FeedCard Image
Got a question about Times Internet?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This round consist of two questions and we have to solve both the questions to qualify for the next round.

Round 2 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

A single coding question was asked that had a lot of corner cases.

Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

It had 3 coding questions followed by basic concepts of DP.

  • Q1. How do you find the maximum difference between a node and its descendant in the same path in a binary tree?
  • Ans. 

    To find the maximum difference between a node and its descendant in the same path in a binary tree, we can perform a depth-first search while keeping track of the minimum value encountered so far.

    • Perform a depth-first search on the binary tree, keeping track of the minimum value encountered so far in the path.

    • At each node, calculate the difference between the current node value and the minimum value encountered so far ...

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It had 2 coding questions which were of good level.

  • Q1. How can you find a Minimum Spanning Tree (MST) from a given graph using Kruskal’s algorithm?
  • Ans. 

    Kruskal's algorithm finds MST by sorting edges, adding smallest edge that doesn't create a cycle, repeat until all vertices are connected.

    • Sort all edges in non-decreasing order of their weights.

    • Initialize an empty graph to store the MST.

    • Iterate through sorted edges and add the smallest edge that doesn't create a cycle in the MST.

    • Repeat until all vertices are connected in the MST.

  • Answered by AI
Round 5 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

This was the last round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in HyderabadAmazon interview preparation:Topics to prepare for the interview - Data structures and Algorithms, Computer fundamentals subjects. Basics of every skill that you have written in your resume and also knowledge of concepts related to your projects. You should know whatever you have written in your resume.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Don’t create panic in any case in the interview , as even if you are not selected you will learn a lot from your interview experience and perform well in the future. Also I would recommend you Coding Ninjas as according to me it is a good platform to learn basic coding concepts and to practice coding.   

Application resume tips for other job seekers

Write whatever you are sure about and have actually done that. CGPA plays a good role but not a complete role as it is just eligibility criteria for some companies. Have at least 1 or 2 good projects from which you know everything involved in the project.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jan 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Heavily focused on DSA with emphasis on DP

Interview Preparation Tips

Interview preparation tips for other job seekers - PrepLook at previous years Flipkart Questions on GFG. Questions don't repeat but you will see the tyes of questions they will ask

I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series, Prime function, linked lisk value access, query

Interview Preparation Tips

Interview preparation tips for other job seekers - First a test based on amcat. Followed by two technical interview. First Tech Interview basis and overview of you concept of ds and algo will ne asked. In second Tech interview indepth concept of topics such as arrays, linked list, os,algo, etc will be asked. Prepare ds and algo concept, dbms query & concept, internet basis such as protocols, methods,etc.

Best of luck

I appeared for an interview before Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

  • Q1. 

    Longest Decreasing Subsequence Problem Statement

    Given an array/list of integers ARR consisting of N integers, your task is to determine the length of the longest decreasing subsequence.

    Explanation:

    A ...

  • Ans. 

    Find the length of the longest decreasing subsequence in an array of integers.

    • Use dynamic programming to keep track of the length of the longest decreasing subsequence ending at each index.

    • Initialize an array to store the length of the longest decreasing subsequence for each element.

    • Iterate through the array and update the length of the longest decreasing subsequence for each element based on previous elements.

    • Return t...

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements for which the Next Greater Element is not yet found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY. I applied for the job as SDE - 1 in DelhiEligibility criteria6.5 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Operating Systems, Algorithms, CTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Code More till you like it
Tip 2 : Study Data Structures

Application resume tips for other job seekers

Tip 1 : Mention only what you are confident about
Tip 2 : Mention tools & technologies used in the project as well

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This round was held during university hours and consisted of 2 coding questions.

Round 2 - Face to Face 

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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Java, Object-Oriented Programming System, System Design, Operating System.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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 seekers

Be 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 interviewSelected

Skills evaluated in this interview

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

Tell us how to improve this page.

Overall Interview Experience Rating

2/5

based on 1 interview experience

Times Internet Software Developer Salary
based on 94 salaries
₹11.3 L/yr - ₹20 L/yr
45% more than the average Software Developer Salary in India
View more details

Times Internet Software Developer Reviews and Ratings

based on 13 reviews

2.3/5

Rating in categories

2.7

Skill development

2.0

Work-life balance

2.7

Salary

2.3

Job security

2.1

Company culture

1.9

Promotions

2.2

Work satisfaction

Explore 13 Reviews and Ratings
Senior Software Engineer
149 salaries
unlock blur

₹20.8 L/yr - ₹37 L/yr

Product Manager
105 salaries
unlock blur

₹20 L/yr - ₹32.7 L/yr

Software Developer
94 salaries
unlock blur

₹11.3 L/yr - ₹20 L/yr

Manager
69 salaries
unlock blur

₹13.3 L/yr - ₹23.8 L/yr

Accounts Manager
63 salaries
unlock blur

₹5.2 L/yr - ₹10.4 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