Skylark Drones Ai Ml Engineer Interview Questions and Answers

2 DSA problems were asked

Q1. Questions about software development
Add your answer

Round duration - 55 Minutes
Round difficulty - Easy

Timing - evening
Interviewer was friendly.

Q1. Find Number Of Islands
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be conn...read more
Ans. 
I directly came up with the DFS approach.
Answered by CodingNinjas
View 1 more answer

Round duration - 55 Minutes
Round difficulty - Easy

Timing - afternoon
Interviewer was friendly

Q1. Move Zeroes To End
Given an unsorted array of integers, you have to move the array elements in a way such that all the zeroes are transferred to the end, and all the non-zero elements are moved to the fron...read more
Ans. 
Thought about 2 pointer technique and solved with that.
Answered by CodingNinjas
View 2 more answers
Q2. Asteroid Collision
You are given an array/list “ASTEROIDS” representing asteroids in a row. For each element of the given array, its absolute value denotes the size of that asteroid and its sign denotes th...read more
Ans. Stack Based Approach
The idea is to use the stack to maintain the state of the asteroids. If we find an asteroid moving to the left (-ve value), let’s say at index i, then it will collide with an asteroid moving to the right (+ve value) and having index less than i. Hence, we can use a stack to keep track of asteroids moving to the right and then pop the elements from the stack as and when any asteroid gets destroyed.
&n...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 55 Minutes
Round difficulty - Easy

Timing - evening
interviewer was friendly

Q1. System Design Question
Building a quizzing system for multiple classes and teachers. 
Game:
A set of MCQ Questions that a Player can answer. 
A Game will be assigned to a class or multiple Classes by...read more
Add your answer

Q1. How python dictionary is implemented internally ?
Ans. 
Python dictionary is implemented using hash tables.
• Python dictionary is a collection of key-value pairs.

• The keys in a dictionary must be unique and immutable.

• The values in a dictionary can be of any data type.

• Python dictionary is implemented using hash tables.

• Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

• The hash function used in Python dictionary is based on the key's h...read more
Answered by AI
Add your answer
Q2. What is heap sort
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• It divides the input into a sorted and an unsorted region.

• It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

• It has a time complexity of O(n log n) and is not stable.

• Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Answered by AI
Add your answer
Q3. Coding question to sort array based on a custom filter
Add your answer