Skip to content
This repository was archived by the owner on Sep 7, 2025. It is now read-only.

Bitwise Algorithm and Linear Search updated #132

Open
suvanbalu wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Bitwise Algorithm and Linear Search updated #132

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
77f4c37
bit manipulation and linear_search change
suvanbalu Sep 13, 2021
e00980a
Created bitwise algorithms
suvanbalu Sep 14, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Created bitwise algorithms
  • Loading branch information
@suvanbalu
suvanbalu committed Sep 14, 2021
commit e00980a3f0667c8c8630325bb9dfcd934641688f
11 changes: 11 additions & 0 deletions algorithms/bit manipulation/twice_unique.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
def twice_unique(arr:list) :
unique = 0
for i in arr:
unique ^= i
return unique
if __name__=="__main__":
array = list(map(int,input().split()))
#sample input
# 1 2 2 3 4 4 3
element = twice_unique(array)
print(f"Unique element in the array {array} is {element}")
3 changes: 0 additions & 3 deletions algorithms/bit manipulation/xor_swap.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,3 @@
from typing import List


def swap(a:int,b:int) -> list :
a=a^b
b=b^a
Expand Down