i
Skylark Drones
Filter interviews by
I applied via campus placement at National Institute of Technology (NIT), Hamirpur and was interviewed in Mar 2023. There were 2 interview rounds.
Decision Trees are a popular machine learning algorithm used for classification and regression tasks.
Decision Trees are a tree-like structure where each internal node represents a feature or attribute, each branch represents a decision rule, and each leaf node represents the outcome.
They are easy to interpret and visualize, making them popular for understanding how a model makes predictions.
Decision Trees can handle bo...
Top trending discussions
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Was given two hours to implement an Api
Number of islands in DSA refers to the problem of finding the number of connected groups of 1s in a 2D grid.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the grid and mark visited islands.
Count the number of times DFS/BFS is called to find the total number of islands.
Consider diagonal connections if specified in the problem.
Example: Given grid [['1','1','0','0'],['0','1','0','1'],['1','0','0','
I applied via Indeed and was interviewed before Aug 2023. There were 3 interview rounds.
Core HTML, CSS and JS
JS deep dive and react
I applied via LinkedIn and was interviewed in Oct 2023. There were 2 interview rounds.
2 DSA problems were asked
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
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...
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]
based on 1 interview
Interview experience
Software Engineer
4
salaries
| ₹9 L/yr - ₹13 L/yr |
HR Executive
4
salaries
| ₹8 L/yr - ₹10 L/yr |
Head Operations
4
salaries
| ₹15 L/yr - ₹27 L/yr |
GIS Specialist
4
salaries
| ₹7 L/yr - ₹7.5 L/yr |
GIS Analyst
4
salaries
| ₹3.8 L/yr - ₹7 L/yr |
Ideaforge Technology
Edall Systems
Aarav Unmanned Systems
Quidich Innovation Labs