WASP3D Associate Software Engineer Interview Questions and Answers

Aptitude Question on various standard topics .

Q1. Application of stack in real life.
Ans. 
Stacks are used in real life for managing undo operations in text editors, backtracking in maze solving, and managing function calls in programming.
• Undo operations in text editors - allows users to go back to previous states of a document

• Backtracking in maze solving - helps in keeping track of visited paths and backtracking when necessary

• Managing function calls in programming - helps in keeping track of function calls
Answered by AI
Add your answer
Q2. Difference between i++ and ++i through implementation.
Ans. 
i++ and ++i are both increment operators in C++ but have different behaviors.
• i++ is a post-increment operator which increments the value of i after using it in an expression.

• ++i is a pre-increment operator which increments the value of i before using it in an expression.

• Example: int i = 5; int a = i++; // a = 5, i = 6; int b = ++i; // b = 7, i = 7;
Answered by AI
Add your answer

Q1. About your intro and family background.
Add your answer

Q1. How does recyclerview works internally ?
Ans. 
RecyclerView is a flexible view for providing a limited window into a large data set.
• RecyclerView recycles views to improve performance and memory usage.

• It uses LayoutManager to organize items in a grid, list, or staggered grid layout.

• Adapter provides data to be displayed in RecyclerView.

• ItemDecoration can be used to add spacing between items or decorations to items.

• ItemAnimator can be used to animate item changes in t
Answered by AI
Add your answer
Q2. Android basics , Live Data , ViewModel, coroutines internal working
Add your answer

It was quite easy, all the questions were from leetcode

Round duration - 90 minutes
Round difficulty - Medium

It was an MCQ + coding based round consisting of multiple choice questions from topics like Aptitude, Logical reasoning, English, Programming ,etc. and 2 coding problems

Q1. All prime numbers
Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).
Print the prime numbers in different lines.
Input Format :
Integer N
Output Format :
...read more
Ans. 
You can solve this problem using brute force or sieve of eratosthenes. I solved it using sieve of eratosthenes
Answered Anonymously
Add your answer
Q2. Print Permutations
Given an input string (STR), print all possible permutations of the input string.
Note:
The input string may contain the same characters, so there will also be the same permutations.
T...read more
Ans. 
I solved this problem by using Recursion + backtracking
Answered Anonymously
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

There were 2 interviewers. Firstly, they asked me to give my introduction. Then they asked me to explain any one of my projects in detail along with its demonstration. After this, they began with the DSA and computer fundamentals part.

Q1. Two Sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use th...read more
Ans. 
I solved this problem using hashmap
Answered Anonymously
Add your answer
Q2. Queue Using Stack
Implement a queue data structure which follows FIFO(First In First Out) property, using only the instances of the stack data structure.
Note:
1. To implement means you need to complete ...read more
Ans. 
You can solve this problem by making either of enQueue or deQueue operation costly. I solved it by making the enQueue operation costly.
Answered Anonymously
Add your answer
Q3. Swap Kth Elements
Given an array ‘ARR’ of size ‘N,’ swap the Kth element from beginning with the Kth element from the end.
For example:
If ‘N’ = 5 and K = 2
[1, 2, 3, 4, 5]

Then the output will be [1, 4...read more
Ans. 
Step 1: Find the kth node from the start and the kth node from the end (n-k+1th node from start)
Step 2: Swap both the nodes
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had questions related to aptitude and coding

Q1. Find duplicates in an array
You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. ...read more
Ans. Sorting
1. The most trivial approach would be to sort the array/list ‘ARR’ and then return the duplicates.
2. After sorting the array in non-decreasing order, do the following for all the elements from i = 0 to i = n - 2:
   • If ARR[i] == ARR[i + 1], then add ARR[i] to the the output list.
   • While ARR[i] == ARR[i + 1], do i = i + 1, since we don’t want to add the same duplicate elements again and again.
   • Else continue.
3. After this loop, w...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had some questions from OOPS and some from DBMS

Q1. OOPS Question
What is Compile time Polymorphism and how is it different from Runtime Polymorphism?
Add your answer
Q2. DBMS Question
What is meant by ACID properties in DBMS?
Add your answer
Q3. OOPS Question
What are the various types of inheritance?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to the point and professional. The interview lasted for 30 minutes.

Q1. Basic HR Question
Tell me something not there in your resume
Ans. 
If you get this question, it's an opportunity to choose the most compelling information to share that is not obvious from your resume.

Example :
 
Strength -> I believe that my greatest strength is the ability to solve problems quickly and efficiently, which makes me unique from others.
 
Ability to handle Pressure -> I enjoy working under pressure because I believe it helps me grow and become more efficient...read more
Answered Anonymously
Add your answer

AI

C#

Q1. Basic concepts of OOPS, web development, some easy-medium level coding questions. Your projects and aspirations.
Add your answer
Q2. Theoretical concepts of DBMS, OS & Computer Network, basic SQL queries.
Add your answer

Q1. Why should we hire you?
Add your answer
Q2. What are your strengths and weaknesses?
Add your answer
Q3. Tell me about yourself.
Add your answer