AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
CommerceIQ
Compare
Filter interviews by
CommerceIQ Software Development Engineer Interview Questions and Answers
CommerceIQ Software Development Engineer Interview Experiences
2 interviews found
Aman Sohani
Selected
I applied via Job Portal and was interviewed before Sep 2023. There were 3 interview rounds.
(1 Question)
- Q1. Print odd even nodes in tree
- Ans.
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
(1 Question)
- Q1. Kth largest element kf heap
- Ans.
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.
(1 Question)
- Q1. Managerial round asked about projects
Skills evaluated in this interview
Anonymous
Make sure to have DSA on your fingertips.
(1 Question)
- Q1. Question was on DSA?
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
9 Questions
- Q1. Questions related to the work done at my previous company
- Q2. Find if a given directed graph is cyclic or not
- Ans.
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
- Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
- Ans.
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
- Q4. Find if a given Binary Tree is BST or not
- Ans.
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
- Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
- Ans.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
- Q6. Given an array of integers, print all possible permutations. Also explain your approach
- Ans.
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
- Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
- Ans.
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
- Q8. Given a linked list with loop, how would you find the starting point of the loop ?
- Ans.
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
- Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
- Ans.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Questions about Oops, data structures based on the projects I had done, and my resume
- Q2. Questions about classes and abstraction
Interview Preparation Tips
Interview Preparation Tips
Experience: PAPER DURATION: 3 hours
NO. OF QUESTIONS: 2 (20 marks each)
MAXIMUM MARKS: 20*2 = 40 marksQUESTION 1:
JSON Prettier:-Write a program which takes JSON as input and gives prettified JSONYou need to read JSON from STDIN. Input gives one line of uglified JSON.Output should be formatted JSON. Check the standard output link.Use 2 white spaces (not‘\t’) for one indentation.SAMPLE INPUT:{“group” : {list : [1,2,3]}, “list” : [“a”,”b”,”c”]}SAMPLE OUTPUT:{“group” : {List : [1,2,3]},“list” : [“a”,”b”,”c”]}EXPLANATION: Input will be uglifiedjson in one line and output will be prettified format of that. QUESTION 2:XML parse plus series computationEvaluate an expression given in XML format. Keys will be Expr- contains the entire expression. Elem – contains the digit, sum, Prod- contains two or more keys whose evaluation needs to be summed or multiplied respectively. Sub will contain 2 keys or more, where the second key onwards will have to be subtracted from the first one. Div- will contain 2 keys in which first key will need to be divided by second. SAMPLE INPUT:
20EXPLANATION:Input will be xml file through standard input. End of xml file marked by .
Duration: 180 minutes
Total Questions: 2
College Name: NA
Selected
I applied via Approached by Company and was interviewed before Feb 2022. There were 4 interview rounds.
Chrome and Firefox Browser automation
Log file tail last n lines where n is configurable. Followup question on how you can optimize it further incase log file size is in TBs and incase it is cluster of servers
(4 Questions)
- Q1. Detailed Technical background check and discussion on past projects.
- Q2. Messaging queue and best practices
- Ans.
Messaging queues are used to manage asynchronous communication between different components of a system.
Use a reliable messaging queue system like RabbitMQ or Apache Kafka
Ensure messages are properly formatted and serialized
Implement message acknowledgement and retry mechanisms
Monitor queue health and performance
Consider message ordering and partitioning for scalability
Avoid long-running tasks in message handlers
- Q3. Binary Search Tree twisted question
- Q4. Map Reduce concept for solving dictionary keywords
- Ans.
MapReduce is a programming model for processing large data sets in parallel.
MapReduce divides the input data into chunks and processes them in parallel.
It consists of two phases: Map and Reduce.
Map function takes input data and converts it into key-value pairs.
Reduce function takes the output of Map as input and combines the values with the same key.
It is used for solving dictionary keywords by mapping each word to a k...
Interview Preparation Tips
Skills evaluated in this interview
Software Engineer Interview Questions & Answers
BrowserStack
18-546 surya kaushik
posted on 4 Jul 2024
Selected
I applied via Referral and was interviewed in Jan 2024. There were 3 interview rounds.
Normal 3 leetcode medium questions
Machine coding round to design tail -f
(2 Questions)
- Q1. Questions on internal working of os
- Q2. Questions on projects
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
(2 Questions)
- Q1. Kafka partitions
- Q2. Elasticsearch queries
(2 Questions)
- Q1. Why Browserstack?
- Ans.
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
- Q2. Any challenge you faced at current company?
- Ans.
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
MCQ based Questions from topics of DSA , web development
(1 Question)
- Q1. Asked us to live code tail -f unix command
- Ans.
Implementing the 'tail -f' command to continuously monitor and display new lines added to a file.
Use 'open' to access the file in read mode.
Utilize 'seek' to move to the end of the file initially.
Implement a loop to read new lines as they are added.
Use 'time.sleep()' to pause between reads to avoid busy waiting.
Handle file rotation by checking if the file has been recreated.
I applied via Campus Placement
Machine coding round
(2 Questions)
- Q1. TCP/IP related questions, what happens when you search a webpage?
- Q2. Past projects discussions
(1 Question)
- Q1. Behavioural questions on how would you tackle a particular scenario
CommerceIQ Interview FAQs
Tell us how to improve this page.
CommerceIQ Interviews By Designations
- CommerceIQ Software Development Engineer Interview Questions
- CommerceIQ Business Associate Interview Questions
- CommerceIQ Senior Sdet Engineer Interview Questions
- CommerceIQ Senior Data Scientist Interview Questions
- CommerceIQ Back Office Executive Interview Questions
- CommerceIQ Software Engineer III Interview Questions
- CommerceIQ Office Administrator Interview Questions
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Project Engineer Interview Questions
- Lead Software Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Interview Questions from Similar Companies
CommerceIQ Software Development Engineer Reviews and Ratings
based on 3 reviews
Rating in categories
|
Data Analyst
27
salaries
|  ₹2.5 L/yr - ₹8.2 L/yr |
|
Product Operations Analyst
17
salaries
| ₹5 L/yr - ₹8 L/yr |
|
Customer Success Manager
16
salaries
| ₹17.1 L/yr - ₹32 L/yr |
|
Sde1
15
salaries
| ₹11 L/yr - ₹29.3 L/yr |
|
Software Development Engineer II
15
salaries
| ₹20 L/yr - ₹35 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo
- Home >
- Interviews >
- CommerceIQ Interview Questions
