Fourkites Software Developer Interview Questions and Answers

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. To print all permutation of a string
Ans. 
Use recursion to generate all possible permutations of a given string.
• Use recursion to swap characters in the string to generate permutations

• Keep track of visited characters to avoid duplicates

• Base case: when the length of the string is 1, add it to the result array
Answered by AI
Add your answer

Q1. Coin change Problem of finding number of ways to achieve K value
Ans. 
The coin change problem involves finding the number of ways to make a certain value using a given set of coins.
• Use dynamic programming to solve the coin change problem efficiently.

• Create a 1D array to store the number of ways to make each value from 0 to the target value.

• Iterate through the coins and update the array based on the current coin's value.

• The final answer will be stored in the last element of the array.

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

Q1. Suduko solver question is given to me
Add your answer

2 questions, Easy and medium based

Q1. Stacks queues and array questions
Add your answer

Q1. Technical questions on projects
Add your answer

Q1. How to tackle any uncertain situations? Behavioural questions
Add your answer

Q1. Oops? .net core features
Add your answer

Round duration - 120 minutes
Round difficulty - Hard

This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.

Q1. 
Hourglass Pattern Problem Statement
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
Input:
The first and only line of input contains an integer, denoting the value of N.
Out...read more
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Add your answer
Q3. 
Sort a Stack Problem Statement
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.

Q1. 
Next Smaller Palindrome Problem Statement
You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.
Example:
Input:
T...read more
Add your answer
Q2. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Add your answer