Spyne Front end Developer Interview Questions and Answers

Round duration - 180 Minutes
Round difficulty - Medium

It had some coding questions related to graph.

Q1. 
Dijkstra's Shortest Path Problem Statement
You are given an undirected graph with V vertices (numbered from 0 to V-1) and E edges. Each edge connects two nodes u and v and has an associated weight represe...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
Add your answer
Q2. 
Path Existence in Directed Graph
Given a directed and unweighted graph characterized by vertices 'V' and edges 'E', determine if a path exists from a specified 'source' vertex to a 'destination' vertex. T...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
Add your answer

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 Problem Statement
You are provided with an N-ary tree constituted of 'N' nodes, where node '1' is the head of the tree. Your task is to encode this N-ary tree into a binar...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
Add your answer

Q1. Past experience
Add your answer
Q2. How much da u know
Add your answer

Q1. Merge sort in js
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
• Divide the array into two halves recursively

• Sort each half using merge sort recursively

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Hoising based question
Add your answer

Solving normal Puzzles to test aptitude.

Sample app was asked to create.

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening . Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Keep track of visited cells to avoid infinite loops.

• Return the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• When reaching the destination, add the path to the list of valid paths.
Answered by AI
Add your answer

3 Graph Questions Were asked of difficulty medium to hard.

Hackathon round which revolved around multithreading

They have their own coding platform. The questions are basically from tree.

Tree of space question

Q1. Previous round question solution
Add your answer
Q2. System design was asked.
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer