i
Hevo Data
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
How do program manager manages project manager?
Top trending discussions
I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.
A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.
posted on 19 Dec 2024
I applied via Campus Placement
It was good 20 mcqs 3 coding questions
2 Leetcode Medium questions on hackerrank
Medium to hard questions based on arrays, dp
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divides array into smaller sub-arrays based on a pivot element
Recursively sorts sub-arrays
Combines sorted sub-arrays to get final sorted array
Time complexity: O(n log n) on average, O(n^2) worst case
Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
I applied via Campus Placement
Aptitude was including both MCQs and Input
Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.
Python is dynamically typed, while C is statically typed.
Python has automatic memory management, while C requires manual memory management.
Python is platform-independent, while C is platform-dependent.
Python is commonly used for web development and data anal...
C is faster than Python due to its lower-level nature and direct hardware access.
C is a compiled language, while Python is an interpreted language.
C code is directly translated into machine code, while Python code is executed line by line.
C has direct access to hardware, while Python relies on external libraries for such access.
A program to count vowels in a given name
Create a function that takes a string as input
Loop through each character in the string and check if it is a vowel (a, e, i, o, u)
Increment a counter for each vowel found
Return the total count of vowels
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.
Choose a pivot element from the array
Partition the array into two sub-arrays based on the pivot element
Recursively apply quick sort to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Implement a linked list data structure in a programming language.
Create a Node class with data and a reference to the next node
Implement methods to add, remove, and search for elements in the linked list
Handle edge cases like adding to an empty list or removing the last element
Operations on Linked list include insertion, deletion, traversal, and searching.
Insertion: Add a new node at the beginning, end, or middle of the linked list.
Deletion: Remove a node from the linked list based on a given key or position.
Traversal: Visit each node in the linked list to perform operations or display data.
Searching: Find a specific node in the linked list based on a given key or value.
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
Some Objective questions and 1 Coding Questions
2 DSA questions Both are from DP
Interview experience
Business Analyst
10
salaries
| ₹7 L/yr - ₹13 L/yr |
Sales Development Representative
9
salaries
| ₹7.1 L/yr - ₹11 L/yr |
Account Executive 1
8
salaries
| ₹15 L/yr - ₹19 L/yr |
Key Accounts Executive
7
salaries
| ₹9 L/yr - ₹17.9 L/yr |
Program Manager
7
salaries
| ₹20.9 L/yr - ₹36.8 L/yr |
Wingify
CleverTap
Postman
Freshworks