KeyValue Software Systems Full Stack Developer Interview Questions and Answers

Q1. Don't remember so I have no
Add your answer
Q2. I can't remember it
Add your answer

Q1. I don't know the res
Add your answer
Q2. I can't remember it
Add your answer

Questions on dsa, coding question, overall good experience and so on

Q1. Binary search and sorting
Add your answer
Q2. Prime number coding question
Add your answer

Q1. C++ this pointer
Add your answer
Q2. Python gil library questions asked
Add your answer

Q1. Difference between string and string builder.
Ans. 
String is immutable, while StringBuilder is mutable and more efficient for concatenating strings.
• String is immutable, meaning once created, its value cannot be changed. StringBuilder is mutable, allowing for modifications without creating new objects.

• String concatenation creates a new string object each time, while StringBuilder modifies the existing object directly.

• StringBuilder is more efficient for concatenating mul...read more
Answered by AI
Add your answer
Q2. What is async and await
Ans. 
Async and await are keywords in JavaScript used to work with asynchronous code.
• Async is used to define a function as asynchronous, allowing it to run in the background without blocking the main thread.

• Await is used to pause the execution of an async function until a Promise is settled, and then resumes the function with the resolved value.

• Async/await is a more readable and cleaner way to write asynchronous code compare...read more
Answered by AI
Add your answer

Q1. About yourself,project,and basic java concepts
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. Dijkstra Algorithm
We will run Dijkstra Algorithm for all vertices in this approach and store the minimum distance in an array. Then we can answer the queries using this distance array.
 
Dijkstra Algorithm is one of the most popular algorithms in graph theory. A single-source shortest path algorithm gives the shortest path length to all vertices from a given vertex known as the source vertex. It is a greedy algorith...read more
Answered Anonymously
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
 
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...read more
Answered Anonymously
Add your answer