Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Spyne Team. If you also belong to the team, you can get access from here

Spyne Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Spyne Front end Developer Interview Questions and Answers

Updated 12 Jun 2024

Spyne Front end Developer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Not Selected

I applied via Company Website and was interviewed in May 2024. There was 1 interview round.

Round 1 - Assignment 

Add captions on video. User can type caption text and set duration (timestamp) of caption.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be clear about how many rounds will be there. Don't wait for them to respond, keep applying. Mine took 25 days and still got rejected due to miscommunication.

Interview questions from similar companies

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

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...

  • 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 ...

  • Answered by AI
  • 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...

  • 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
Round 2 - Coding Test 

(1 Question)

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...

  • 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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteriaPassouts 2020/2021JUSPAY interview preparation:Topics to prepare for the interview - Strings, Arrays, Sorting algorithms, Linked List, Loops, Sliding windows, Graphs, Trees, OOPS, DSA, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to

Application resume tips for other job seekers

Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page

Final outcome of the interviewRejected
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Good and nice and it was well organized.

Round 2 - HR 

(1 Question)

  • 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

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Past experience
  • Q2. How much da u know
Round 2 - Technical 

(2 Questions)

  • 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
  • Q2. Hoising based question

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Solving normal Puzzles to test aptitude.

Round 2 - Coding Test 

Sample app was asked to create.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well domain specfic.
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

- simple basic ios questions

Round 2 - Technical 

(1 Question)

  • Q1. Asked DSA array questions

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare well DSA and code
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Kadance algorithm and find the middle of the linklist

Round 2 - Coding Test 

More on java and Python based coding questions

Round 3 - HR 

(4 Questions)

  • Q1. Behavioural questions were asked
  • Q2. What are your expectations from this job
  • Q3. What are your plans ahead
  • Q4. Where do you see yourself in 5 years ahead

Interview Preparation Tips

Interview preparation tips for other job seekers - Do good practise of DSA

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(1 Question)

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'...

  • 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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteriaAbove 6 CGPAJUSPAY interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Do some projects
Tip 2 : Be good in data structure
 

Application resume tips for other job seekers

Tip 1 : Keep it short
Tip 2 : Don't try to add false things.

Final outcome of the interviewRejected

I was interviewed in Mar 2021.

Round 1 - Coding Test 

(1 Question)

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...

  • 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

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriacgpa above 7.5JUSPAY interview preparation:Topics to prepare for the interview - Python, data structure , algorithm, database , osTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture. 
Tip 3 : Project matters

Application resume tips for other job seekers

Tip 1 : Have web development project
Tip 2 : learn purescript and node.js

Final outcome of the interviewRejected
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3 Graph Questions Were asked of difficulty medium to hard.

Round 2 - Case Study 

Hackathon round which revolved around multithreading

Spyne Interview FAQs

How many rounds are there in Spyne Front end Developer interview?
Spyne interview process usually has 1 rounds. The most common rounds in the Spyne interview process are Assignment.

Tell us how to improve this page.

Spyne Front end Developer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Interview Questions from Similar Companies

MagicPin Interview Questions
3.0
 • 49 Interviews
Tokopedia Interview Questions
4.0
 • 27 Interviews
Meritto Interview Questions
3.6
 • 22 Interviews
JUSPAY Interview Questions
2.9
 • 21 Interviews
Furlenco Interview Questions
3.4
 • 21 Interviews
Droom Interview Questions
3.8
 • 19 Interviews
Melorra Interview Questions
3.1
 • 18 Interviews
Nestaway Interview Questions
3.9
 • 17 Interviews
AstroTalk Interview Questions
3.4
 • 17 Interviews
View all
Product Manager
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Operations Associate
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst Intern
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Spyne with

MagicPin

3.0
Compare

Awign Enterprises

4.0
Compare

Nestaway

3.9
Compare

Simplimadly

Compare
Did you find this page helpful?
Yes No
write
Share an Interview