BrancoSoft Android Developer Interview Questions and Answers

VERBAL QUANT DI/LR and Picture based test

Q1. Write a fibonaci series in c++ or C?
Ans. 
Fibonacci series can be easily implemented using loops in C++ or C.
• Declare variables for first two numbers of the series

• Use a loop to calculate and print the next number in the series

• Repeat the loop until desired number of terms are printed
Answered by AI
Add your answer

Q1. Informed about the policies and made us sign a document
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The questions ranged from prime number concepts to one question on linked list.

Q1. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total ins...read more
Ans. 
Given DAY_HOURS and PARTS, find total instances of equivalent prime groups in a day divided into equal parts.
• Divide the day into equal parts and check for prime groups at the same position in different parts.

• Each prime group consists of prime numbers occurring at the same position in different parts.

• Return the total number of equivalent prime groups found.

• Ensure DAY_HOURS is divisible by PARTS and each hour in a prime
Answered by AI
Add your answer
Q2. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...read more
Ans. 
Add two numbers represented as linked lists in reverse order and return the sum as a linked list.
• Traverse both linked lists simultaneously, adding corresponding digits and carrying over if necessary.

• Handle cases where one list is longer than the other by considering carry over.

• Create a new linked list to store the sum digits in reverse order.

• Return the head of the new linked list as the result.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Exam was in the morning in 2nd shift. It was a difficult .

Q1. 
Sum of Even & Odd Digits
You need to determine the sum of even digits and odd digits separately from a given integer.
Input:
The first line of input is an integer T representing the number of test c...read more
Ans. 
Implement a function to find the sum of even and odd digits separately in a given integer.
• Iterate through each digit of the integer and check if it is even or odd.

• Keep track of the sum of even and odd digits separately.

• Return the sums of even and odd digits for each test case.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Hard

It was in the morning and there were approx 500 candidates for interview. Interviewers were very nice and cooperative.

Q1. What SQL questions do you have related to joins?
Ans. 
SQL questions related to joins
• Types of joins in SQL (inner join, left join, right join, full outer join)

• Difference between inner join and outer join

• Common join conditions (using ON vs WHERE)

• Handling NULL values in joins

• Performance considerations when using joins
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Medium

It was in the morning and interviewer was very nice and polite.