i
Spyne
Filter interviews by
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
Add captions on video. User can type caption text and set duration (timestamp) of caption.
Top trending discussions
I was interviewed in Aug 2021.
Round duration - 180 Minutes
Round difficulty - Medium
It had some coding questions related to graph.
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...
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 ...
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...
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
Round duration - 180 Minutes
Round difficulty - Hard
The round was really tough only 1 coding question was asked
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...
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...
Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to
Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page
I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.
Good and nice and it was well organized.
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
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
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
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Solving normal Puzzles to test aptitude.
Sample app was asked to create.
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was late evening . Platform was good.
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'...
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.
Tip 1 : Do some projects
Tip 2 : Be good in data structure
Tip 1 : Keep it short
Tip 2 : Don't try to add false things.
I was interviewed in Mar 2021.
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
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...
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.
Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture.
Tip 3 : Project matters
Tip 1 : Have web development project
Tip 2 : learn purescript and node.js
3 Graph Questions Were asked of difficulty medium to hard.
Hackathon round which revolved around multithreading
based on 1 interview
Interview experience
Product Manager
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Operations Associate
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst Intern
6
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicPin
Awign Enterprises
Nestaway
Simplimadly