Borderfree Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Move Zeroes to End
Given an unsorted array of integers, rearrange the elements such that all the zeroes are moved to the end, while maintaining the order of non-zero elements.
Input:
The first line cont...read more
Ans. 
Rearrange an unsorted array by moving all zeroes to the end while maintaining the order of non-zero elements.
• Iterate through the array and keep track of the count of non-zero elements encountered.

• While iterating, if the current element is non-zero, swap it with the element at the count index.

• After iterating, fill the remaining elements with zeroes.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Q1. 
Decode Ways Problem Statement
Given a string strNum that represents a number, the task is to determine the number of ways to decode it using the following encoding: 'A' - 1, 'B' - 2, ..., 'Z' - 26.
Input...read more
Ans. 
The task is to determine the number of ways to decode a given number string using a specific encoding.
• Iterate through the string and use dynamic programming to calculate the number of ways to decode at each position.

• Consider different cases such as single digit decoding, double digit decoding, and invalid decoding.

• Use modulo 10^9+7 to handle potentially large numbers of decode ways.

• Example: For '226', there are 3 possi
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Round duration - 90 Minutes
Round difficulty - Medium

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Find First Repeated Character in a String
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
Example:
Input:
STR =...read more
Ans. 
Find the first repeated character in a given string composed of lowercase English letters.
• Iterate through the string and keep track of characters seen so far in a set.

• If a character is already in the set, return it as the first repeated character.

• If no repeated character is found, return '%'.
Answered by AI
Add your answer