Filter interviews by
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
Questions on data structure, algorithm, and Android development.
To find maximum sum subarray, use Kadane's algorithm
To separate zeroes and ones in array, use two pointers approach
ViewModel is a class that stores and manages UI-related data
RecyclerView is a flexible view for providing a limited window into a large data set
To implement ViewModel, extend ViewModel class and override onCleared() method
What people are saying about Times Internet
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
Times Internet interview questions for popular designations
I applied via Naukri.com and was interviewed in Oct 2019. There were 3 interview rounds.
JSP is compiled into servlets by the server at runtime.
JSP pages are first translated into Java code by the JSP compiler.
The Java code is then compiled into servlets by the server at runtime.
The servlets are then executed to generate dynamic content for the client.
Compilation can be done automatically or manually depending on the server configuration.
Solr indexing is the process of adding documents to the Solr search engine for efficient retrieval.
Solr indexing involves creating a schema that defines the fields to be indexed
Documents are then added to the index using the Solr API or a data import handler
Solr uses inverted indexes to quickly search for documents matching a query
Indexing can be optimized by using techniques like sharding and replication
To refresh cache, clear the cache or set a new expiration time.
Clear the cache by deleting all cached data
Set a new expiration time for the cache
Use cache busting techniques to force a refresh
Implement server-side cache invalidation
Use a CDN to serve cached content
A cron job can be used to automate cache synchronization at regular intervals.
Set up a cron job to run a script that clears and updates the cache
Specify the frequency of the cron job based on the cache update frequency
Ensure that the script is error-free and logs any issues for debugging
Consider using a distributed cache system for better performance
Example: */5 * * * * /path/to/script.sh
Get interview-ready with Top Times Internet Interview Questions
I applied via Recruitment Consultant and was interviewed in Oct 2019. There were 3 interview rounds.
I can write a large number of words per day, depending on the topic and deadline.
I have experience writing articles, blog posts, and social media content.
I am able to write quickly and efficiently without sacrificing quality.
My average output is around 1500-2000 words per day, but I can write more if needed.
I am comfortable with various writing styles and can adapt to different tones and audiences.
I applied via Naukri.com and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I applied via Referral and was interviewed before Sep 2020. There were 3 interview rounds.
I was interviewed before Jan 2021.
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.
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...
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...
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...
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 ...
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.
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 ...
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...
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 : 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.
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
108
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
65
salaries
| ₹0 L/yr - ₹0 L/yr |
Info Edge
Network 18
Times Group
INDIA TODAY GROUP