Collegedunia Software Developer Interview Questions and Answers

Aptitude test was first round. it was hard level

Program on string, oops , exception handling

3 coding question around prime number arrays and strings

Q1. Introduce youself
Add your answer
Q2. Question around project and skill in the resume and one coding question to solve
Add your answer

Q1. Question on project and skill in resume
Add your answer
Q2. 2 question arouond data structer and algorithm
Add your answer

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

Explain about DSA and its example in realtime.

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

Q1. 
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...read more
Ans. 
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
• Use dynamic programming to solve the problem efficiently.

• The number of structurally unique BSTs can be calculated using Catalan numbers.

• For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

• Example: For N=3, the number of structurally unique BSTs is 5.
Answered by AI
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible subsequences by including or excluding each character in the string.

• Maintain a current index to keep track of the characters being considered.

• Append the current character to each subsequence generated so far.

• Recursively call the function with the next index to include or exclude the next character.

• Base case: When the current ind...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Hard test dsa question practice more leetcode

Q1. Dsa question Array Powershell scripting Cpp Python
Add your answer

Q1. About Lighnting Web componet
Add your answer