Fi Software Engineer Interview Questions and Answers

Q1. Find connected components in a graph
Ans. 
Use Depth First Search (DFS) to find connected components in a graph
• Start by initializing all vertices as unvisited

• Iterate through each vertex and perform DFS to find connected components

• Keep track of visited vertices to avoid revisiting

• Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Answered by AI
Add your answer

Q1. Design chess game
Ans. 
Design a chess game with proper board setup, piece movements, and win conditions.
• Create a 8x8 grid to represent the chess board

• Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)

• Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)

• Check for valid moves and capture opponent's pieces

• Implement win conditions (checkmate, stalemate)

• ...read more
Answered by AI
Add your answer

Build a typeahead component

Q1. Build a form for personal details
Ans. 
Build a form for personal details
• Include fields for name, email, phone number, address, date of birth

• Use input fields, dropdowns, and date pickers for user input

• Add validation for required fields and correct formats

• Consider user experience with clear labels and easy navigation
Answered by AI
Add your answer
Q2. Add validations to different fields
Ans. 
Implement validations for different fields in software development.
• Identify the fields that require validation such as email, password, phone number, etc.

• Use regular expressions to validate input data format.

• Implement client-side and server-side validations to ensure data integrity.

• Display error messages for invalid input to guide users on correct data entry.
Answered by AI
Add your answer

It was simple program of url shorting for registered and non registered users each request must have unique shortened url.

Q1. Palindrome implementation and run time
Ans. 
A palindrome is a word or phrase that reads the same backward as forward. Implementing it involves comparing the first and last characters and iterating towards the middle.
• Implement a function that takes a string as input and returns true if it is a palindrome, false otherwise.

• Use two pointers, one starting from the beginning and the other from the end, and compare the characters at each position.

• If the characters matc...read more
Answered by AI
Add your answer
Q2. DSA and various algorithms and run time
Add your answer

Q1. This round was one on one with VP of engineering. Basic q and a regarding role and responsibilities
Add your answer

Q1. Relocation, Reason For job change, future plan, careers objective
Add your answer

Q1. Basic questions on data structures
Add your answer

Q1. Second round was Managerial Round. The interviewer basically had a conversation with me and asked some hr questions also.
Add your answer

Q1. Basic HR questions
Add your answer

Scenarios base conding round

Questions on strings in javascript.
Basic javascript and typescript.

Q1. Questions on cloud technologies
Add your answer

Q1. Cultural fit and salary related discussion
Add your answer

Q1. It was one-on-one round with the CTO. They judged me on my technical knowledge as well as understanding of tech-era.
Add your answer
Q2. I was asked question related to the languages and tech-stacks I mentioned in my resume and also question related to OOPs concepts.
Add your answer

There were 2 easy question 1 medium
Question were good but have weak test case.

This was project or lld round.
You just be aware of class and other stuff.

Q1. Discussion on project Asked graph coding question in real scenerio. Like asked what algorithm you will use for different real life problems
Add your answer

Q1. Why engineering and what u know about cred
Add your answer

Q1. Insights about company and candidate
Add your answer
Q2. If I know Data structures or not?
Ans. 
Yes, I have knowledge of data structures.
• I have experience with common data structures like arrays, linked lists, stacks, queues, trees, and graphs.

• I understand the time and space complexity of different data structures and their operations.

• I have implemented data structures in various programming languages like C++, Java, and Python.

• For example, I have used a hash table to efficiently store and retrieve data in consta
Answered by AI
Add your answer