Fastenal Software Developer Interview Questions and Answers

Q1. Impliment counter using closure in js
Ans. 
Implement a counter using closure in JavaScript.
• Create a function that returns another function which increments a counter variable.

• The counter variable should be defined in the outer function's scope and only accessible to the inner function.

• Each time the inner function is called, increment the counter variable and return its value.
Answered by AI
Add your answer
Q2. Explain promises, promise.all(), impliment binary search
Ans. 
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
• Promises are used in JavaScript to handle asynchronous operations.

• promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...read more
Answered by AI
Add your answer

Q1. Questions on kafka, cache invalidation, diff b/w authentication and authorization
Add your answer

Q1. Why you want to join facebook?
Ans. 
I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.
• Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.

• Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.

• Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...read more
Answered by AI
Add your answer
Q2. Whats the best feature you like in Facebook?
Ans. 
I appreciate the personalized news feed feature on Facebook.
• Personalized news feed shows content based on user interests

• Helps users stay updated on relevant information

• Allows users to engage with content they are interested in
Answered by AI
Add your answer

They have their own coding platform. The questions are basically from tree.

Tree of space question

Q1. Previous round question solution
Add your answer
Q2. System design was asked.
Add your answer

Asked about the dsa questions and about trees

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

Q1. Just a go thru life and career
Add your answer
Q2. What are 3 weaknesses
Ans. 
Three weaknesses include lack of experience in a specific technology, difficulty with time management, and tendency to overthink solutions.
• Lack of experience in a specific technology (e.g. not familiar with a certain programming language or framework)

• Difficulty with time management (e.g. struggling to prioritize tasks effectively)

• Tendency to overthink solutions (e.g. spending too much time analyzing a problem before ta
Answered by AI
Add your answer

Q1. Reverse nodes in k-group.
Ans. 
Reverse nodes in k-group is a problem where we need to reverse every k nodes in a linked list.
• Break the linked list into groups of k nodes

• Reverse each group of k nodes

• Connect the reversed groups back together
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer

Round duration - 60 minutes
Round difficulty - Easy

This Round was based on CS fundamentals and One coding question was there as a Code-pair.

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
Find the Next Greater Element for each element in a list of integers.
• Iterate through the list of integers from right to left.

• Use a stack to keep track of elements whose NGE is yet to be found.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Assign the NGE as the top element of the stack or -1 if the stack is empty.
Answered by AI
Add your answer