Full Creative Software Developer Intern Interview Questions and Answers for Freshers

Round duration - 70 Minutes
Round difficulty - Medium

Timing was 9:15AM. Platform was not very good. Questions were not well explained.

Q1. Merge overlapping intervals
Given 'N' number of intervals, where each interval contains two integers denoting the boundaries of the interval. The task is to merge all the overlapping intervals and ...read more
Ans. Brute Force
1. We are given the function MERGEINTERVALS(), which takes a 2D vector representing the vector of intervals and returns another 2D vector which is the vector of merged intervals.
2. We create another function ISOVERLAP() to check if the current interval overlaps with the other interval.
3. Now we create an empty 2D vector “RES” to store finally merged intervals and another boolean vector “VIS” to mark if the current in...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Rat in a Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered by CodingNinjas
Add your answer
Q3. Permutations of a String
You are given a string 'STR' consisting of lowercase English letters. Your task is to return all permutations of the given string in lexicographically increasing order.
S...read more
Ans. Backtracking
The idea is to fix a character at a position and then find the permutations for rest of the characters.
Make a list ‘ans’ which will contain the permutations of the given string.
 
Algorithm:
Let’s define a function generatePermutaionsHelper(Str, l, r). This function generates the permutations of the substring which starts from index  ‘l’ and ends at index  ‘r’.
• Call the function: generatePermutai...read more
Answered by CodingNinjas
View 1 more amswer

It was online assessment

Q1. Questions were mainly from oops c++ and database management
Add your answer
Q2. What is four pillars of oops. What is array and vector. Implement queue using stack. Project based questions.
Ans. 
The four pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction. Arrays are fixed-size data structures, while vectors are dynamic arrays. A queue can be implemented using two stacks.
• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Inheritance: Creating new classes based on existing classes, inheriting their attributes and methods.

• Polymorphism: Objects of differe...read more
Answered by AI
Add your answer
Q3. Four pillars of opps
Ans. 
The four pillars of object-oriented programming are encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Inheritance: Allowing a new class to inherit properties and behavior from an existing class.

• Polymorphism: The ability for objects of different classes to respond to the same message.

• Abstraction: Hiding the complex implementatio...read more
Answered by AI
View 1 more amswer
Q4. What is dbms explain
Ans. 
DBMS stands for Database Management System. It is a software system that allows users to define, create, maintain and control access to databases.
• DBMS is a software system that manages databases.

• It allows users to define, create, maintain, and control access to databases.

• DBMS provides tools for data manipulation, retrieval, and security.

• Examples of DBMS include MySQL, Oracle, SQL Server, and PostgreSQL.
Answered by AI
View 1 more amswer
Q5. What isSQL.and some queries
Add your answer

There was coding test

Q1. 2 technical rounds
Add your answer
Q2. Merge sort algorithm
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
• Divide the input array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Leetcode Easy question
Add your answer