i
Addverb Technologies
Filter interviews by
Clear (1)
I applied via Referral and was interviewed before May 2023. There was 1 interview round.
Top trending discussions
Factory pattern for creating objects based on input
Identify the need for creating objects based on input
Create a factory class with methods for creating objects
Use the factory class to create objects based on input
Commonly used Linux commands include ls, cd, mkdir, rm, cp, mv, grep, and chmod.
ls - list directory contents
cd - change directory
mkdir - make directories
rm - remove files or directories
cp - copy files or directories
mv - move or rename files or directories
grep - search for a pattern in a file
chmod - change file permissions
I was interviewed in Sep 2017.
A sorting algorithm is a method of arranging elements in a specific order.
Sorting algorithms can be categorized as comparison-based or non-comparison-based.
Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quicksort, and heapsort.
Efficiency of sorting algorithms is measured by their time complexity, space complexity, and stability.
Example: Sorting an array of strings in alphabet
I applied via Referral and was interviewed before Jun 2021. There were 2 interview rounds.
posted on 1 Aug 2024
posted on 16 Nov 2024
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
2-3 basic dsa questions
I applied via Referral and was interviewed in Mar 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Dec 2020. There were 5 interview rounds.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
The code to determine the minimum number of dice throws required to reach 100 in Snakes and Ladders game.
Use Breadth First Search (BFS) algorithm to find the shortest path from 1 to 100 on the Snakes and Ladders board.
Create a queue to store the current position and number of dice throws taken to reach that position.
Keep track of visited positions to avoid revisiting them.
Continue BFS until reaching position 100 and re
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Junior Engineer
172
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
101
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Automation Engineer
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Grey Orange
The Hi-tech Robotic Systemz
Systemantics
Honeywell Automation