Appsquadz Software Android Developer Interview Questions and Answers

Q1. DS Algo, Backend and DB
Add your answer
Q2. Stack(DS) question and DB based questions
Add your answer
Q3. Scaling (Horizontal, Vertical) with use cases
Ans. 
Scaling refers to increasing capacity of a system. Horizontal scaling adds more machines, while vertical scaling adds more resources to a machine.
• Horizontal scaling involves adding more machines to a system to increase capacity

• Vertical scaling involves adding more resources to a machine to increase capacity

• Use cases for horizontal scaling include handling increased traffic or adding redundancy

• Use cases for vertical sca...read more
Answered by AI
Add your answer

It was ok. I was not able to solve all the questions.

Q1. Remove the last element from a linkedlist
Ans. 
To remove the last element from a linked list, iterate to the second last node and update its next pointer to null.
• Iterate through the linked list to find the second last node

• Update the next pointer of the second last node to null
Answered by AI
Add your answer
Q2. Some basic questions on oops dbms and os
Add your answer

2 questions of DSA medium to hard

60mintues DSA level coding exam

Q1. React js, ReactHooks, es67 features, bootstrap
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning around 9:00Am-9:30AM. Platform used for this round was hacerrank. Questions were of moderate to difficult level.

Q1. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Ans. 
Count the number of subarrays in an array whose XOR is equal to a given value.
• Iterate through the array and keep track of XOR values and their frequencies using a hashmap.

• For each element in the array, calculate the XOR value with all previous elements and check if it equals the given XOR value.

• Use the concept of XOR to efficiently solve the problem.

• Handle edge cases like XOR value being 0 separately.

• Time complexity ca...read more
Answered by AI
Add your answer
Q2. 
Distinct Characters Problem Statement
Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
Example:
Input:
STR = ...read more
Ans. 
Return all possible non-empty subsequences with distinct characters from a given string.
• Iterate through all possible subsequences of the input string

• Check for distinct characters in each subsequence

• Return the distinct character subsequences as an array of strings
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 8:00PM-8:20PM. Interviewer was very calm in questioning. Platform used for this round was Skype and the questions focused more on personality rather than total.