First American SSE | Full stack | 6 years+ experience
- Result
- Ongoing
- Experience
- 6 years
- Posted
- 22 Oct 2025
Summary
I recently interviewed for a Full Stack position at First American, which involved four distinct rounds covering coding challenges, system design, and in-depth discussions on both front-end/back-end technologies and advanced architectural concepts.
How it went
My interview process for the Full Stack role at First American spanned four comprehensive rounds. The first round focused on coding, where I was tasked with two problems: 'Food Distribution,' which involved minimizing hunger differences among people using a given number of sandwiches, and 'Remove NonAlphabet from a sentence,' requiring me to filter out non-alphabetic characters from an input string.
The second round shifted to a project design discussion about my current work, followed by a system design challenge. I was asked to design the 'Nobroker' application, encompassing both tenant and owner workflows.
The third round delved into specific technical areas, covering both frontend and backend questions. We discussed topics such as VPC, Container Services, Code Security, SSR vs. CSR, and various optimization techniques.
Finally, the fourth round explored more advanced architectural and security concepts. This included discussions on IAM, JWT, oAuth, different deployment strategies, and methods for database scaling.
Questions asked (3)
- 01
Food Distribution
Data Structures & Algorithms
Function FoodDistribution(arr) read the array of numbers stored in arr which will represent the hunger level of different people ranging from 0 to 5 (0 meaning not hungry at all, 5 meaning very hungry). You will also have N sandwiches to give out which will range from 1 to 20. The format of the array will be [N, h1, h2, h3, ...] where N represents the number of sandwiches you have and the rest of the array will represent the hunger levels of different people. Your goal is to minimize the hunger difference between each pair of people in the array using the sandwiches you have available. For example: if arr is [5, 3, 1, 2, 1], this means you have 5 sandwiches to give out. You can distribute them in the following order to the people: 2, 0, 1, 0. Giving these sandwiches to the people their hunger levels now become: [1, 1, 1, 1]. The difference between each pair of people is now 0, the total is also 0, so your program should return 0. Note: You may not have to give out all, or even any, of your sandwiches to produce a minimized difference. Sample Test Cases Input:5, 2, 3, 4, 5 Output:1 Input:3, 2, 1, 0, 4, 1, 0 Output:4
- 02
Remove NonAlphabet from a sentence
Data Structures & Algorithms
You are given a sentence which contains alphabets, numbers, symbols, we should remove the non alphabet and return the sentence. Input: cats AND*Dogs-are Awesome output: cats ANDDogsare Awesome
- 03
Design Nobroker application
System Design
Design Nobroker application which has both tenet and owner workflow.