Skip to content
#

algorithms-and-data-structures

Here are 1,790 public repositories matching this topic...

hackerrank solutions github | hackerrank all solutions | hackerrank solutions for java | hackerrank video tutorial | hackerrank cracking the coding interview solutions | hackerrank data structures | hackerrank solutions algorithms | hackerrank challenge | hackerrank coding challenge | hackerrank algorithms solutions github| hackerrank problem solving | hackerrank programs solutions | JAVAAID |all hackerrank solutions | Coding Interview Preparation

  • Updated Sep 6, 2020
  • Java
ishi0301
ishi0301 commented Sep 12, 2020

🚀 Feature

Given an array that contains all elements occurring 3 times, but one occurs only once. Find that unique element.
Input : arr[] = {6, 2, 5, 2, 2, 6, 6}

Output: 5

Have you read the [Contributing Guidelines on Pull Requests]

Yes

Motivation

I want to solve this issue as a part of CH20.

Pitch

We can use bitwise AND to find the unique element in O(n)

Improve this page

Add a description, image, and links to the algorithms-and-data-structures topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithms-and-data-structures topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.