BNY Mellon Interview Questions — 21 DSA Problems

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

Most frequently asked BNY Mellon LeetCode questions for software engineering interviews.

• Count Visited Nodes in a Directed Graph (HARD) — Dynamic Programming, Graph, Memoization
• Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (MEDIUM) — Array, Greedy, Sorting
• Sum of Distances (MEDIUM) — Array, Hash Table, Prefix Sum
• Minimize Length of Array Using Operations (MEDIUM) — Array, Math, Greedy, Number Theory
• Minimum Number of Taps to Open to Water a Garden (HARD) — Array, Dynamic Programming, Greedy
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Palindromic Substrings (MEDIUM) — Two Pointers, String, Dynamic Programming
• Minimum Number of Groups to Create a Valid Assignment (MEDIUM) — Array, Hash Table, Greedy
• Gas Station (MEDIUM) — Array, Greedy
• Car Fleet (MEDIUM) — Array, Stack, Sorting, Monotonic Stack
• Total Cost to Hire K Workers (MEDIUM) — Array, Two Pointers, Heap (Priority Queue), Simulation
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Find the Count of Monotonic Pairs II (HARD) — Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
• Count Vowel Substrings of a String (EASY) — Hash Table, String
• Two Sum (EASY) — Array, Hash Table
• Move Zeroes (EASY) — Array, Two Pointers
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Reverse Words in a String III (EASY) — Two Pointers, String
• Roman to Integer (EASY) — Hash Table, Math, String
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming