🎓 University of Liverpool | 🧑💻 Software Engineer @ Diagnostic World | 🕵️♂️ Offensive Security Researcher
- 219. Contains Duplicate II - Used sliding window to check if there are two indices
iandjsuch thatarray[i] == array[j]andabs(i - j) <= k - 242. Valid Anagram - Used hashmaps to determine if two strings are anagrams of each other
- 144. Binary Tree Preorder Traversal - Used a stack for binary tree preorder traversal
- 94. Binary Tree Inorder Traversal - Used a stack for binary tree inorder traversal
- 13. Roman to Integer - Used a hashmap to convert a Roman numeral string to an integer by iterating through the characters and adjusting the counter based on whether the next character represents a larger value
- 217. Contains Duplicate - Used a hashmap to count the number of times an integer appears in an array
- 🔍 GoSearch - Search anyone's digital footprint across 300+ websites
- 🧩 Checksum - Verify file checksums
- 🎨 Weakpass-CLI - Interact with Weakpass.com's API through the terminal
- 📜 Rules - Lastest Hashcat rules for password cracking
- 🔍 Search-That-Hash -
PR #210- Added Weakpass API for cracking uncommon hashes - 🦋 Sherlock -
PR #2394- Added Bluesky target for Sherlock to find Bluesky accounts
