i
Addverb Technologies
Filter interviews by
Clear (1)
I was interviewed before Feb 2024.
Yes, I am open to relocating anywhere in India for the right opportunity.
I am open to exploring new locations and experiencing different cultures
I believe in adapting to new environments and challenges
I am willing to relocate for career growth and development
I handle stressful situations by staying calm, prioritizing tasks, and seeking support when needed.
I prioritize tasks to focus on what needs to be done first
I take deep breaths and stay calm to think clearly
I seek support from colleagues or supervisors if necessary
I practice mindfulness techniques to manage stress
Managing client relationships involves effective communication, understanding their needs, providing timely solutions, and building trust.
Maintain open and clear communication with clients to understand their needs and expectations
Provide timely and efficient solutions to any issues or concerns raised by clients
Build trust by delivering on promises and consistently meeting or exceeding expectations
Regularly follow up w...
Top trending discussions
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
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
posted on 6 Feb 2023
I applied via Naukri.com and was interviewed in Jan 2023. There was 1 interview round.
O(n) refers to linear time and space complexity.
O(n) means that the time or space required by an algorithm grows linearly with the size of the input.
It implies that the algorithm's performance is directly proportional to the input size.
For example, if an algorithm takes 10 seconds to process 100 elements, it would take 20 seconds to process 200 elements.
O(n) complexity is considered efficient and desirable in most case
posted on 16 Apr 2024
I applied via Naukri.com and was interviewed before Apr 2023. There were 2 interview rounds.
Given programming questions
String programs
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
Accessing id parameter in URL involves parsing the URL and extracting the id value.
Use the window.location object to access the URL of the current page.
Parse the URL using methods like split() or URLSearchParams to extract the id parameter.
Example: If the URL is 'http://example.com/page?id=123', you can access the id value by parsing the URL.
It was the ask mostly about DSA
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
Some of the top questions asked at the Addverb Technologies Junior Engineer - Maintenance interview -
based on 1 interview
Interview experience
Junior Engineer
171
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
103
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
61
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