Times Internet Senior Android Developer Interview Questions, Process, and Tips

Q1. About Oracle database and Oracle adfs
Add your answer

Aptitude + Coding Test

Q1. Technical Interview with an SDE
Add your answer

Q1. Managerial + Technical Interview
Add your answer

Q1. Basic HR discussion around salary negotiation
Add your answer

2 Questions - 1 graph and one basic

Q1. 2 basic coding questions and questions on OS and DBMS
Add your answer

Q1. Tell Me what s java
Ans. 
Java is a high-level programming language known for its portability, security, and versatility.
• Java is an object-oriented language

• It is platform-independent, meaning it can run on any device with a Java Virtual Machine (JVM)

• Java is used for developing a wide range of applications, from mobile apps to enterprise software
Answered by AI
Add your answer

Q1. What is the use of ref?
Ans. 
The 'ref' keyword in C# is used to pass arguments by reference instead of by value.
• Allows a method to modify the value of the argument passed to it

• Useful when you want to update the original value of a variable inside a method

• Can be used with value types and reference types

• Example: void UpdateValue(ref int num) { num = 10; }

• Example: int value = 5; UpdateValue(ref value); // value will be 10 after the method call
Answered by AI
Add your answer
Q2. What are React Hooks
Ans. 
React Hooks are functions that let you use state and other React features without writing a class.
• React Hooks were introduced in React 16.8.

• They allow you to use state and other React features in functional components.

• Some commonly used React Hooks are useState, useEffect, useContext, etc.

• Hooks are more lightweight and easier to understand compared to class components.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer