TestingXperts Full Stack Developer Interview Questions, Process, and Tips

3 Questions of mid difficulty

2 questions of mid to hard difficulty

Q1. Basic DSA and problem solving related questions
Add your answer
Q2. How to design and implement a dictionary application
Ans. 
Design and implement a dictionary application for easy word lookup
• Define data structure to store words and their meanings

• Implement search functionality to look up words quickly

• Include features like word suggestions, synonyms, and antonyms

• Allow users to add new words and meanings to the dictionary

• Consider implementing a user-friendly interface for easy navigation
Answered by AI
Add your answer

Q1. Project related questions
Add your answer

Technology advantage or not

All aptitude topics,logical reasoning

Q1. Oops,2 coding questions
Add your answer
Q2. Palindrome,even number
Add your answer

Q1. What do you know
Add your answer
Q2. Do you have any questions
Add your answer

Aptitude,reasoning,verbal,C language,Java,C++

Q1. What is interface in JAVA
Add your answer
Q2. Explain OOPS in JAVA
Add your answer

Good and easy learn dsa and algo

Learn dsa and algo binary tree and lists

Q1. Learn basic subjects and topics like OS and Cloud
Add your answer

Q1. Short round based on aptitude and attidtude
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.