Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6381 |

@blackshadows | 6329 |

@mb1973 | 5388 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@1905439 | 553 |

@terabaap123 | 508 |

@smitadiwedi1991 | 279 |

@DevanandJayakumar | 250 |

@atishagusain | 244 |

@gupta_10 | 226 |

@nipun edara | 224 |

@shubhamkhullar7 | 224 |

@sharmachandan487 | 204 |

@balunagar | 204 |

@arshjit_singh7 | 190 |

Complete Leaderboard |

You are given an array **Arr** of size **N**. Find the sum of distinct elements in an array.

**Example 1:**

**Input:
**N = 5
Arr[] = {1, 2, 3, 4, 5}
**Output: **15
**Explanation:** Distinct elements are 1, 2, 3
4, 5. So sum is 15.

**Example 2:**

**Input:
**N = 5
Arr[] = {5, 5, 5, 5, 5}
**Output:** 5
**Explanation: **Only Distinct element is 5.
So sum is 5.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **findSum()** which takes the array of integers **arr **and **n**** **as parameters and returns an integer denoting the answer.

**Expected Time Complexity:** O(N*logN)

**Expected Auxiliary Space:** O(N*logN)

**Constraints:**

1 ≤ N ≤ 10^{7}

0 ≤ A[i] ≤ 10^{3}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Sum of distinct elements

...