Astroyogi Web Developer Interview Questions and Answers

Good and nice and it was well organized.

Q1. What was ur experience?
Ans. 
I have over 5 years of experience in front end development, working on various projects and technologies.
• Developed responsive websites using HTML, CSS, and JavaScript

• Worked with frameworks like React and Angular to build interactive user interfaces

• Optimized website performance and implemented SEO best practices

• Collaborated with designers and backend developers to deliver high-quality products
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

It had some coding questions related to graph.

Q1. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labelled from 0 to V-1) and ‘E’ edges. Each edge connecting two nodes u and v has a weight denoting the distance between th...read more
Ans. 
The question is about finding the shortest path distance from a source node to all vertices in an undirected graph.
• The graph is represented by the number of vertices and edges, followed by the edges and their distances.

• The task is to find the shortest path distance from the source node (0) to all other nodes.

• If a node is disconnected from the source node, print the maximum positive integer value (2147483647).

• Implement ...read more
Answered by AI
View 2 more answers
Q2. Check If Path Exists
You are given a directed and unweighted graph of 'V' vertices and 'E' edges. All edges are given in a 2-dimensional array ‘Edges’ in which ‘Edges[i][0]’ and ‘Edges[i][1...read more
Ans. 
The task is to check if there exists a path from a given source vertex to a destination vertex in a directed and unweighted graph.
• Read the number of test cases.

• For each test case, read the number of vertices and edges.

• Read the edges of the graph.

• Read the source and destination vertices.

• Implement a graph traversal algorithm (e.g., BFS or DFS) to check if a path exists from the source to the destination.

• Print 'true' if a
Answered by AI
View 2 more answers

Round duration - 180 Minutes
Round difficulty - Hard

The round was really tough only 1 coding question was asked

Q1. Encode N-ary tree to binary tree
You have been given an N-ary tree ‘N’ nodes with node ‘1’ as head of the tree. Encode the above N-ary tree into a binary tree such that if only the encoded binary tree was ...read more
Ans. 
The task is to encode an N-ary tree into a binary tree and then decode the binary tree back into the original N-ary tree.
• Encode the N-ary tree by representing each node as a binary tree node with its first child as the left child and subsequent children as the right child.

• To decode the binary tree, traverse the binary tree and for each node, create a new N-ary tree node with its left child as the first child and subseq...read more
Answered by AI
View 1 more answer
Q2. Technical Questions
What are the different lifecycle methods in React?
 Explain Strict Mode in React.
How to prevent re-renders in React?
Ans. 
Lifecycle methods in React, Strict Mode, and preventing re-renders.
• Lifecycle methods in React include componentDidMount, componentDidUpdate, componentWillUnmount, etc.

• Strict Mode is a tool for highlighting potential problems in React components.

• To prevent re-renders in React, use shouldComponentUpdate or React.memo.
Answered by AI
Add your answer