JPMorgan Software Engineer Onsite Coding Questions

Starting from 0, add 1, then multiply by 2 three times. It takes a minimum of 4 operations to get to 8, so store 4 in index 0 of the return array. **Function Description** Complete the function `get

YOE 6 at FAANG ### R1: 1. Project details and then two coding questions. 2. The storage drive isn't being used efficiently because the data is scattered across many partitions. Each partition has some

**Application & Online Assessment** * **Source:** JPMC Careers website (SWE 2/3). * **Format:** HackerRank Online Assessment containing two Easy/Medium algorithmic questions. **Super Day (Virtual Inte

**Target Role and Experience** Candidates with a minimum of three years of experience are evaluated for SWE 2 or SWE 3 positions. The process comprises three consecutive 45-minute rounds conducted on

The selection process began with a HackerRank assessment, followed by a Super Day in the first week of November. Two days later, HR proceeded with document verification and a preliminary discussion. *

🚀 Thrilled to share some exciting news: Offer from JPMorganChase for SDE2! 🎉 Here's a quick recap of the journey: HackerRank Prerequisite ✅: Before the interviews, there was a HackerRank test to quali

In an hour long zoom interview call, I just had to answer/ explain my approaches to the interviewer. No live coding. Interview consisted of: 1. Resume discussion 2. LC-217 3. Implementation on HashSet...

How many ways can you fill a 2xN rectangle using 1x2 and 2x1 modules?

Stacey is coordinating a beach clean-up event with her university's Women in STEM Charity branch. The beach is covered with tin cans of varying weights arranged in a single line, indexed from 0 to n-1

Count the number of substrings in a binary string that contain an equal number of 0s and 1s, where all 0s and 1s are grouped together. Duplicate substrings are counted in the total. A binary string c

Implement an autocorrect function that returns all words which are anagrams of a search query. An anagram is any string that can be formed by rearranging the letters of another string. Given two arra

Given an array of numbers, find the 0-based index of the smallest array element (the pivot) where the sum of all elements to the left and to the right are equal. The array may not be reordered. **Fun

A quantitative trading firm aims to develop a tool to track the net profit/loss of the firm at any point in time. This tool processes a list of events, where each event falls into one of four categori

### Problem Overview - Merge overlapping time intervals [start, end] and return the combined intervals sorted by start time. - Input: int intervals[n][2] with 1 ≤ n ≤ 1e5, start ≤ end, values up to 1e

### Problem Overview - Determine which key took the longest time to press from a redesigned ambulance keypad test. - Input: keyTimes[n][2] with each row holding a key code and its timestamp; Output:

### Problem Overview - Count how many integers in an inclusive range have no repeating digits (e.g., 10–13 → 3). - Input: two integers (start, end); Output: a single count of valid numbers. - Relevant

### Problem Overview - Given n tasks with start[i] and end[i], determine the minimum number of machines needed so no two overlapping tasks run on the same machine. - Input: arrays start[n] and end[n];

### Problem Overview - Find the minimum total payment for a client to complete all web development projects using available bids; return -1 if any project has no bids. - Input: numProjects, project[]

### Problem Overview - Compute the total cost to reduce an integer array to one element by repeatedly merging the current minimum and maximum. - Input: array arr of n integers; perform n-1 operations;

### Problem Overview - Determine the minimum number of teams using only sizes teamSize_1 or teamSize_2 so all p participants are assigned; return -1 if no exact division. - Input: teamSize_1, teamSize