Dream11 Software Development Engineer 3 Interview Questions and Answers

Five coding questions along with technical questions focusing on Object-Oriented Programming (OOP) and the expected output of Java programs.

Q1. Can you tell me about yourself?
Ans. 
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
• Graduated with a degree in Computer Science

• Proficient in programming languages such as Java, Python, and C++

• Completed internships at tech companies like Google and Microsoft

• Enthusiastic about learning new technologies and collaborating with team members
Answered by AI
Add your answer
Q2. Find height of binary tree, Find first repeating character, Find number of Islands
Ans. 
The candidate is asked to solve three common coding problems related to binary trees, strings, and matrices.
• To find the height of a binary tree, you can use a recursive function to traverse the tree and calculate the height at each node.

• To find the first repeating character in a string, you can use a hashmap to store the frequency of each character and then iterate through the string to find the first character with a ...read more
Answered by AI
Add your answer

Q1. Based on project
Add your answer

Q1. Didn't Qualify for it
Add your answer

Test contains 26 questions for me 13 are java based 13 are c++ based

Q1. Indexing in dbms
Ans. 
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
• Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

• Types of indexes include clustered, non-clustered, unique, and composite indexes.

• Examples of indexing techniques include B-tree, hash, and bitmap indexes.

• Indexing can...read more
Answered by AI
Add your answer
Q2. Find whether two strings are or not anagrams
Ans. 
Check if two strings are anagrams by comparing the sorted characters in each string.
• Sort the characters in both strings and compare if they are equal.

• Ignore spaces and punctuation when comparing the strings.

• Example: 'listen' and 'silent' are anagrams.

• Example: 'hello' and 'world' are not anagrams.
Answered by AI
View 1 more answer

Q1. Inorder traversal without recursion
Ans. 
Use a stack to simulate the recursive inorder traversal process
• Create an empty stack to store nodes

• Start with the root node and push it onto the stack

• While the stack is not empty, keep traversing left and pushing nodes onto the stack

• Once you reach a leaf node, pop it from the stack, print its value, and move to its right child

• Repeat the process until all nodes have been visited
Answered by AI
Add your answer
Q2. How to make a class final
Ans. 
To make a class final, use the 'final' keyword in the class declaration.
• Use the 'final' keyword before the 'class' keyword in the class declaration

• A final class cannot be subclassed or extended

• Final classes are often used for utility classes or classes that should not be modified
Answered by AI
Add your answer