This directory contains Python implementations of common array-based algorithms and problems.
- Anagram Check (Sorted Solution): Checks if two strings are anagrams by comparing their sorted versions.
- Anagram Check (Manual Solution): Checks if two strings are anagrams using a hash table (dictionary) to count character frequencies.
- Array Find Missing Element (XOR Solution): Efficiently finds a missing element in a shuffled array using bitwise XOR.
- Array Find Missing Element (Brute Force Solution): Finds a missing element by sorting both arrays and comparing them.
- Array Find Missing Element (Hash Table Solution): Finds a missing element using a hash table (dictionary) to track element counts.
- Array Find Missing Element (Sum/Subtract Solution): Finds a missing element by calculating the difference between the sums of the two arrays.
-
Array Pair Sum Solution: Finds all unique pairs in an array that sum up to a specific value
$k$ using a set for$O(n)$ complexity.