[Hacker Rank] New Year ChaosRead more
[Hacker Rank] Flipping the MatrixRead more
[Codeforces] Round 592 (Div. 2) D. Paint the TreeRead more
[Codeforces] Round 595 (Div. 3) D2. Too Many Segments (hard version)Read more
[Codeforces] Round 595 (Div. 3) D1. Too Many Segments (easy version)Read more
[Codeforces] 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) B. The Feast and the BusRead more
[Codeforces] 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) J. The ParadeRead more
[LeetCode] Find the Difference of Two Arrays

2215. Find the Difference of Two Arrays

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

  • answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
  • answer[1] is a list of all distinct integers in nums2 which are not present in nums1.

Note that the integers in the lists may be returned in any order.

Read more
[CS Academy] Money MachineRead more
[CS Academy] Lucky DaysRead more