Find Pair | HackerEarth

Find Pair

Practice

2.5 (11 votes)

Basic programming

Open

Approved

Easy

Hash function

Mathamatics

Problem

69% Success 6417 Attempts 20 Points 5s Time Limit 256MB Memory 1024 KB Max Code

Given an array A having N elements. Find total number of pairs (i,j) such that j < i and A j = A i . Input: First line of input contains N, size of array A . Next line contains N space separated elements of array A . Output: Print the required answer. Constraints: 1 \leq N \leq 10 5 0 \leq A i \leq 10 5

You need to be logged in to access the code editor

Please wait while we load the editor

Results

Custom Input

Run your code to see the output

Submissions

Please login to view your submissions