Frontend Developer Interview Questions

8,947 frontend developer interview questions shared by candidates

Had 3 Rounds of interview. 1.) Screening : in which they ask about basic questions related to your background and about your skills and role change motive 2.) Take home Coding challenge: They gave a small app to make, 3.) Technical Face to face interview: They discussed about the app which they asked in coding challenge along with a new app and how would I design that new web application.
avatar

Senior Frontend Developer

Interviewed at Sennder

2.9
Jan 6, 2022

Had 3 Rounds of interview. 1.) Screening : in which they ask about basic questions related to your background and about your skills and role change motive 2.) Take home Coding challenge: They gave a small app to make, 3.) Technical Face to face interview: They discussed about the app which they asked in coding challenge along with a new app and how would I design that new web application.

You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents: A cell containing a thief if grid[r][c] = 1 An empty cell if grid[r][c] = 0 You are initially positioned at cell (0, 0). In one move, you can move to any adjacent cell in the grid, including cells containing thieves. The safeness factor of a path on the grid is defined as the minimum manhattan distance from any cell in the path to any thief in the grid. Return the maximum safeness factor of all paths leading to cell (n - 1, n - 1). An adjacent cell of cell (r, c), is one of the cells (r, c + 1), (r, c - 1), (r + 1, c) and (r - 1, c) if it exists. The Manhattan distance between two cells (a, b) and (x, y) is equal to |a - x| + |b - y|, where |val| denotes the absolute value of val.
avatar

Frontend Developer

Interviewed at Huawei Technologies

3.4
May 15, 2024

You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents: A cell containing a thief if grid[r][c] = 1 An empty cell if grid[r][c] = 0 You are initially positioned at cell (0, 0). In one move, you can move to any adjacent cell in the grid, including cells containing thieves. The safeness factor of a path on the grid is defined as the minimum manhattan distance from any cell in the path to any thief in the grid. Return the maximum safeness factor of all paths leading to cell (n - 1, n - 1). An adjacent cell of cell (r, c), is one of the cells (r, c + 1), (r, c - 1), (r + 1, c) and (r - 1, c) if it exists. The Manhattan distance between two cells (a, b) and (x, y) is equal to |a - x| + |b - y|, where |val| denotes the absolute value of val.

Viewing 351 - 360 interview questions

Glassdoor has 8,947 interview questions and reports from Frontend developer interviews. Prepare for your interview. Get hired. Love your job.