Frontdoor Software Engineer III Interview Questions, Process, and Tips

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
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered Anonymously
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
Ans. Brute Force Approach:
For any 0 we just need to check its four adjacent sides and look for 1s in them. Therefore we could simply traverse the matrix, and if the current element is a 0, check how many of its adjacent neighbors are 1s and add this value to an integer variable ANS representing the result. In the end, return the value of ANS.
 
Steps:
• Keep a variable ANS which will store our answer.
• Traverse the matrix. Su...read more
Answered Anonymously
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
Ans. Brute Force
Steps:
 
• We iterate a given string, and while iterating the string, we maintain a temporary string word that stores the current word and then checks if we already count the word's occurrence previously by checking whether the word is present in the visited list.
• If the word is not present, then insert it in the visited list, and count the occurrences of the word in the rest of the string.
• Else, we simply sk...read more
Answered Anonymously
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
Ans. Brute Force
1. Sort the elements of ‘ARR’ using function ‘SORT’
2. Return element at ('K' - 1)th index
Space Complexity: O(1)Explanation:
O(1).
 
Since we are not using any extra space.
Time Complexity: O(nlogn)Explanation:
O(N * logN) where ‘N’ is the number of elements in the array.
 
As we are sorting the array which takes O(N * log(N)) time.
Answered Anonymously
Add your answer