Question 1

Count Visited Nodes in a Directed Graph — BNY Mellon Interview Question

Accepted Answer

"Count Visited Nodes in a Directed Graph" is a hard difficulty problem asked at BNY Mellon interviews. It covers the following topics: Dynamic Programming, Graph, Memoization. You can practice it on LeetCode: https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph

Question 2

Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts — BNY Mellon Interview Question

Accepted Answer

"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts" is a medium difficulty problem asked at BNY Mellon interviews. It covers the following topics: Array, Greedy, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts

Question 3

Sum of Distances — BNY Mellon Interview Question

Accepted Answer

"Sum of Distances" is a medium difficulty problem asked at BNY Mellon interviews. It covers the following topics: Array, Hash Table, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/sum-of-distances

Question 4

Minimize Length of Array Using Operations — BNY Mellon Interview Question

Accepted Answer

"Minimize Length of Array Using Operations" is a medium difficulty problem asked at BNY Mellon interviews. It covers the following topics: Array, Math, Greedy, Number Theory. You can practice it on LeetCode: https://leetcode.com/problems/minimize-length-of-array-using-operations

Question 5

Minimum Number of Taps to Open to Water a Garden — BNY Mellon Interview Question

Accepted Answer

"Minimum Number of Taps to Open to Water a Garden" is a hard difficulty problem asked at BNY Mellon interviews. It covers the following topics: Array, Dynamic Programming, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden

Question 6

Group Anagrams — BNY Mellon Interview Question

Accepted Answer

"Group Anagrams" is a medium difficulty problem asked at BNY Mellon interviews. It covers the following topics: Array, Hash Table, String, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/group-anagrams

#	Question Title	Difficulty	Frequency	Topics
1	Count Visited Nodes in a Directed Graph	HARD	100.0	Dynamic ProgrammingGraphMemoization
2	Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts	MEDIUM	97.7	ArrayGreedySorting
3	Sum of Distances	MEDIUM	97.7	ArrayHash TablePrefix Sum
4	Minimize Length of Array Using Operations	MEDIUM	97.7	ArrayMathGreedy+1
5	Minimum Number of Taps to Open to Water a Garden	HARD	75.5	ArrayDynamic ProgrammingGreedy
6	Group Anagrams	MEDIUM	75.5	ArrayHash TableString+1
7	Palindromic Substrings	MEDIUM	68.6	Two PointersStringDynamic Programming
8	Minimum Number of Groups to Create a Valid Assignment	MEDIUM	68.6	ArrayHash TableGreedy
9	Gas Station	MEDIUM	68.6	ArrayGreedy
10	Car Fleet	MEDIUM	58.8	ArrayStackSorting+1

Explore 450+ Companies

Companies

BNY Mellon

Want to see more?

BNY Mellon Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

BNY Mellon

Want to see more?

BNY Mellon Interview Questions

Ai Assistant Kas