JJ Associates Full Stack Developer Interview Questions and Answers

Quantitative , figure ,mcq question based on tech stack and 2 coding question which are basic. 90 minute time limit.

Q1. Angular question
Add your answer
Q2. .net question and sql question
Add your answer

Regarding To My Full Stack

Regarding To My Full Stack

Q1. What Is Python And Discuss With Some Questions
Add your answer
Q2. In that Case Studies
Add your answer

Q1. Java related questions
Add your answer

Q1. Basic intro with work experience and skillset
Add your answer

Q1. After a quick intro jumped into coding - it was an easy DSA question which unfortunately i wasn't able to solve in best time complexity. - find 2nd max element in an array (this was in JS language) you ca...read more
Add your answer
Q2. Alot of questions on vanilla JS
Add your answer
Q3. Asked if i know mongoDB as its a full stack dev role - which i didnt knew so i said not prepared as of now
Add your answer
Q4. Asked React questions - higher order component, hooks, useeffect, prepare lifecycle methods thouroughly
Add your answer

Q1. Explain architecture of project
Ans. 
The project architecture follows a microservices design pattern with separate front-end and back-end components.
• Utilizes microservices architecture for scalability and flexibility

• Separate front-end and back-end components for modularity

• May include technologies like Docker for containerization and Kubernetes for orchestration
Answered by AI
Add your answer
Q2. Async and await difference
Ans. 
Async and await are keywords in JavaScript used for handling asynchronous operations.
• Async is used to define a function as asynchronous, allowing it to use the await keyword.

• Await is used to pause the execution of an async function until a Promise is settled.

• Async functions always return a Promise, which resolves with the value returned by the function.

• Using async/await makes asynchronous code easier to read and write
Answered by AI
Add your answer

Two coding question and some aptitude

Q1. Oops concepts and basic coding programs
Add your answer

Q1. Basics Javascript
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was at 9 am in the morning

Q1. Add two number as linked lists
You have been given two singly Linked Lists, where each of them represents a positive number without any leading zeros.
Your task is to add these two numbers and print the ...read more
Ans. Naive Method
We will use the naive method to add two linked lists. While adding two numbers, we always add digits in the right to left manner. So first, we will reverse both linked lists so that we can easily process the number in this manner.
 
We will be storing the result of the addition in a different linked list. We will start adding the nodes of both linked lists and use another variable ‘carry’ to keep track o...read more
Answered by CodingNinjas
View 1 more answer
Q2. Cycle Detection In Undirected Graph
You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.
Your task is to find if the g...read more
Ans. DFS Approach (Slow)
There is a cycle in the graph only if there is a back edge (back edge is an edge that connects a vertex to another vertex that is discovered before it's parent) present in the graph. To detect a back edge, we will keep track of vertices that have been already visited. If we reach a vertex that is already visited and is not the parent vertex of the current vertex, then there is a cycle in the graph.&n...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 50 Minutes
Round difficulty - Hard

Q1. Technical Questions
What is OOPS . Tell the different OOps features. Implement method overloading in c++
What is Synchronisation. How can we implement synchronisation in C++
What is Normalisation? Also implem...read more
Add your answer
Q2. Maximum Subarray Sum
You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.
Note: An array C is a subar...read more
Ans. Brute Force
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops. 
 
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:
O(1), constant space is used.
Time Complexity: O(n^3...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30 Minutes
Round difficulty - Hard

Happened on teams

Q1. Basic HR Questions
Explain yourself. How will you manage a team of 10 employees
Add your answer