Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Lido Learning interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Lido Learning
upvote
share-icon
1 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2.5 months
Topics: OOPS, Data Structures, Core Java, Algorithms, Pointers
Tip
Tip

Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.

Application process
Where: Campus
Eligibility: 8 CGPA
Resume Tip
Resume tip

Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.

Interview rounds

01
Round
Medium
Online Coding Test
Duration70 minutes
Interview date20 Feb 2021
Coding problem2

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

1. Merge overlapping intervals

Easy
10m average time
90% success
0/40
Asked in companies
GrowwMongoDBJP Morgan

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 return the list of merged intervals sorted in ascending order.

Two intervals will be considered to be overlapping if the starting integer of one interval is less than or equal to the finishing integer of another interval, and greater than or equal to the starting integer of that interval.

Example:
for the given 5 intervals - [1,4], [3,5], [6,8], [10,12], [8,9].
Since intervals [1,4] and [3,5] overlap with each other, we will merge them into a single interval as [1,5].

Similarly [6,8] and [8,9] overlaps, we merge them into [6,9].

Interval [10,12] does not overlap with any interval.

Final List after merging overlapping intervals: [1,5], [6,9], [10,12]
Try solving now

2. Rat in a Maze

Easy
15m average time
85% success
0/40
Asked in companies
AdobeOYOCIS - Cyber Infrastructure

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 square matrix of order 'N' * 'N' where the cells with value 0 represent the maze’s blocked locations while value 1 is the open/available path that the rat can take to reach its destination. The rat's destination is at ('N' - 1, 'N' - 1). Your task is to find all the possible paths that the rat can take to reach from source to destination in the maze. The possible directions that it can take to move in the maze are 'U'(up) i.e. (x, y - 1) , 'D'(down) i.e. (x, y + 1) , 'L' (left) i.e. (x - 1, y), 'R' (right) i.e. (x + 1, y).

Note:
Here, sorted paths mean that the expected output should be in alphabetical order.
For Example:
Given a square matrix of size 4*4 (i.e. here 'N' = 4):
1 0 0 0
1 1 0 0
1 1 0 0
0 1 1 1 
Expected Output:
DDRDRR DRDDRR 
i.e. Path-1: DDRDRR and Path-2: DRDDRR

The rat can reach the destination at (3, 3) from (0, 0) by two paths, i.e. DRDDRR and DDRDRR when printed in sorted order, we get DDRDRR DRDDRR.
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What does HTML stand for?

Choose another skill to practice
Start a Discussion
Similar interview experiences
SDE - 1
1 rounds | 3 problems
Interviewed by Lido Learning
791 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 2 problems
Interviewed by Lido Learning
865 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Lido Learning
670 views
0 comments
0 upvotes
Test engineer
2 rounds | 2 problems
Interviewed by Lido Learning
563 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13532 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12670 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9011 views
2 comments
0 upvotes