BNY Mellon
17 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Maximum Area of a Piece of Cake After Horizontal and Vertical CutsMedium0.4%100.0%
- Count Visited Nodes in a Directed GraphHard0.3%100.0%
- Sum of DistancesMedium0.5%100.0%
- Minimize Length of Array Using OperationsMedium0.4%100.0%
- Minimize Malware SpreadHard0.4%77.8%
- Car FleetMedium0.6%70.8%
- Bitwise ORs of SubarraysMedium0.6%70.8%
- Kth Largest Element in an ArrayMedium0.7%70.8%
- Group AnagramsMedium0.7%61.0%
- Find the Count of Monotonic Pairs IIHard0.2%61.0%
- 3SumMedium0.4%61.0%
- Count Number of Maximum Bitwise-OR SubsetsMedium0.9%61.0%
- Merge Sorted ArrayEasy0.6%61.0%
- Best Time to Buy and Sell StockEasy0.6%61.0%
- Palindromic SubstringsMedium0.7%61.0%
- Longest Substring Without Repeating CharactersMedium0.4%61.0%
- Count Good SubarraysHard0.3%61.0%
Showing 17 of 17 questions.