[LeetCode] Triples with Bitwise AND Equal To Zero

982. Triples with Bitwise AND Equal To Zero

Given an integer array nums, return the number of AND triples.

An AND triple is a triple of indices (i, j, k) such that:

  • 0 <= i < nums.length
  • 0 <= j < nums.length
  • 0 <= k < nums.length
  • nums[i] & nums[j] & nums[k] == 0, where & represents the bitwise-AND operator.
Read more
[LeetCode] Sum of Even Numbers After Queries

985. Sum of Even Numbers After Queries

You are given an integer array nums and an array queries where queries[i] = [vali, indexi].

For each query i, first, apply nums[indexi] = nums[indexi] + vali, then print the sum of the even values of nums.

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

Read more
[AtCoder] A - STringRead more
[AtCoder] C - Next LetterRead more
[AtCoder] B - Friendly RabbitsRead more
[AtCoder] C - Many FormulasRead more
[AtCoder] B - Card Game for Three (ABC Edit)Read more
[Codeforces] Round #619 (Div. 2) B. Motarack`s BirthdayRead more
[Codeforces] Round #620 (Div. 2) C. Air ConditionerRead more
[Codeforces] Round #621 (Div. 1 + Div. 2) C. Cow and MessageRead more