Spyne Front end 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

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

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

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
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

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