Jupiter Money
20+ Nutrabay Interview Questions and Answers
Q1. Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M
where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only of 1s...read more
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Update the path length as you traverse through the matrix.
Return -1 if no valid path exists.
Q2. Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
- The left subtree of a node contains only nodes with data les...read more
Check if a binary tree is a Partial Binary Search Tree (BST) based on specific properties.
Traverse the tree in level order and check if each node satisfies the properties of a Partial BST.
Use recursion to check if the left and right subtrees are also Partial BSTs.
Compare the data of each node with its children to ensure the BST properties are maintained.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be true.
Q3. Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
E...read more
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Q4. Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the number of te...read more
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider using a set to ensure distinct elements in the array.
Q5. Longest Palindromic Substring Problem Statement
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindromic ...read more
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindromic substring with the smallest start index
Q6. Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two points P ...read more
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Q7. Odd Occurrence Element Problem Statement
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that appears ...read more
Find the element that appears an odd number of times in an array of integers.
Iterate through the array and use XOR operation to find the element that appears odd number of times.
Keep a count of occurrences of each element using a hashmap.
Return the element that has an odd count of occurrences.
Q8. Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road conne...read more
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.
Return the path once the destination house is reached.
Example: For input N=8, M=9, S=1, T=8 and roads (1, 2), (1, 3), (2, 4), (2, 5), (3, 6), (3, 8), (4, 7), (5, 8), (...read more
Q9. Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
Input:...read more
Merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged result.
Iterate through both input linked lists simultaneously, comparing and adding nodes to the result list.
Handle cases where one list is empty or both lists are empty.
Ensure the final merged list is sorted in ascending order.
Use constant space complexity and linear time complexity for the solution.
Q10. Capture Region Problem Statement
You are given a matrix having N
rows and M
columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely surrounde...read more
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.
Use DFS/BFS to mark all 'O's in the surrounded region.
Update the matrix by flipping all marked 'O's to 'X'.
Metrics selection based on campaign objectives, target audience, and key performance indicators.
Identify campaign objectives and goals
Consider target audience and their behavior
Select key performance indicators (KPIs) relevant to the campaign
Track metrics such as conversion rate, click-through rate, ROI, customer acquisition cost
Analyze data to measure success and make data-driven decisions
Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.
Coding problem: Discussed how I optimized a sorting algorithm in a previous project.
Past projects: Talked about a web application I developed using React and Node.js.
Behavioral questions: Shared how I handled a conflict within a team during a project.
Example: Explained how I implemented a feature in a mobile app that improved user engagement.
Design a URL shortener system
Generate a unique short code for each URL
Store the mapping of short code to original URL in a database
Redirect users from short URL to original URL when accessed
Consider implementing features like custom short codes, expiration dates, and analytics
Ensure scalability and performance by using distributed systems and caching
Q14. What’s strategy will you develop to increase the sales?
To increase sales, I will focus on improving customer engagement, expanding the target market, and implementing effective marketing strategies.
Improve customer engagement through personalized interactions and follow-ups
Expand the target market by identifying new potential customers and exploring different sales channels
Implement effective marketing strategies such as social media campaigns, email marketing, and promotions
Q15. Creating a high level design of a message queue system
Designing a message queue system for efficient communication between components
Define the requirements and constraints of the system
Choose a suitable messaging protocol (e.g. AMQP, MQTT)
Design the message format and structure
Implement mechanisms for message persistence and delivery guarantees
Consider scalability and fault tolerance
Use appropriate data structures and algorithms for efficient message handling
Q16. What do you know about Jupiter?
Jupiter is the largest planet in our solar system, known for its massive size and iconic red spot.
Jupiter is the fifth planet from the Sun
It is a gas giant composed mostly of hydrogen and helium
Jupiter has a prominent feature called the Great Red Spot, a giant storm that has been raging for centuries
It has at least 79 moons, including the four largest known as the Galilean moons: Io, Europa, Ganymede, and Callisto
Q17. why cx support what makes you join Jupiter
I joined Jupiter because of their strong focus on customer support and commitment to corporate social responsibility.
Jupiter's reputation for excellent customer support was a major factor in my decision to join the company.
I was impressed by Jupiter's dedication to corporate social responsibility and making a positive impact in the community.
The opportunity to work for a company that values both customer satisfaction and social responsibility was very appealing to me.
Q18. put patch and post in api testing
Patch and post are HTTP methods used in API testing to update and create resources, respectively.
PATCH method is used to update an existing resource in the API
POST method is used to create a new resource in the API
Both methods are commonly used in RESTful APIs for CRUD operations
Example: PATCH /api/users/123 to update user with ID 123
Example: POST /api/users to create a new user
Q19. Low Leven system design of Instagram.
Low level system design of Instagram involves designing the core components like database, storage, caching, and networking.
Use sharding to distribute data across multiple database servers for scalability.
Implement a caching layer using Redis or Memcached to improve performance.
Utilize a content delivery network (CDN) for faster content delivery to users.
Design a fault-tolerant storage system to ensure data durability and availability.
Implement a messaging queue like Kafka fo...read more
Q20. explain your automation framework
My automation framework is a data-driven framework using Selenium WebDriver and TestNG for test execution and reporting.
Uses Selenium WebDriver for interacting with web elements
Utilizes TestNG for test execution and reporting
Follows a data-driven approach for test data management
Q21. Find connected components in a graph
Use Depth First Search (DFS) to find connected components in a graph
Start by initializing all vertices as unvisited
Iterate through each vertex and perform DFS to find connected components
Keep track of visited vertices to avoid revisiting
Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Q22. Difference between Joins with examples
Joins are used to combine rows from two or more tables based on a related column between them.
Inner Join: Returns rows when there is a match in both tables.
Left Join: Returns all rows from the left table and the matched rows from the right table.
Right Join: Returns all rows from the right table and the matched rows from the left table.
Full Outer Join: Returns rows when there is a match in one of the tables.
Cross Join: Returns the Cartesian product of the two tables.
Q23. merge two sorted arrays
Merging two sorted arrays into a single sorted array
Create a new array to store the merged result
Iterate through both arrays simultaneously, comparing elements and adding the smaller one to the result array
Handle cases where one array is longer than the other by appending the remaining elements
Q24. Design a hotel booking management system
A hotel booking management system to handle reservations, room availability, guest information, and payment processing.
Create a database to store information on rooms, reservations, guests, and payments
Develop a user interface for guests to search for available rooms and make reservations
Implement a payment gateway for secure transactions
Include features for managing room availability, cancellations, and guest check-ins
Generate reports on occupancy rates, revenue, and guest f...read more
Q25. Types of Window Function
Window functions are used in SQL to perform calculations across a set of table rows related to the current row.
Types include ROW_NUMBER(), RANK(), DENSE_RANK(), NTILE(), LAG(), LEAD(), FIRST_VALUE(), LAST_VALUE(), etc.
They allow for calculations to be performed on a specific subset of rows within a query result set.
Window functions are commonly used for running totals, moving averages, and ranking data.
Q26. Walk through project code
I will walk through a project code to explain its structure and functionality.
Start by explaining the overall architecture of the project
Discuss the main components/modules and their interactions
Explain any key algorithms or data structures used
Highlight any design patterns or best practices implemented
Provide examples of specific code snippets to illustrate your points
Q27. Design chess game
Design a chess game with proper board setup, piece movements, and win conditions.
Create a 8x8 grid to represent the chess board
Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)
Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)
Check for valid moves and capture opponent's pieces
Implement win conditions (checkmate, stalemate)
Consider special moves like castling and en passant
Interview Process at Nutrabay
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month