Allerin Tech 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

Q1. Java oops concepts
Add your answer

Q1. Self intro for yourself
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

Asked related to python

Q1. Tell me about yourself
Add your answer
Q2. Explain the project in resume
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

1 round of dsa with 2 questions

Q1. 1 system design round
Add your answer
Q2. LLD round for 30 minutes
Add your answer

Q1. Previous project discussion
Add your answer
Q2. Discuss past project, tech stack for 30 mins
Ans. 
Developed a web-based project management tool using React, Node.js, and MongoDB.
• Used React for the front-end development

• Used Node.js for the back-end development

• Used MongoDB for the database management

• Implemented features like task assignment, progress tracking, and file sharing

• Followed Agile methodology for project management
Answered by AI
Add your answer

Q1. Basic hr questions, salary discussion
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Path Queries
You are given a weighted, undirected graph with ‘V’ vertices numbered from 1 to ‘V’ and ‘E’ bidirectional edges.
You have to answer ‘Q’ queries. Every query has two integers, ‘u’, ‘v’, repre...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 by CodingNinjas
View 1 more answer
Q2.  Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge so...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 by CodingNinjas
View 1 more answer
Q3. Rat In a Maze: All Paths
You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['...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 by CodingNinjas
Add your answer