Round 1
Questions:
Question 1:
Given numberOfDesks (int) and occupiedArray (int[]) both 1 indexed where occupied desks represent array of desks' number which have been already occupied and the classroom being nx2 (n rows and 2 columns). Print all possible combinations for students being seated together.
- Seated together means they can be right-left or top-down. Diagonally is not together.
- 3,1 and 1,3 are same i.e. arrangement of students within themselves doesn’t matter.
- Desks are numbered from 1 to numberOfDesks.
Question 2:
Given a 10 character string representing a phone number. Print number of occurrence of a particular digit. Eg: "8534598734" Ans: "8,2", "5,2", "3,2", "4,2", "9,1", "7,1"
Question 3:
Leetcode Problem - Largest Number
Question 4:
Leetcode Problem - Largest Number A variation of this where we had to self join add the column of Manager name and Position.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.