i
Hoonartek
Filter interviews by
Top trending discussions
posted on 28 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 4 interview rounds.
A timestamp converter that converts timestamp to date and time.
Use a programming language that supports date and time functions.
Convert the timestamp to a date and time format using the appropriate function.
Handle time zone differences if necessary.
Consider the output format required.
Design a parking lot
Determine the size and capacity of the parking lot
Decide on the layout and number of parking spaces
Implement a system for managing parking spots and payments
Consider adding features such as security cameras and lighting
Ensure accessibility for disabled individuals
posted on 29 Jan 2021
I applied via Naukri.com and was interviewed in Jul 2020. There were 5 interview rounds.
JUnit test cases for different scenarios
Identify different scenarios to be tested
Write test cases for each scenario
Ensure test cases cover all possible outcomes
Use assertions to verify expected results
Mock dependencies if necessary
posted on 9 Nov 2019
I applied via Company Website and was interviewed in Oct 2019. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
SQL questions and query output.
posted on 21 Feb 2022
I applied via Campus Placement and was interviewed before Feb 2021. There were 2 interview rounds.
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
based on 1 interview
Interview experience
Associate Consultant
276
salaries
| ₹2.4 L/yr - ₹9.6 L/yr |
Consultant
237
salaries
| ₹5.2 L/yr - ₹21 L/yr |
Lead Consultant
118
salaries
| ₹12 L/yr - ₹42 L/yr |
Abinitio Developer
40
salaries
| ₹3.7 L/yr - ₹13 L/yr |
Senior Consultant
23
salaries
| ₹9 L/yr - ₹33.7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions