[CS Academy] Letters Deque|PSCS Academy|Problem Solving

Letters Deque

Read more
[CS Academy] Hamming Distances|PSCS Academy|Problem Solving-Dynamic Programming-Bit Manipulation

Hamming Distances

Read more
[CS Academy] Graph Game|PSCS Academy|Problem Solving-Graph Theory-BFS

Graph Game

Read more
[CS Academy] Triangular Updates|PSCS Academy|Problem Solving-Prefix Sum-Offline Query Technique

Triangular Updates

Read more
[Codeforces] Abbyy Cup 2.0 - Final (unofficial) D9. The Beaver`s Problem - 3|PSCodeforces|Problem Solving

Abbyy Cup 2.0 - Final (unofficial) D9. The Beaver’s Problem - 3

Read more
[Codeforces] Abbyy Cup 2.0 - Final (unofficial) D1. The Beaver`s Problem - 3|PSCodeforces|Problem Solving

Abbyy Cup 2.0 - Final (unofficial) D1. The Beaver’s Problem - 3

Read more
[Codeforces] Round 133 (Div. 2) C. Hiring Staff|PSCodeforces|Problem Solving-Greedy-Prefix Sum

Codeforces Round 133 (Div. 2) C. Hiring Staff

Read more
[Codeforces] Round 136 (Div. 1) B. Little Elephant and Array|PSCodeforces|Sorting-Problem Solving

Codeforces Round 136 (Div. 1) B. Little Elephant and Array

Read more
[Codeforces] Round 137 (Div. 2) C. Reducing Fractions|PSCodeforces|Problem Solving-Math

Codeforces Round 137 (Div. 2) C. Reducing Fractions

Read more
[LeetCode] Maximum Sum Queries|PSLeetCode|Sorting-Segment Tree-Problem Solving-Hash Table-Offline Query Technique

2736. Maximum Sum Queries

You are given two 0-indexed integer arrays nums1 and nums2, each of length n, and a 1-indexed 2D array queries where queries[i] = [xi, yi].

For the ith query, find the maximum value of nums1[j] + nums2[j] among all indices j (0 <= j < n), where nums1[j] >= xi and nums2[j] >= yi, or -1 if there is no j satisfying the constraints.

Return an array answer where answer[i] is the answer to the ith query.

Read more