From 692280761f60ce4592d041463b44947f0dfd7043 Mon Sep 17 00:00:00 2001
From: Kaushik Narayan R <rknarayan02@gmail.com>
Date: Sat, 7 Oct 2023 10:31:48 -0700
Subject: [PATCH] day 10: 190-reverse-bits

so far was on easy, moving to medium difficulty
---
 190-reverse-bits/driver.cpp | 10 ++++++++++
 190-reverse-bits/soln.cpp   | 18 ++++++++++++++++++
 190-reverse-bits/soln.hpp   | 10 ++++++++++
 3 files changed, 38 insertions(+)
 create mode 100644 190-reverse-bits/driver.cpp
 create mode 100644 190-reverse-bits/soln.cpp
 create mode 100644 190-reverse-bits/soln.hpp

diff --git a/190-reverse-bits/driver.cpp b/190-reverse-bits/driver.cpp
new file mode 100644
index 0000000..c3f4230
--- /dev/null
+++ b/190-reverse-bits/driver.cpp
@@ -0,0 +1,10 @@
+#include "soln.hpp"
+
+int main()
+{
+	uint32_t n = 43261596;		 // 00000010100101000001111010011100
+	uint32_t answer = 964176192; // 00111001011110000010100101000000
+	Solution soln;
+	cout << "Reversed bits correctly? " << soln.test(n, answer) << endl;
+	return 0;
+}
\ No newline at end of file
diff --git a/190-reverse-bits/soln.cpp b/190-reverse-bits/soln.cpp
new file mode 100644
index 0000000..a45f959
--- /dev/null
+++ b/190-reverse-bits/soln.cpp
@@ -0,0 +1,18 @@
+#include "soln.hpp"
+
+uint32_t Solution::reverseBits(uint32_t n)
+{
+	uint32_t result = 0;
+	for (int i = 0; i < 32; i++)
+	{
+		result = result << 1; // increase result size
+		result += (n & 1);	  // append last bit
+		n = n >> 1;			  // move to next bit
+	}
+	return result;
+}
+
+bool Solution::test(uint32_t n, uint32_t answer)
+{
+	return reverseBits(n) == answer;
+}
\ No newline at end of file
diff --git a/190-reverse-bits/soln.hpp b/190-reverse-bits/soln.hpp
new file mode 100644
index 0000000..f9b853a
--- /dev/null
+++ b/190-reverse-bits/soln.hpp
@@ -0,0 +1,10 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution
+{
+public:
+	uint32_t reverseBits(uint32_t n);
+	bool test(uint32_t n, uint32_t answer);
+};
\ No newline at end of file