[LeetCode] Max Pair Sum in an Array

2815. Max Pair Sum in an Array

You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.

Return the maximum sum or -1 if no such pair exists.

Read more
[Codeforces] Educational Round 23 D. Imbalanced ArrayRead more
[Codeforces] Round 421 (Div. 1) B. Mister B and PR ShiftsRead more
[Codeforces] Round 425 (Div. 2) D. Misha, Grisha and UndergroundRead more
[Hacker Earth] Prefix GCD MaximizationRead more
[Hacker Earth] Make Max GroupsRead more
[Hacker Earth] Good IndicesRead more
[Hacker Earth] Two FriendsRead more
[Hacker Earth] Optimal WayRead more
[Codeforces] Round 427 (Div. 2) D. Palindromic characteristicsRead more