Planet Spark Front end Engineer Interview Questions and Answers

What is aptitude test?

Online study and off-line which one is better?

Someone not interested in assignments.

Q1. Why you choice to join with us
Ans. Because write now Indias largest and most trusted education system is BYJU'S. thats why not one me everyone want to join his/her children in BYJU'S.
Answered Anonymously
Add your answer
Q2. What is more important to you education or money?
Ans. Obviously is education because educated person make money so easily and how to hold the mobey they know very well
Answered Anonymously
Add your answer

Q1. DS and algorithm questions
Add your answer

Q1. IOS /Skillset questions some tricky questions
Add your answer

Q1. Personality and Compensation discussion
Add your answer

2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.

Q1. Implement stack using linked list.
Ans. 
Implementing stack using linked list
• Create a Node class with data and next pointer

• Create a Stack class with top pointer

• Implement push() method to add element to top of stack

• Implement pop() method to remove element from top of stack

• Implement peek() method to return top element without removing it
Answered by AI
Add your answer
Q2. Print first duplicate value in a string.
Ans. 
Find the first duplicate value in an array of strings.
• Create a hash table to store the frequency of each string.

• Iterate through the array and check if the string already exists in the hash table.

• If it does, return the string. If not, add it to the hash table.

• If no duplicates are found, return null or an appropriate message.
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Easy

There was no sectional time limit for the coding questions.The test was online with audio and video both on for continuous monitoring.

Q1. 
N-th Term Of Geometric Progression
Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.
Explanation:
The general form of a GP se...read more
Ans. 
Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.
• Use the formula A * R^(N-1) to find the N-th term of the GP series.

• Remember to return the result modulo 10^9 + 7 as the term can be very large.

• Handle multiple test cases efficiently by iterating through each case.
Answered by AI
Add your answer
Q2. 
Matrix Element Cube Sum Problem
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...read more
Ans. 
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
• Iterate through the 2D array and check if the sum of the cubes of digits equals the element itself.

• Calculate (i * i + j * j) for elements that satisfy the condition.

• Return the calculated values as a new 2D array.

• If no element satisfies the condition, return -1.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

The interviewer was very calm and listened very carefully to the solutions. There was a lot of discussion on my projects and the interviewer seems to be very interested in knowing about the workflows of my projects.They also give me some coding questions which were related to problem solving also.

Q1. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
Calculate the number of distinct subsequences in a string with possible duplicates.
• Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

• Consider the cases where the current character is included or excluded in the subsequence.

• Handle duplicates by using a hashmap to store the last occurrence index of each character.

• Modulo the final count by 10^9 + 7 to avoid overfl
Answered by AI
Add your answer
Q2. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list given the position from the end to be removed.
• Traverse the list to find the length 'N' of the linked list.

• Calculate the position from the beginning to be removed as 'N - K + 1'.

• Delete the node at the calculated position from the beginning.
Answered by AI
Add your answer
Q3. 
Common Elements Problem Statement
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
Input:
The first line contains an integer 'T' representin...read more
Ans. 
The task is to find common strings in two arrays of lowercase alphabets for each test case.
• Iterate through the elements of the second array and check if they are present in the first array.

• Use a hash set to store the strings of the first array for efficient lookup.

• Return the common strings in the order they appear in the second array.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.

This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
• Iterate through the matrix and mark rows and columns to be modified

• Use additional arrays to keep track of rows and columns to be modified

• Update the matrix in-place based on the marked rows and columns
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Q1. Sdlc lifecycle of components and architecture.
Ans. 
SDLC lifecycle involves planning, designing, developing, testing, deploying, and maintaining software components and architecture.
• SDLC (Software Development Life Cycle) includes phases like planning, designing, coding, testing, and maintenance.

• Components are designed, developed, tested, and integrated into the overall architecture.

• Architecture involves defining the structure, behavior, and interactions of software comp...read more
Answered by AI
Add your answer

Q1. Role and responsibility my tasks and questions on project
Add your answer

Q1. Basics of js and react
Add your answer
Q2. What are closures and give an example
Ans. 
Closures are functions that have access to variables from their outer scope even after the outer function has finished executing.
• Closures are created when a function is defined within another function and has access to the outer function's variables.

• They can access variables from the outer function even after the outer function has returned.

• Closures are commonly used in event handlers and callbacks in JavaScript.
Answered by AI
Add your answer
Q3. What is event loop and features of es5
Ans. 
Event loop is a mechanism that allows JavaScript to perform non-blocking operations by handling asynchronous events.
• Event loop is responsible for executing code, collecting and processing events, and executing queued sub-tasks.

• ES5 features include strict mode, JSON object, Array methods like forEach, map, filter, and reduce, and Object.create method.

• ES5 also introduced new methods for manipulating strings, such as trim
Answered by AI
Add your answer

Q1. General management round and past experience
Add your answer