Times Internet

16 posts

Times Internet Interview Experience for iOS developer (5 Yrs Exp.)

Last Updated: 07 August 2023

I have applied through LinkedIn for a post from Times Internet requiring an experienced iOS developer. Applied and got the interview invite. Details of the rounds are belo...read more

Interview Experiences

C++ Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Python3 Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

C# Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

PHP Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Javascript Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

C Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Java Program for Search an element in a sorted and rotated array

Last Updated: 23 July 2025

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand...read more

Times Internet Limited Interview Experience for Software Engineer (On-Campus)

Last Updated: 23 July 2025

Times Internet visited BITS Pilani for software engineer profile for their subsidiary, dineout.co.in. Circuit branches + Mech were eligible. There were total 4 rounds. As ...read more

Interview Experiences

Times Internet

On-Campus

Experiences

Times Internet Limited Interview Experience for Software Development

Last Updated: 23 July 2025

Times Internet visited our campus for software development and mobile app development. I was interviewed for a software development profile. There was a total of 4 rounds....read more

Interview Experiences

Times Internet

On-Campus

Experiences

Times Internet Interview Experience | Set 3 (For Mobile App Developer)

Last Updated: 13 January 2017

I applied through employee referral for the post of Android App developer InternThey gave us one week task to build a simple android app to list all the apps installed on ...read more

Interview Experiences

Times Internet

Experiences

Times Internet Interview Experience | Set 2 (Experienced)

Last Updated: 23 July 2025

Round 1:Discussion about projects and workSearch in a rotated sorted arrayhttps://www.geeksforgeeks.org/dsa/find-minimum-element-in-a-sorted-and-rotated-array/Implement st...read more

Interview Experiences

Experienced

Times Internet

Experiences

Times Internet Interview Experience | Set 1 (On-Campus)

Last Updated: 28 January 2016

Round 1 TestDuration 90 MinutesNo. of Questions 22 questionsTest Sections Section 1: Data Structures, Hash maps, Tree Traversals, Basic pointer questions and Aptitude ...read more

Interview Experiences

Times Internet

Experiences

Lowest Common Ancestor in a Binary Tree

Last Updated: 21 January 2026

Given the root of a Binary Tree with unique values and two node values n1 and n2, find the Lowest Common Ancestor (LCA). LCA is the deepest node that has both n1 and n2 as...read more

Minimum in a Sorted and Rotated Array

Last Updated: 20 February 2026

Given a sorted array of distinct elements arr[] of size n that is rotated at some unknown point, the task is to find the minimum element in it. Examples: Input: arr[] = [5...read more

1 2