Juspay Technologies
10+ InsureInfinite Consulting Interview Questions and Answers
Q1. design a system for messaging multiple teams at a time.
Design a system for messaging multiple teams at a time.
Implement a messaging platform with channels for each team
Allow users to subscribe to multiple teams' channels
Provide options for real-time messaging and notifications
Include features like file sharing, message search, and user mentions
Q2. Minimum number of races to find the fastest of 25 horses
The minimum number of races needed to find the fastest of 25 horses is 5.
Divide the 25 horses into 5 groups of 5 horses each.
Conduct 5 races with each group to determine the fastest horse in each group.
Then conduct a final race with the winners from each group to find the fastest horse overall.
Q3. Explain pain points of an app you use, come with ideas and do prioritization
Pain points of a weather app
Inaccurate weather forecasts
Slow loading time
Confusing user interface
Lack of customization options
Limited location options
Prioritization: Fixing inaccurate forecasts and improving loading time should be top priority
Q4. Hackathon of two parts
Hackathon is a competitive event where teams work on projects within a limited time frame.
Teams collaborate to solve a specific problem or create a new product
Participants showcase their technical skills and creativity
Judges evaluate projects based on innovation, functionality, and presentation
Q5. Writing test cases for customer paying more payments to same order.
Write test cases for customer paying more payments to same order
Verify that the system allows the customer to make multiple payments towards the same order
Check that the total amount paid by the customer is correctly updated for the order
Ensure that the payment history for the order reflects all payments made by the customer
Q6. Learning based activity where we have to slove a problem statement
The learning based activity involves solving a problem statement.
Understand the problem statement thoroughly before attempting to solve it.
Break down the problem into smaller components to tackle it effectively.
Use logical reasoning and critical thinking skills to come up with a solution.
Collaborate with team members or seek help from resources if needed.
Test the solution and iterate if necessary to improve the outcome.
Q7. Find the time complexity of binary search of given numbers
Binary search has a time complexity of O(log n) where n is the number of elements in the array.
Time complexity is O(log n) as it divides the array in half at each step
Best case is O(1) when the element is found at the middle of the array
Worst case is O(log n) when the element is not present in the array
Q8. Hobbie and games you play
I enjoy playing video games in my free time, particularly RPGs and strategy games.
I like playing RPGs such as The Witcher 3 and Skyrim
I also enjoy strategy games like Civilization VI and XCOM
In addition, I dabble in indie games and puzzle games for a change of pace
Q9. Customer api creation in postman
Creating customer API in Postman for testing purposes
Use Postman to create a new request with the necessary endpoint and parameters
Set up authentication if required for the API
Add headers, body, and any other necessary information for the request
Test the API request to ensure it is functioning correctly
Save the request in a collection for future testing
Q10. Improve your solution from the previous round.
I would improve my solution by incorporating user feedback and conducting further testing.
Gather feedback from users to identify pain points and areas for improvement
Conduct usability testing to identify any usability issues
Iterate on the solution based on user feedback and testing results
Implement additional features or enhancements based on user needs
Ensure the solution is scalable and can handle increased usage
Continuously monitor and gather feedback to make ongoing improv...read more
Q11. A lockable tree problem
Design a data structure for locking/unlocking nodes in a binary tree efficiently.
Implement a lockable tree data structure with lock(), unlock(), and isLocked() methods.
Ensure a node can only be locked if all ancestors are unlocked and all descendants are locked.
Optimize the operations for efficiency.
Consider using a flag in each node to track its locked status.
Use a recursive approach to check locking conditions.
Maintain a count of locked descendants for each node to determin...read more
Q12. Tree of space - DSA
Tree of space is a data structure used in computer science for storing and organizing data efficiently.
Tree of space is a type of data structure used in computer science to organize and store data in a hierarchical manner.
It consists of nodes connected by edges, with each node having zero or more child nodes.
Common examples of trees of space include binary trees, AVL trees, and B-trees.
Top HR Questions asked in InsureInfinite Consulting
Interview Process at InsureInfinite Consulting
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month