Adding to Anagrams and OnesInBinary

README.md

@@ -168,6 +168,8 @@ Given a list of strings, write a function to get the kth most frequently occurri
 Given a string, write a function to compress it by shortening every sequence of the same character to that character followed by the number of repetitions. If the compressed string is longer than the original, you should return the original string.
 
 * [Anagrams](http://www.byte-by-byte.com/anagrams/)  
+([Java](https://github.com/samgh/Byte-by-Byte-Solutions/blob/master/java/Anagrams.java))
+([Python](https://github.com/samgh/Byte-by-Byte-Solutions/blob/master/python/Anagrams.py))
 Given two strings, write a function to determine whether they are anagrams.
 
 * [Binary Search Tree Verification](http://www.byte-by-byte.com/binarysearchtree/)  
@@ -177,6 +179,7 @@ Given a binary tree, write a function to test if the tree is a binary search tre
 Implement a LIFO stack that has a `push()`, `pop()`, and `max()` function, where `max()` returns the maximum value in the stack. All of these functions should run in `O(1)` time.
 
 * [Number of Ones in Binary](http://www.byte-by-byte.com/onesinbinary/)  
+([C++](https://github.com/samgh/Byte-by-Byte-Solutions/blob/master/cpp/OnesInBinary.cpp))
 ([Java](https://github.com/samgh/Byte-by-Byte-Solutions/blob/master/java/OnesInBinary.java))
 ([Python](https://github.com/samgh/Byte-by-Byte-Solutions/blob/master/python/OnesInBinary.py))<br>
 Given an integer, write a function to compute the number of ones in the binary representation of the number.

cpp/OnesInBinary.cpp

@@ -0,0 +1,38 @@
+/*
+*   Title: Number of ones in binary representation.
+*
+*   Given an integer, write a function to compute the number of ones in 
+*   the binary representation of the number.
+*
+*   Execution: g++ OnesInBinary.cpp -o OnesInBinary
+*
+*   For more details, check out http://www.byte-by-byte.com/onesinbinary
+*/
+#include <iostream>
+
+using namespace std;
+
+int onesInBinary(int x) {
+    int sum = 0;
+    while (x > 0) {
+        sum += x & 1;
+        x >>= 1;
+    }
+    return sum;
+}
+
+int main() {
+    assert(onesInBinary(5) == 2);
+    cout << "Binary representation of 5 has 2 ones" << endl;
+
+    assert(onesInBinary(12) == 2);
+    cout << "Binary representation of 12 has 2 ones" << endl;
+
+    assert(onesInBinary(255) == 8);
+    cout << "Binary representation of 255 has 8 ones" << endl;
+
+    assert(onesInBinary(256) == 1);
+    cout << "Binary representation of 256 has 1 ones" << endl;
+
+    return 0;
+}

java/Anagrams.java

@@ -0,0 +1,50 @@
+/*
+*   Title: Anagrams
+*
+*   Given two strings, write a function to determine whether they are anagrams.
+* 
+*
+*   Execution: javac Anagrams.java && java Anagrams
+
+*   For more details, check out http://www.byte-by-byte.com/anagrams
+*/
+
+public class Anagrams {
+    public static boolean isAnagram(String s1, String s2) {
+        if (s1.length() != s2.length()) return false;
+
+        s1 = s1.toLowerCase();
+        s2 = s2.toLowerCase();
+
+        int[] letters = new int[1<<8];
+
+        for (char c : s1.toCharArray()) {
+            letters[c]++;
+        }
+
+        for (char c : s2.toCharArray()) {
+            letters[c]--;
+        }
+
+        for (int i : letters) {
+            if (i != 0) return false;
+        }
+        return true;
+    }
+
+    // Sample test cases
+    public static void main(String[] args) {
+        assert isAnagram("", "") == true:
+            "Empty string s1='' and string s2='' are anagrams";
+        assert isAnagram("A", "A") == true:
+            "Empty string s1='A' and string s2='A' are anagrams";
+        assert isAnagram("A", "B") == false:
+            "Empty string s1='A' and string s2='B' are not anagrams";
+        assert isAnagram("ab", "ba") == true:
+            "Empty string s1='ab' and string s2='ba' are anagrams";
+        assert isAnagram("AB", "ab") == true:
+            "Empty string s1='AB' and string s2='ab' are anagrams";
+
+        System.out.println("Passed all test cases");
+    }
+}

python/Anagrams.py

@@ -0,0 +1,55 @@
+"""
+Title: Is anagram
+
+Given two strings, write a function to determine whether they are anagrams.
+
+Execution: python Anagrams.py
+
+For more details, check out http://www.byte-by-byte.com/anagrams/
+"""
+from collections import defaultdict
+import unittest
+
+
+def is_anagram(s1: str, s2: str):
+    if len(s1) != len(s2):
+        return False
+
+    s1 = s1.lower()
+    s2 = s2.lower()
+
+    letters = defaultdict(int)
+
+    for c in s1:
+        letters[c] += 1
+
+    for c in s2:
+        letters[c] -= 1
+
+    for i in letters.values():
+        if i != 0:
+            return False
+    return True
+
+
+class TestAnagram(unittest.TestCase):
+    def test_1(self):
+        self.assertEqual(is_anagram("", ""), True)
+        print("Empty string s1='' and string s2='' are anagrams")
+
+    def test_2(self):
+        self.assertEqual(is_anagram("A", "B"), False)
+        print("Empty string s1='A' and string s2='B' are not anagrams")
+
+    def test_3(self):
+        self.assertEqual(is_anagram("ab", "ba"), True)
+        print("Empty string s1='ab' and string s2='ba' are anagrams")
+
+    def test_4(self):
+        self.assertEqual(is_anagram("AB", "ab"), True)
+        print("Empty string s1='AB' and string s2='ab' are anagrams")
+
+
+if __name__ == '__main__':
+    unittest.main()
+