AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
SpiderG Frontend Developer Intern Interview Questions and Answers
SpiderG Frontend Developer Intern Interview Experiences
1 interview found
Anonymous
Selected
I applied via Internshala and was interviewed before Aug 2023. There was 1 interview round.
(2 Questions)
- Q1. 2 things not mentioned in the resume
- Q2. What are Angular Pipes?
- Ans.
Angular Pipes are used to transform data in Angular templates.
Angular Pipes are used to format data before displaying it in the view.
They can be used to transform strings, numbers, dates, and other types of data.
Common built-in pipes include DatePipe, UpperCasePipe, LowerCasePipe, and CurrencyPipe.
Custom pipes can also be created to suit specific formatting needs.
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.
- Q1.
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
... - Ans.
Merge two sorted linked lists into a single sorted linked list without using additional space.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value list
Continue this process until one of the lists is fully traversed
Append the remaining elements of the other list to the me
- Q2.
Sort 0 1 2 Problem Statement
Given an integer array
arrof size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.Input:
The first line contains an integer 'T' representing the n... - Ans.
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
It was more of a in depth round on the framework I'm working on and problem solving.
- Q1. What is the event loop and what is its significance?
- Ans.
The event loop is a mechanism in programming that allows for asynchronous execution of code.
The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.
It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.
The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...
- Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
- Ans.
Output-based questions in JavaScript using browser APIs
Example 1: Write a script that uses the Geolocation API to display the user's current location on a map
Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked
Example 3: Develop a web page that uses the Canvas API to draw a simple animation
- Q3. How would you design a system to support localization in a mobile app?
- Ans.
Designing a system to support localization in a mobile app
Use resource files to store localized strings for different languages
Implement a language selection feature for users to choose their preferred language
Utilize localization libraries or frameworks to streamline the process
Consider cultural differences when localizing content, such as date formats and currency symbols
(3 Questions)
Round duration - 75 Minutes
Round difficulty - Hard
It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.
- Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
- Ans.
To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.
Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.
Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.
Keep track of the results and compare the timings to d
- Q2. How do you debug the root cause of lag on a screen?
- Ans.
To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.
Analyze code to identify any inefficient algorithms or operations causing lag.
Check for memory leaks that could be impacting performance.
Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.
Use profiling tools like Xcode Instruments or Android Profiler to identify p
- Q3. Can you explain the architecture of the app you have recently worked on?
- Ans.
The app I recently worked on is a social media platform for sharing photos and connecting with friends.
The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.
The client side is built using React Native for cross-platform compatibility.
The server side is implemented using Node.js with a MongoDB database for storing user data and photos.
The a...
Interview Preparation Tips
Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)
Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q2.
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...
- Ans.
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
- Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
- Ans.
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
Chirag Varshney
(4 Questions)
- Q1. Explain Deadlock?
- Q2. Explain Red Black Tree?
- Q3. Find local minima in a 1-D array?
- Q4. Find local minima in 2-D array?
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
- Q1.
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...
- Ans.
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
- Q2.
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
- Ans.
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Next Greater Element Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Interview Preparation Tips
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
Skills evaluated in this interview
I appeared for an interview before May 2021.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
1 easy and 2 medium-hard DSA problems to solve
- Q1.
Hurdle Game Problem Statement
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
- Ans.
Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.
Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level
Return the current level as the number of levels cleared
- Q2.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they ar...
- Ans.
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
- Q3.
Count Ways To Travel Triangular Pyramid
Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...
- Ans.
Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.
Bob can move to any adjacent vertex in a single step
Bob must return to vertex 'O' after exactly 'N' steps
Calculate the number of different ways Bob can complete the journey
Return the result modulo 1000000007
Consider the constraints provided
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
2 DSA problems and computer subject questions
- Q1.
Generate Binary Strings with No Consecutive 1s
Given an integer
K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.Input:
The input begins with an integer ... - Ans.
Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.
Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.
Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.
Sort the generated strings in lexicographically increasing order before outputting them.
- Q2.
Shuffle Two Strings Problem Statement
You are provided with three strings
A,B, andC. The task is to determine ifCis formed by interleavingAandB.Cis considered an interleaving ofAandBif:- T...
- Ans.
Check if a string is formed by interleaving two other strings.
Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.
Use dynamic programming to efficiently solve the problem.
Handle edge cases like empty strings or unequal lengths of A, B, and C.
Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
DSA round
- Q1.
Ninja and Intersection of Lines
You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...
- Ans.
Find the intersection point of two lines on a 2D plane given their coordinates.
Calculate the slopes of both lines using the given coordinates.
Use the slope-intercept form of a line to find the equations of the two lines.
Solve the equations simultaneously to find the intersection point.
Return the coordinates of the intersection point with precision up to 6 decimal places.
- Q2.
Cycle Detection in Directed Graph
Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return
true. Otherwise, returnfalse.Input:
The first line of input contains... - Ans.
Detect cycles in a directed graph and return true if a cycle exists, false otherwise.
Use Depth First Search (DFS) to detect cycles in the directed graph.
Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.
If a vertex is visited and is present in the recursion stack, then a cycle exists.
Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
It is a managerial round
- Q1. How does a URL work and what is a load balancer?
- Ans.
A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.
A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.
URLs typically consist of a protocol (such as HTTP ...
Interview Preparation Tips
Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects
Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Jul 2021. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. What is the polymorphism?
- Ans.
Polymorphism is the ability of an object to take on many forms.
Polymorphism allows objects to be treated as if they are of multiple types.
It enables code to be written that can work with objects of different classes in a uniform way.
Polymorphism can be achieved through method overloading or method overriding.
Example: A shape class can have multiple subclasses like circle, square, triangle, etc. and all can be treated a...
- Q2. What is inheritance?
- Ans.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows for code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class, and can also add new properties and method...
Interview Preparation Tips
mightiersnowdrop
I applied via Naukri.com and was interviewed in Jun 2021. There were 2 interview rounds.
Interview Preparation Tips
I applied via Walk-in and was interviewed in Jan 2022. There were 2 interview rounds.
(3 Questions)
- Q1. Tell me about your self
- Q2. What is your strength
- Q3. What is your weakness
Interview Preparation Tips
I applied via Naukri.com and was interviewed in Feb 2022. There were 5 interview rounds.
Aptitude Test preparation is for checked the mental ability and critical thinking of a person
Written Programs and checking of program output
(2 Questions)
- Q1. This is a one on one round interview
- Q2. Basic of programs language and their concept
(2 Questions)
- Q1. Related questions of program during software and their concept and mostly checking our willing to work in this job and confidence
- Q2. Mental ability, confidence checking related attitude and question and software related questions
Interview Preparation Tips
- Javascript
- SQL
- Python
- Web Technologies
SpiderG Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- React Js Frontend Developer Interview Questions
- Angular Frontend Developer Interview Questions
- UI Frontend Developer Interview Questions
- Web Designer & Frontend Developer Interview Questions
- Junior Frontend Developer Interview Questions
- Senior Frontend Software Engineer Interview Questions
- Senior Frontend Web Developer Interview Questions
- Frontend Developer Team Lead Interview Questions
- Show more
SpiderG Frontend Developer Intern Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Udaan
Swiggy
CARS24
BlackBuck
- Home >
- Interviews >
- SpiderG Interview Questions >
- SpiderG Frontend Developer Intern Interview Questions
