Classplus Software Developer Interview Questions and Answers

Q1. Data structures
Add your answer

Q1. System Design fundamentals
Add your answer

Q1. System Design questions
Add your answer

Q1. What do you think about the negative news going around the company
Add your answer

Q1. Why join this company
Add your answer

Q1. Explain about Android lifecycle
Ans. 
Android lifecycle refers to the series of states that an activity or fragment goes through from creation to destruction.
• Android lifecycle includes states like onCreate, onStart, onResume, onPause, onStop, onDestroy, etc.

• Activities and fragments transition between these states based on user interactions and system events.

• Understanding Android lifecycle is crucial for managing resources, saving state, and handling config...read more
Answered by AI
Add your answer
Q2. Explain about fragment lifecycle
Ans. 
Fragment lifecycle refers to the series of events that occur in the lifespan of a fragment in an Android app.
• Fragments go through various states like created, started, resumed, paused, stopped, and destroyed.

• Fragment lifecycle methods include onCreate(), onCreateView(), onResume(), onPause(), onStop(), onDestroy(), etc.

• Fragment lifecycle is closely tied to the hosting activity's lifecycle.

• Understanding fragment lifecyc...read more
Answered by AI
Add your answer

Scraper a website and test with test cases

2 Questions based on DS and Algo basic problem solving.

Q1. How many times a boat has to make rounds to travel a number of people from one to another.
Add your answer

Q1. Types of DS and a real life scenario.
Ans. 
Types of DS and a real life scenario
• Arrays - storing a list of names

• Linked Lists - managing a playlist

• Stacks - undo/redo functionality in text editors

• Queues - managing customer requests in a call center

• Trees - organizing files in a computer

• Graphs - social network connections
Answered by AI
Add your answer

Q1. Salary DIscussion on what is current and expected.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

2 DSA problems to be solved in 60 min time limit.

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 element X is the firs...read more
Ans. 
Given a list of integers, find the next greater element for each element in the list.
• Iterate through the list from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Store the next greater element for each element in a result array.

• If no greater element is found, store -1 in the result array.
Answered by AI
Add your answer
Q2. 
Floor Value of X Problem Statement
Given a sorted array A and an integer X, your task is to find and return the floor value of X in the array.
The floor value of X is the largest element in array A which...read more
Ans. 
Find the largest element in a sorted array smaller than or equal to a given integer X.
• Use binary search to efficiently find the floor value of X in the sorted array.

• Compare the middle element of the array with X and adjust the search accordingly.

• Return the element before or equal to X as the floor value, or -1 if no such element exists.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Face to Face round with interviewer.

Q1. 
Longest Common Subsequence Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...read more
Ans. 
The task is to find the length of the longest common subsequence between two given strings.
• Implement a function to find the longest common subsequence between two strings.

• Use dynamic programming to solve this problem efficiently.

• Iterate through the strings and build a matrix to store the lengths of common subsequences.

• The value in the bottom-right corner of the matrix will be the length of the longest common subsequenc
Answered by AI
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Update the maximum sum if a new maximum is found.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Face to Face DSA round.

Q1. 
Delete Middle Node Problem Statement
You are given a singly linked list of integers. The task is to delete the middle node of this list.
Note:
1. If the list has no middle node, return an empty list (NU...read more
Ans. 
Delete the middle node of a singly linked list in O(N) time complexity and O(1) space complexity.
• Identify the middle node using slow and fast pointers technique.

• Update the pointers to skip the middle node.

• Handle edge cases like no middle node or two middle nodes.

• Perform the deletion in a single traversal of the linked list.

• Return the modified linked list after deletion.
Answered by AI
Add your answer
Q2. 
Group Anagrams Together
Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
E...read more
Ans. 
Group anagrams together in a list of strings.
• Iterate through the list of strings and sort each string to group anagrams together.

• Use a hashmap to store the sorted string as key and the original string as value.

• Return the values of the hashmap as the grouped anagrams.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was with VP (technology). 
1. One DSA problem.
2. Had a discussion on the projects mentioned in CV.
3. Theory Ques from DBMS, OS.

Q1. 
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...read more
Ans. 
Maximize profit by scheduling jobs within their deadlines.
• Sort the jobs array in descending order of profits.

• Iterate through the sorted array and schedule jobs based on deadlines.

• Keep track of completed jobs and their profits to calculate the total profit.

• Return the maximum profit achieved by scheduling jobs within deadlines.
Answered by AI
Add your answer