i
CommerceIQ
Filter interviews by
I applied via Job Portal and was interviewed before Sep 2023. There were 3 interview rounds.
Print odd even nodes in tree
Traverse the tree using depth-first search (DFS)
Maintain a variable to track the level of each node
Print nodes based on whether their level is odd or even
Finding the Kth largest element in a heap.
Use a max heap to store the elements in the array.
Remove the largest element K times to find the Kth largest element.
Time complexity is O(K log N) where N is the number of elements in the heap.
Make sure to have DSA on your fingertips.
Top trending discussions
posted on 30 Apr 2023
I applied via Referral and was interviewed before Apr 2022. There were 4 interview rounds.
posted on 9 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 3 interview rounds.
Aptitude Had around 50 Questions which cover Logical,Quantitative, Code snippets
Find two numbers in an array that add up to a specific target value.
Use a hashmap to store the difference between the target value and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target value.
final, finally, and finalize are related terms in programming but have different meanings and usage
final is a keyword in Java used to restrict inheritance, method overriding, and variable reassignment
finally is a block of code in exception handling that always executes, regardless of whether an exception is thrown
finalize is a method in Java used for cleanup operations before an object is garbage collected
Array List can be implemented in a stack by using an array and keeping track of the top element.
Create an array to store the elements of the stack.
Keep track of the top element using a variable.
For push operation, add the element to the top of the stack and increment the top index.
For pop operation, remove the top element and decrement the top index.
Find 3rd largest number in array without sorting
Iterate through array to find largest, 2nd largest, and 3rd largest numbers
Keep track of these numbers as you iterate
Return the 3rd largest number found
To find the minimum number of swaps needed to sort an array
Use graph theory to find cycles in the array
Count the number of swaps needed to fix each cycle
Add up the swaps needed for all cycles to get the total minimum swaps
posted on 19 Dec 2024
I was interviewed in Nov 2024.
I have worked on various projects ranging from web development to mobile app development, gaining experience in different technologies and frameworks.
Developed a web application using React.js and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the travel sector
Collaborated with a team to implement a machine learning algorithm for data analysis in a research project
Led a team of developers on a project to develop a new software application.
Managed a team of 5 developers to ensure project deadlines were met
Assigned tasks to team members based on their strengths and expertise
Held regular team meetings to discuss progress and address any issues
Provided guidance and support to team members when needed
Collaborated with other departments to gather requirements and feedback
Code test to create a small search engine
Create a function that takes a search query and an array of strings as input
Iterate through the array of strings to find matches with the search query
Return an array of strings that contain the search query
I applied via Campus Placement
Machine coding round
posted on 25 Jan 2025
I was interviewed before Jan 2024.
posted on 21 Aug 2024
I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.
A circular queue can be identified by checking if the rear pointer is one position behind the front pointer.
Check if rear pointer is one position behind front pointer
Check if front pointer is at index 0 and rear pointer is at index n-1 in an array of size n
Check if front pointer is at index rear+1 modulo n in an array of size n
Design a notification system for a software application.
Identify the types of notifications needed (e.g. email, SMS, in-app)
Consider the frequency and urgency of notifications
Implement a notification queue to handle multiple notifications
Include user preferences for notification settings
Utilize push notifications for real-time updates
Write multiple polyfills for array
Interview experience
based on 3 reviews
Rating in categories
Data Analyst
27
salaries
| ₹2 L/yr - ₹10 L/yr |
Product Operations Analyst
14
salaries
| ₹5 L/yr - ₹7.5 L/yr |
Software Engineer
13
salaries
| ₹10 L/yr - ₹38 L/yr |
Software Development Engineer
13
salaries
| ₹16 L/yr - ₹26 L/yr |
Customer Success Manager
12
salaries
| ₹17.1 L/yr - ₹28.2 L/yr |
Capillary Technologies
Unbxd
CleverTap
Freshworks