Filter interviews by
Clear (1)
React is a JavaScript library for building user interfaces, known for its efficiency and flexibility.
React allows for the creation of reusable UI components, making development faster and more efficient.
It uses a virtual DOM for optimal performance by only updating the necessary components when data changes.
React's component-based architecture promotes code reusability and maintainability.
It has a large and active comm...
I applied via Recruitment Consulltant and was interviewed before Apr 2022. There were 4 interview rounds.
Easy to medium-level coding questions on DSA
A custom linked list is a data structure where each node contains a value and a reference to the next node.
Define a Node class with value and next properties
Define a LinkedList class with head property and methods to add, remove, and traverse nodes
Example: let list = new LinkedList(); list.add(1); list.add(2); list.remove(1);
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
What people are saying about Times Internet
I applied via LinkedIn and was interviewed before Jan 2024. There were 4 interview rounds.
Hackerrank test with medium level questions
Medium level two questions. Focus of optimising.
I am excited to join Company because of its innovative projects, collaborative team, and opportunities for growth.
Innovative projects: Company is known for pushing boundaries and working on cutting-edge technologies.
Collaborative team: I value teamwork and believe that the collaborative environment at Company will help me thrive.
Opportunities for growth: Company offers various learning and development opportunities to
I applied via Referral and was interviewed in Dec 2024. There was 1 interview round.
I was interviewed in Sep 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round where the interviewer asked me 2 DSA based problems.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks at different points.
Keep track of the maximum profit that can be achieved by considering all possible combinations of buy and sell transactions.
Ensure that y...
Ninja is practicing binary representations and stumbled upon an interesting problem. Given two numbers 'A' and 'B', you are required to determine how many bits need t...
Calculate the number of bit flips required to convert one number to another in binary representation.
Convert both numbers to binary representation
Count the number of differing bits between the two numbers
Output the count of differing bits as the number of bit flips required
Example: A = 13 (1101), B = 7 (0111) -> 2 bit flips required
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round where the interviewer asked me 2 DSA based problems.
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.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in top-down order
Traverse the leaf nodes in left-right order
Traverse the right boundary nodes in bottom-up order
Handle cases where duplicates occur in boundary nodes
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
Reverse a linked list in groups of size K by reversing nodes in each group.
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the number of elements in the last group is less than K
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round where the interviewer asked behavioral problems.
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.
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
Implement binary search algorithm to find a target string in a sorted array of strings.
Ensure the array of strings is sorted before performing binary search.
Compare the target string with the middle element of the array and adjust the search range accordingly.
Repeat the process until the target string is found or the search range is exhausted.
I applied via Naukri.com and was interviewed before Mar 2022. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2021. There were 4 interview rounds.
Count the number of flips required to convert a binary string to alternate 0 and 1.
Iterate through the string and count the number of flips required to make it alternate.
Keep track of the current character and the expected character.
Example: 001101 -> 010101 requires 2 flips.
Example: 101010 -> 010101 requires 3 flips.
Find the maximum profit from buying and selling a stock given an array of its values.
Iterate through the array and keep track of the minimum value seen so far.
Calculate the profit at each index and update the maximum profit seen.
Return the maximum profit.
Boundary traversal of a tree
Boundary traversal involves visiting the nodes on the boundary of a tree in a specific order
Start with the root node and traverse the left boundary, then the leaf nodes from left to right, and finally the right boundary
Use recursion to traverse the left and right subtrees
Exclude the leaf nodes that are also part of the left or right boundary
Reverse a linked list in groups of k nodes.
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
Use recursion or iteration to implement the solution
based on 4 interviews
Interview experience
based on 16 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