14 questions · from 3 interviews

Jupiter Money interview questions

Every question candidates reported from their Jupiter Money interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Jupiter Money coding and DSA questions

  1. 01

    Koko Eating Bananas

    Given an array piles of integers representing the number of bananas in n piles, and an integer h representing the total hours Koko has, find the minimum integer k such that Koko can eat all the bananas within h hours. Each hour, Koko chooses a pile and eats k…

    Medium · From Jupiter Money Interview Experience (SDE2 | SDE II) Backend

  2. 02

    Daily Temperatures

    Given an array of integers temperatures representing the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible,…

    Medium · From Jupiter Money Interview Experience (SDE2 | SDE II) Backend

  3. 03

    Minimum Falling Path Sum (with variation)

    The problem was similar to LeetCode's Minimum Falling Path Sum , which involves finding the minimum sum of a falling path in a square array. However, the interviewer added specific constraints to the original problem, increasing its complexity. I was asked to…

    Medium · From Jupiter Money Interview Experience (SDE2 | SDE II) Backend

  4. 04

    Number of Islands

    Given a 2D binary grid, which represents a map of '1's (land) and '0's (water), find the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are…

    Medium · From Jupiter Money | SDE2 | Bangalore | May 2022 [Reject]

  5. 05

    First Missing Positive

    Given an unsorted integer array nums, return the smallest missing positive integer.

    Hard · From Jupiter Money | SDE2 | Bangalore | May 2022 [Reject]

  6. 06

    Word Search

    Given an m x n grid of characters and a string word , return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may…

    Medium · From Jupiter Money | SDE-1 | Bangalore | April 2022 | Offer

  7. 07

    Seat Reservation Manager

    Design a system that manages seat reservations. Implement SeatManager(int n) which initializes a SeatManager object that manages n seats numbered from 1 to n . All seats are initially available. Implement int reserve() which fetches the smallest-numbered…

    Medium · From Jupiter Money | SDE-1 | Bangalore | April 2022 | Offer

  8. 08

    Minimum Steps to Reach B from A with Specific Moves

    Find the minimum steps to reach from a number 'a' to a number 'b'. At any point, a player can go 1 step back ( currentstep - 1 ) or double the current step ( 2 currentstep ).

    From Jupiter Money | SDE-1 | Bangalore | April 2022 | Offer

  9. 09

    Bottom View of a Binary Tree

    Given a binary tree, return the bottom view of the tree. The bottom view of a binary tree is the set of all nodes that are visible when the tree is viewed from the bottom.

    From Jupiter Money | SDE-1 | Bangalore | April 2022 | Offer

Jupiter Money system design questions

  1. 01

    Design Cache

    I was asked to design a cache system. This typically involves discussing key aspects such as data structures (e.g., hash maps, doubly linked lists), cache eviction policies (e.g., LRU, LFU), thread safety, and capacity management.

    Hard · From Jupiter Money Interview Experience (SDE2 | SDE II) Backend

  2. 02

    Low-Level Design of a Chess Game

    Design the low-level components and interactions for a chess game. This would involve designing classes for pieces, the board, game logic, and move validation, among other considerations.

    Medium · From Jupiter Money | SDE2 | Bangalore | May 2022 [Reject]

  3. 03

    High-Level Design of Typeahead Search

    Design a scalable typeahead search system, similar to Google's search bar functionality. The design should consider aspects such as data storage, indexing, real-time suggestion generation, latency requirements, and system throughput.

    Hard · From Jupiter Money | SDE2 | Bangalore | May 2022 [Reject]

  4. 04

    High-Level Design of Instagram Newsfeed

    Design a high-level architecture for Instagram's newsfeed. This includes considerations for feed generation, content storage, efficient fanout mechanisms (push vs pull), timeline fetching, and how to handle a large user base and high volume of content.

    Hard · From Jupiter Money | SDE2 | Bangalore | May 2022 [Reject]

  5. 05

    Design a Food Delivery Application

    Design a food delivery application. This involved outlining requirements, discussing the system flow, defining API routes, and designing the database schema, including considerations for choosing between SQL and NoSQL databases.

    From Jupiter Money | SDE-1 | Bangalore | April 2022 | Offer

Jupiter Money interview questions FAQ

What questions are asked in Jupiter Money interviews?

Candidates reported 14 distinct questions across 3 Jupiter Money interviews. 9 coding and DSA questions, 5 system design questions.

How difficult are Jupiter Money interview questions?

Of the questions candidates rated, 0% were easy, 64% medium and 36% hard.