J.P. Morgan Interview Questions — 79 DSA Problems

76 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked J.P. Morgan LeetCode questions for software engineering interviews.

• Sort Integers by The Number of 1 Bits (EASY) — Array, Bit Manipulation, Sorting, Counting
• Reaching Points (HARD) — Math
• Least Number of Unique Integers after K Removals (MEDIUM) — Array, Hash Table, Greedy, Sorting, Counting
• Minimum Suffix Flips (MEDIUM) — String, Greedy
• Remove Colored Pieces if Both Neighbors are the Same Color (MEDIUM) — Math, String, Greedy, Game Theory
• Break a Palindrome (MEDIUM) — String, Greedy
• Minimum Absolute Difference (EASY) — Array, Sorting
• Next Permutation (MEDIUM) — Array, Two Pointers
• Check Whether Two Strings are Almost Equivalent (EASY) — Hash Table, String, Counting
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Determine Color of a Chessboard Square (EASY) — Math, String
• Minimum Swaps to Make Strings Equal (MEDIUM) — Math, String, Greedy
• Numbers With Repeated Digits (HARD) — Math, Dynamic Programming
• Merge Intervals (MEDIUM) — Array, Sorting
• Suspicious Bank Accounts (MEDIUM) — Database
• Button with Longest Push Time (EASY) — Array
• Display Table of Food Orders in a Restaurant (MEDIUM) — Array, Hash Table, String, Sorting, Ordered Set
• Check if Number Has Equal Digit Count and Digit Value (EASY) — Hash Table, String, Counting
• Maximum Number of Points From Grid Queries (HARD) — Array, Two Pointers, Breadth-First Search, Union Find, Sorting, Heap (Priority Queue), Matrix
• Valid Parentheses (EASY) — String, Stack
• Lexicographically Smallest String After Applying Operations (MEDIUM) — String, Depth-First Search, Breadth-First Search, Enumeration
• Rotate Image (MEDIUM) — Array, Math, Matrix
• Lexicographically Smallest String After a Swap (EASY) — String, Greedy
• Reverse Odd Levels of Binary Tree (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Find Resultant Array After Removing Anagrams (EASY) — Array, Hash Table, String, Sorting
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Count Numbers with Unique Digits (MEDIUM) — Math, Dynamic Programming, Backtracking
• Happy Number (EASY) — Hash Table, Math, Two Pointers
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
• Maximum Product of Two Elements in an Array (EASY) — Array, Sorting, Heap (Priority Queue)
• Minimum Operations to Make All Array Elements Equal (MEDIUM) — Array, Binary Search, Sorting, Prefix Sum
• Subarray Sum Equals K (MEDIUM) — Array, Hash Table, Prefix Sum
• Maximum Units on a Truck (EASY) — Array, Greedy, Sorting
• Two Sum (EASY) — Array, Hash Table
• Fizz Buzz (EASY) — Math, String, Simulation
• Intersection of Two Arrays (EASY) — Array, Hash Table, Two Pointers, Binary Search, Sorting
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
• Rearrange Array to Maximize Prefix Score (MEDIUM) — Array, Greedy, Sorting, Prefix Sum
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Non-overlapping Intervals (MEDIUM) — Array, Dynamic Programming, Greedy, Sorting
• Fibonacci Number (EASY) — Math, Dynamic Programming, Recursion, Memoization
• Minimum Cost to Connect Sticks (MEDIUM) — Array, Greedy, Heap (Priority Queue)
• Pascal's Triangle (EASY) — Array, Dynamic Programming
• Minimum Cost to Make Array Equal (HARD) — Array, Binary Search, Greedy, Sorting, Prefix Sum
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack