1442. Count Triplets That Can Form Two Arrays of Equal XOR

Given an array of integers arr.

We want to select three indices i, j and k where (0 <= i < j <= k < arr.length).

Let’s define a and b as follows:

• a = arr[i] ^ arr[i + 1] ^ … ^ arr[j - 1]
• b = arr[j] ^ arr[j + 1] ^ … ^ arr[k]

Note that ^ denotes the bitwise-xor operation.

Return the number of triplets (i, j and k) Where a == b.

1493. Longest Subarray of 1’s After Deleting One Element

Given a binary array nums, you should delete one element from it.

Return the size of the longest non-empty subarray containing only 1’s in the resulting array. Return 0 if there is no such subarray.

C - Sentou

B - Choose Integers

C - Big Array

D - Simple Knapsack

C - Sequence

Codeforces Round #689 (Div. 2, based on Zed Code Competition) C. Random Events

Codeforces Round #690 (Div. 3) E1. Close Tuples (easy version)

Good Bye 2020 D. 13th Labour of Heracles