Unschool Learning Sales Intern Interview Questions and Answers

It is good nice and not so tough

Q1. Tell me about yourself inro ?
Ans. 
I am a data-driven individual with a strong analytical mindset and a passion for problem-solving.
• Graduate student majoring in Data Science at XYZ University

• Proficient in programming languages such as Python, R, and SQL

• Experience with data visualization tools like Tableau and Power BI

• Completed projects involving data cleaning, analysis, and interpretation

• Strong communication skills and ability to work in a team environm
Answered by AI
Add your answer

Medium level coding question

Q1. Intreview round asked about project mentioned in CV
Add your answer
Q2. Basic of reacts, opps question,sql queries
Add your answer

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

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

Round duration - 120 minutes
Round difficulty - Easy

Q1. Two Sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use th...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Operating Systems
What is a semaphore?
What is deadlock?
Add your answer