AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Times Internet Senior Frontend Web Developer Interview Questions and Answers
6 Interview questions
Implement a function to reverse a string in place
Create two pointers, one at the start of the string and one at the end
Swap characters at the two pointers and move them towards the center until they meet
JavaScript concepts like event loop, variable hoisting, and closures are fundamental for understanding the language.
Event loop is responsible for managing the execution of code in JavaScript, ensuring non-blocking behavior.
Variable hoisting allows variables to be declared anywhere in a function, with their declarations moved to the top during compilation.
Closures allow functions to access variables from their oute...
Code assignment to fetch data from API & DOM manipulation using state management libraries
Use fetch API to make a request to the desired endpoint
Utilize state management libraries like Redux or MobX for managing data
Update the DOM based on the fetched data using the state management library
Implement field validation in a form using code assignment
Use HTML form elements like input, select, textarea
Use JavaScript to validate user input
Display error messages if validation fails
Consider using libraries like jQuery Validation for complex validations
Experience with Redux for state management and data flow
Used Redux for managing state in complex web applications
Understand concepts like actions, reducers, and store in Redux
Data flows in a unidirectional manner within Redux, with actions triggering state changes through reducers
Example: Dispatching an action to update a user's profile information in Redux store
Optimizing React application performance through various strategies.
Code splitting to reduce initial load time
Using shouldComponentUpdate or React.memo for efficient rendering
Implementing virtualized lists for large data sets
Minifying and compressing assets for faster loading
Caching data with tools like Redux or useMemo
Times Internet Senior Frontend Web Developer Interview Experiences
1 interview found
Mohit Tokas
Selected
I applied via Referral and was interviewed before Jan 2024. There were 3 interview rounds.
(4 Questions)
- Q1. What are the basic concepts of JavaScript, including the event loop, variable hoisting, and closures?
- Ans.
JavaScript concepts like event loop, variable hoisting, and closures are fundamental for understanding the language.
Event loop is responsible for managing the execution of code in JavaScript, ensuring non-blocking behavior.
Variable hoisting allows variables to be declared anywhere in a function, with their declarations moved to the top during compilation.
Closures allow functions to access variables from their outer sco...
- Q2. What has been your experience with state management libraries such as Redux, and how does data flow within these libraries?
- Ans.
Experience with Redux for state management and data flow
Used Redux for managing state in complex web applications
Understand concepts like actions, reducers, and store in Redux
Data flows in a unidirectional manner within Redux, with actions triggering state changes through reducers
Example: Dispatching an action to update a user's profile information in Redux store
- Q3. What strategies can be employed to optimize the performance of a React application?
- Ans.
Optimizing React application performance through various strategies.
Code splitting to reduce initial load time
Using shouldComponentUpdate or React.memo for efficient rendering
Implementing virtualized lists for large data sets
Minifying and compressing assets for faster loading
Caching data with tools like Redux or useMemo
- Q4. One Easy DSA problem Code
- Ans.
Implement a function to reverse a string in place
Create two pointers, one at the start of the string and one at the end
Swap characters at the two pointers and move them towards the center until they meet
(2 Questions)
- Q1. Code Assignment for Field validation in form
- Ans.
Implement field validation in a form using code assignment
Use HTML form elements like input, select, textarea
Use JavaScript to validate user input
Display error messages if validation fails
Consider using libraries like jQuery Validation for complex validations
- Q2. Code assignment to fetch data from API & DOM manipulation using state management libraries
- Ans.
Code assignment to fetch data from API & DOM manipulation using state management libraries
Use fetch API to make a request to the desired endpoint
Utilize state management libraries like Redux or MobX for managing data
Update the DOM based on the fetched data using the state management library
The manager inquired about previous projects and a data structures and algorithms question, during which I explained my roles and responsibilities.
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Dec 2015.
Interview Questionnaire
2 Questions
- Q1. 1 question from basic data structures and algorithms The question was similar to the one in the given link- -----/
- Q2. Why do you want to join the company?
- Ans.
I am excited to join the company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the company's focus on fostering a culture of learning and development.
I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.
I believe that the co...
Interview Preparation Tips
Experience: Resumes were shortlisted with a short aptitude round where we are asked basic questions about databases, basic programming(C and C ++ questions)
Round: Technical Interview
Experience: The questions were asked were simple - related to arrays and data structures. Some questions were asked regarding my resume and projects.
Tips: Be thorough with geeksForGeeks, and your projects.
Round: HR Interview
Experience: I told him how I found the story of the founder of Infoedge very inspiring.
Tips: This round should be more simpler , be prepared with why you want to join the company and general HR questions
Skills: Basic C/C++, Programming Skills In Any Language Like C
College Name: IIIT Allahabad
Interview Preparation Tips
Experience: Ques will be based on arrays( duplicate element, missing element in 1 to n array), link list(reverse, remove loop, middle node etc), Hashing, sql join, normalisation, indexing in sql, singlton pattern and sorting and searching.
Tips: Focus will remain on algorithms. Whatever program they will ask to write, they will also ask to optimize the solution.
Skill Tips: Puzzle on mislabled jar, odd weight ball. As I had exp in Java, so some more que on Java, java script and web technology. All you need in interview is to be confident and show your interest in web domain.
Skills: Java, Data structure, Algorithm
College Name: NA
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
- Q1.
Rearrange Array Elements Problem Statement
Given an array
Acontaining 'N' integers and an integerm, rearrange the elements of the array such that the differences between the array elements andmare sor... - Ans.
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
- Q2.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
- Q1.
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
1
232
34545
4567654Explanation:
The pat...
- Ans.
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
- Q2. What is the difference between a web server and an application server?
- Ans.
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
- Q3. How does the internet work?
- Ans.
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
- Q4. Write a SQL query to find the nth highest salary.
- Ans.
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
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.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Eternal Limited
Gulshan Kumar
posted on 30 Nov 2015
I applied via Campus Placement
Interview Preparation Tips
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.
Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix
Tips: All question were from geeksforgeeks
So practice it well ..u will make through it
Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible
Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...
Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens
Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar
I applied via Referral
Interview Questionnaire
6 Questions
- Q1. Design the most optimal data structures for an LRU cache
- Q2. Convert a sorted array to balanced binary search tree
- Ans.
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
- Q3. Reverse a singly linked list in groups of k inplace
- Ans.
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
- Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
- Q5. Write a recursive routine to calculate a ^ n
- Ans.
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
- Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
- Ans.
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Duration: 2 hours
Total Questions: 22
College Name: Jaypee University Of Information Technology, Solan
Sumit Singh
I appeared for an interview before Sep 2016.
Interview Questionnaire
5 Questions
- Q1. Search an element in sorted rotated array.
- Ans.
Search an element in sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle the cases where the target element is at the pivot point or not present in the array.
- Q2. Kth largest element in an array.
- Ans.
Find the Kth largest element in an array.
Sort the array in descending order and return the element at index K-1.
Use a max heap to find the Kth largest element efficiently.
Implement a quickselect algorithm to find the Kth largest element in linear time.
- Q3. Reverse a linked list in group of n element.
- Ans.
Reverse a linked list in groups of n elements.
Divide the linked list into groups of n elements.
Reverse each group individually.
Connect the reversed groups to form the final linked list.
Handle cases where the number of elements is not a multiple of n.
Example: 1->2->3->4->5->6->7->8, n=3 -> 3->2->1->6->5->4->8->7
- Q4. Median of two sorted array.
- Ans.
Find the median of two sorted arrays.
Merge the two arrays into one sorted array and find the median.
Use binary search to find the median in O(log(min(m, n))) time complexity.
Handle edge cases like empty arrays or arrays of different lengths.
- Q5. It was a DP question. In a matrix, I have to count number of paths from (0, 0) to (m, n) while crossing through some indexes were not allowed.
- Ans.
Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.
Use dynamic programming to solve the problem
Create a 2D array to store the number of paths
Traverse the matrix and update the array based on the allowed paths
Return the value at the last index of the array
Interview Preparation Tips
Experience: Interviewer was mainly focused on problem solving skill.
College Name: KIIT University
Skills evaluated in this interview
I appeared for an interview in Aug 2017.
Interview Preparation Tips
Experience: Platform: Hackerearth
20 MCQs with negative marking, topics included OS, DS-Algo, Networking.
2 Programming Problems.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: 3 DS-Algo problems were asked. Made to written codes on paper.
Round: Technical Interview
Experience: 2 DS-Algo problems were asked. Made to written codes on paper.
Few OS questions were also asked.
Skills: Data Structures and Algorithms, Operating Systems
College Name: IIT (BHU)
Times Internet Interview FAQs
Some of the top questions asked at the Times Internet Senior Frontend Web Developer interview -
Tell us how to improve this page.
Times Internet Interviews By Designations
- Times Internet Software Developer Interview Questions
- Times Internet Software Engineer Interview Questions
- Times Internet Senior Software Engineer Interview Questions
- Times Internet Data Scientist Interview Questions
- Times Internet Marketing Trainee Interview Questions
- Times Internet Marketing Intern Interview Questions
- Times Internet Digital Content Producer Interview Questions
- Times Internet Java Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- React Js Frontend Developer Interview Questions
- Senior Systems Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Interview Questions from Similar Companies
|
Senior Software Engineer
148
salaries
|  ₹11 L/yr - ₹40 L/yr |
|
Product Manager
108
salaries
| ₹12.9 L/yr - ₹36.8 L/yr |
|
Software Developer
99
salaries
| ₹7.5 L/yr - ₹27 L/yr |
|
Manager
74
salaries
| ₹7.5 L/yr - ₹30 L/yr |
|
Accounts Manager
68
salaries
| ₹4 L/yr - ₹14.5 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket
- Home >
- Interviews >
- Times Internet Interview Questions
