Community-sourcedA factual summary of an interview experience shared publicly outside interviewd.
Sep 28
In Progress
Overall Experience
The full-stack interview had a React/JavaScript coding round followed by a Java coding round. The first covered frontend performance, JavaScript behavior, and a tree UI implementation; the second included a graph-coloring problem.
2 rounds
I
Posted by interviewd
Interview Process (2 rounds)
Round 1 of 2: Coding / DSA
60 min
Question 1
Medium
How can a website such as Amazon.com or Flipkart.com optimize loading when opened in an incognito window?
Experience
The prompt asked for website loading optimizations; no candidate answer was reported.
Question 2
Medium
Explain whether JavaScript is single-threaded or multithreaded, how the event loop works, and how execution order relates to top-to-bottom source order.
Experience
The round asked about JavaScript execution and event-loop behavior.
Question 3
Medium
If an API returns 10 million records for a UI table, what can break during rendering and how can it be addressed?
Experience
The prompt concerns rendering performance for a very large API result; no specific solution was reported.
Question 4
Medium
What does the supplied loop log when each iteration schedules setTimeout(() => console.log(i), 0) with var i from 0 to 9?
Experience
The code was provided in the post; the expected output was not recorded.
Question 5
Medium
Compare var and let, explain closures with an example, and define the Temporal Dead Zone.
Experience
These JavaScript language questions were asked; candidate answers were not provided.
Question 6
Medium
Implement a collapsible tree UI with +/- controls. The supplied data has Root with Child 1 and Child 2; Child 1 has Child 1.1 and Child 1.2.
Experience
Build the expand/collapse interface for the supplied nested structure; no implementation details were reported.
Question 7
Medium
How do setTimeout and setInterval differ, and what does defer do in HTML? Can defer be used on an img element?
Experience
The round included these JavaScript timing and HTML loading questions.
60 min
Question 1
Medium
Given an undirected graph with n nodes labeled 0 to n−1 and edges [u,v], determine whether it can be colored using exactly two colors so adjacent nodes have different colors. Return true if possible and false otherwise.
Experience
This is a bipartite-graph check framed as a Java coding task. The candidate’s solution or result was not reported.