Filter interviews by
I applied via Campus Placement and was interviewed in Dec 2021. There were 3 interview rounds.
C++ is an extension of C with object-oriented programming features.
C++ supports classes and objects while C does not.
C++ has better support for polymorphism and inheritance.
C++ has a standard template library (STL) while C does not.
C++ allows function overloading while C does not.
C++ has exception handling while C does not.
Encapsulation is the process of hiding implementation details and exposing only necessary information to the user.
Encapsulation is achieved through access modifiers like public, private, and protected.
It helps in achieving data abstraction and information hiding.
Encapsulation provides better control over the data and prevents unauthorized access.
Example: A class with private variables and public methods to access those...
I applied via Internshala and was interviewed before Apr 2023. There was 1 interview round.
What people are saying about Times Internet
I applied via Naukri.com and was interviewed in Mar 2022. There was 1 interview round.
Remove duplicates from array and implement Stack using Queue
To remove duplicates, use a HashSet or sort the array and iterate through it
To implement Stack using Queue, use two Queues and switch elements between them
Example: String[] arr = {"apple", "banana", "orange", "apple"};
Example: Queue
Example: Stack
Times Internet interview questions for popular designations
I was interviewed in Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round. I was asked 2 DSA problems to discuss and code.
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.
The fir...
Yes, the binary array sorting problem can be solved in linear time and constant space by using a two-pointer approach.
Use two pointers, one starting from the beginning of the array and the other starting from the end.
Swap 0s to the left side and 1s to the right side by incrementing and decrementing the pointers accordingly.
Continue this process until the two pointers meet in the middle of the array.
Example: Input: [1,
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the maximum sum subarray encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider the case where all elements in the array are negative.
Handle the case where the array contains only one element.
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round. I was asked questions related to Android and its architecture.
RecyclerView is a flexible view for providing a limited window into a large data set.
RecyclerView recycles views to improve performance and memory usage.
It uses a LayoutManager to organize and position items within the view.
Adapter provides data to be displayed in the RecyclerView.
ItemDecoration allows for custom drawing of item decorations like borders or dividers.
ViewModel in Android is a class that is responsible for preparing and managing data for an activity or fragment.
ViewModel is part of the Android Architecture Components and is used to store and manage UI-related data in a lifecycle-conscious way.
It survives configuration changes such as screen rotations and retains data during the lifecycle of the activity or fragment.
ViewModel should never hold a reference to a view o...
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.
Get interview-ready with Top Times Internet Interview Questions
I applied via Approached by Company and was interviewed before Sep 2022. There were 4 interview rounds.
Algorithm and database and datastructures
Language and basic understanding
I applied via Naukri.com and was interviewed in Sep 2021. There was 1 interview round.
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
I applied via Referral and was interviewed in Jun 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Apr 2021. There were 3 interview rounds.
Some of the top questions asked at the Times Internet interview -
The duration of Times Internet interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 40 interviews
Interview experience
based on 666 reviews
Rating in categories
Senior Software Engineer
145
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
107
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Info Edge
Network 18
Times Group
INDIA TODAY GROUP