Laundryheap Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

The round started at 8 PM. There was one question with several test cases and had to pass every test case in order to get a call for interview.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

It was first round for 45mins and only one question was asked.

Q1. 
Sum Of Zeroes Coverage Calculation
You are provided with a binary matrix containing dimensions 'N * M', comprised only of 0s and 1s. Your task is to compute the aggregated sum of coverages for all the zer...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

It was again 45 min interview and after an intro we quickly jumped in coding.

Q1. 
Word Occurrence Counting
Given a string 'S' of words, the goal is to determine the frequency of each word in the string. Consider a word as a sequence of one or more non-space characters. The string can h...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

It was an Technical + HR round. The interviewer was very understanding and he checked the overall knowledge of the subject.

Q1. 
Kth Smallest Element Problem Statement
You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...read more
Add your answer