🎓 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 - 3760. Maximum Substrings With Distinct Start - Originally used a
len(hashmap), then changed tolen(set(s)) - 45. Jump Game II - Used a greedy breadth-first-search algorithm to solve the minimum number of jumps needed to reach the end
- 167. Two Sum II - Input Array Is Sorted - Used two-pointer technique
- 128. Longest Consecutive Sequence - You can read this blog post detailing my solution
- 15. 3Sum - Used two-pointer technique with a bit of looping logic
- 🔍 GoSearch - Search anyone's digital footprint across 300+ websites
- golsm - A lightweight LSM-Tree key-value storage engine written in Go
- 🧩 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
