ffreedom app Softwaretest Engineer Interview Questions and Answers

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. Explain Deadlock?
Add your answer
Q2. Explain Red Black Tree?
Add your answer
Q3. Find local minima in a 1-D array?
Add your answer
Q4. Find local minima in 2-D array?
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

Q1. What is ambitionbox
Add your answer
Q2. How many questions are there in that
Add your answer

Q1. Same as above questions
Add your answer
Q2. Same as above questions second one
Add your answer

3 coding questions, medium

Q1. Related to string and prefix sum
Add your answer
Q2. How priority queue works and its implementation using min heap
Ans. 
Priority queue is a data structure that stores elements based on their priority, allowing for efficient retrieval of the highest priority element.
• Priority queue can be implemented using a min heap, where the root node always contains the minimum element.

• Insertion: Add the new element to the end of the heap and then heapify up to maintain the min heap property.

• Deletion: Remove the root node (minimum element), move the l...read more
Answered by AI
Add your answer

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...read more
Add your answer
Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Add your answer

Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...read more
Add your answer

Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Add your answer

BFS Implementation of a jug question.

Q1. Few hashmap questions
Add your answer
Q2. Object Oriented Programming questions
Add your answer