Fastenal interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Fastenal
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I started with python specialization course. After that, switched to C++ and started learning DSA from geeksforgeeks and from other online resources. Along with that I learned some CS fundamentals as OOPS, DBMS, OS and computer networks .
Application story
I applied in on-campus placement process. There were total 3 rounds. First was technical test, then technical interview and last is HR interview.
Why selected/rejected for the role?
I have practiced Data structures and Algorithms extensively. Along with that good CS fundamentals knowledge was a huge plus point.
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, Dynamic Programming, OOPS, OS, DBMS, CN
Tip
Tip

Tip 1 : Focus on DSA-PRACTICE 
Tip 2 : Prepare CS fundamentals 
Tip 3 : Do atleast two development or ML projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Try to follow a basic format and highlight important achievements
Tip 2 : Mention atleast two good projects

Interview rounds

01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date29 Aug 2022
Coding problem3

Timing was 7-9 pm
Environment was good

1. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach

To solve this I applied kadane's algorithm, where you keep two variables to store, stores the maximum sum contiguous subarray ending at current index and a variable stores the full sum of contiguous subarray found so far.

Try solving now

2. Largest Element in the Array

Easy
10m average time
90% success
0/40
Asked in companies
MakeMyTripOracleMorgan Stanley

Given an array ‘arr’ of size ‘n’ find the largest element in the array.


Example:

Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5]

Output: 5

Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5.
Problem approach

Run a loop through the array to find the largest number.

Try solving now

3. Add Strings

Easy
0/40
Asked in companies
AppleFacebookAmazon

You are given two non-negative integers, ‘NUM1’ and ‘NUM2’, in the form of strings. Return the sum of both strings.


Note :
You do not need to print anything, it has already been taken care of. Just implement the given function.
Example:
Let ‘NUM1’ be: “5”
Let ‘NUM2’ be: “21”
The sum of both numbers will be: “26”.
Problem approach

Reverse the strings, keep adding digits one by one and also keep track of carry. At last reverse resultant string.

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date30 Aug 2022
Coding problem4

Timing was 10 am.
Environment was good.
Interviewer was very friendly.

1. Set Matrix Zeros

Easy
30m average time
65% success
0/40
Asked in companies
AmazonDunzoGoldman Sachs

You are given an N x M integer matrix. Your task is to modify this matrix in place so that if any cell contains the value 0, then all cells in the same row and column as that cell should also be set to 0.

Requirements:

  • If a cell in the matrix has the value 0, set all other cells in that cell's row and column to 0.
  • You should perform this modification in place (without using additional matrices).

You must do it in place.

For Example:

If the given grid is this:
[7, 19, 3]
[4, 21, 0]

Then the modified grid will be:
[7, 19, 0]
[0, 0,  0]
Problem approach

In this first approach, I told to store which column and rows has zeroes in a separate matrix and then run a loop again , and make row and column zero containing zeroes. Interviewer asked me to optimize this by reducing the space complexity. So following approach I gave was that we can store zero at 0th index of every column and row if any zeroes exist in that column or row.

Try solving now

2. Theory Questions

What are OOPS pillars?
What is the difference in encapsulation and abstraction?
How do you apply abstraction with an example and code?
Some more problems from abstraction in deep.

Problem approach

Tip 1 : Read OOPS concepts very thoroughly
Tip 2 : Focus on abstraction pillar more.

3. DBMS Questions

Where do we use DBMS?

What are ACID properties?

Some SQL queries

Problem approach

Tip 1 : Read DBMS thoroughly
Tip 2 : Practice SQL queries
Tip 3 : If you know MySQL, its a plus point.

4. Merge K Sorted Arrays

Moderate
15m average time
85% success
0/80
Asked in companies
MathworksMicrosoftOracle

You have been given ‘K’ different arrays/lists, which are sorted individually (in ascending order). You need to merge all the given arrays/list such that the output array/list should be sorted in ascending order.

Problem approach

First approach is to run loops to sort. Then he asked me to optimize it. So i applied priority queue to reduce time complexity.

Try solving now
03
Round
Easy
HR Round
Duration15 minutes
Interview date30 Aug 2022
Coding problem1

Timing was 12 pm
Environment was good
Interviewer was friendly.

1. Basic HR Questions

Introduce yourself.

Why do you want to join this company? 

Where do you see yourself in 5 years? 

What are your expectations from company?

Problem approach

Tip 1 : Read about company in detail
Tip 2 : Know about your role very well
Tip 3 : Ask some questions from your side as well.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 8 problems
Interviewed by Fastenal
2771 views
1 comments
0 upvotes
Software Development
3 rounds | 12 problems
Interviewed by Fastenal
2047 views
1 comments
0 upvotes
Software Development
3 rounds | 6 problems
Interviewed by Fastenal
1819 views
0 comments
0 upvotes
Web Developer
3 rounds | 5 problems
Interviewed by Fastenal
756 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
3931 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2806 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1133 views
0 comments
0 upvotes