DSA Level 2 Data Structures Hashmap and Heaps Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K

Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K

easy

Hashmap and Heaps

Question Solve Solutions

1. You are given an array(arr) of integers and a number K.
2. You have to find if the given array can be divided into pairs such that the sum of every pair is divisible by k.

Input Format

A number N arr1 arr2.. N numbers A number K

Output Format

true or false.

Constraints

1 <= N <= 10^6
1 <= arr[i] <= 10^4
1 <= K <= 10^4

Example

Input

4
9 7 5 3
6

Output

true

Find Itinerary From Tickets

Largest Subarray With Zero Sum

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself