Skip to contentSkip to footer

Fullstack Developer Interview Questions

Salaries
Interviews

3,985 fullstack developer interview questions shared by candidates

Can you nest spans? (yes, you can but who cares) What are the 3 types of css? (The mother of all useless questions) He didn't know server-side rendering with React is a thing. He had no idea what micro-frontends were. It felt like I was talking to a brick wall. He also thought that since I was a frontend engineer, I don't understand what microservices were. I was talking about caching SSR pages and he said, we're not gonna talk about that because you don't have backend experience not knowing anything about modern SSR. I did correct him but he didn't seem to understand what I was saying anyway. Please do not do yourself the disservice of joining this company.
avatar

Fullstack Engineer

Interviewed at PwC

3.7★
Oct 20, 2022

Can you nest spans? (yes, you can but who cares) What are the 3 types of css? (The mother of all useless questions) He didn't know server-side rendering with React is a thing. He had no idea what micro-frontends were. It felt like I was talking to a brick wall. He also thought that since I was a frontend engineer, I don't understand what microservices were. I was talking about caching SSR pages and he said, we're not gonna talk about that because you don't have backend experience not knowing anything about modern SSR. I did correct him but he didn't seem to understand what I was saying anyway. Please do not do yourself the disservice of joining this company.

Given a string s and two words w1 and w2 that are present in S. The task is to find the minimum distance between w1 and w2. Here, distance is the number of steps or words between the first and the second word. Input : s = “geeks for geeks contribute practice”, w1 = “geeks”, w2 = “practice” Output : 1 There is only one word between the closest occurrences of w1 and w2. Input : s = “the quick the brown quick brown the frog”, w1 = “quick”, w2 = “frog” Output : 2
avatar

Senior Fullstack Engineer

Interviewed at RingCentral

3.5★
Apr 17, 2024

Given a string s and two words w1 and w2 that are present in S. The task is to find the minimum distance between w1 and w2. Here, distance is the number of steps or words between the first and the second word. Input : s = “geeks for geeks contribute practice”, w1 = “geeks”, w2 = “practice” Output : 1 There is only one word between the closest occurrences of w1 and w2. Input : s = “the quick the brown quick brown the frog”, w1 = “quick”, w2 = “frog” Output : 2

Viewing 3951 - 3960 interview questions

Glassdoor has 3,985 interview questions and reports from Fullstack developer interviews. Prepare for your interview. Get hired. Love your job.