SkilloVilla Backend Developer Interview Questions and Answers

Duration: 1hr
Platform: CoderByte
3 Medium level questions

Q1. Given a 2D Array with 0s and 1s. Find the greatest row. (Best time complexity: O(n logn))
Ans. 
Find the row with the most 1s in a 2D array efficiently.
• Iterate through each row and count the number of 1s in each row.

• Keep track of the row with the highest count of 1s.

• Return the index of the row with the most 1s.
Answered by AI
Add your answer
Q2. Given a string of alpha characters. Find the longest substring containing only unique characters. (Best time complexity: O(n))
Ans. 
Use sliding window approach to find longest substring with unique characters.
• Initialize start and end pointers to track current substring

• Use a hashmap to store the index of each character in the substring

• Update start pointer when a duplicate character is found

• Keep track of the longest substring length and indices

• Repeat until end pointer reaches the end of the string
Answered by AI
Add your answer

3 coding questions 2 easy and one tough.

Q1. 2 questions were first logic were discussed and solutions were coded then
Add your answer