shahed User

At University of Łódź, I built and benchmarked hash tables, tries, balanced trees, and string-matching algorithms from scratch in C++ and Python. My measurements compared theoretical complexity with actual runtime and memory use.

For my Algorithms & Data Structures Benchmark Suite, I compared several hash-table strategies across load factors and built multiple structures for a 109,572-word dictionary. The double-array trie used about eight times less memory than the ordinary trie, with about three times the build time.

In my String-Matching Algorithm Suite, I implemented and benchmarked brute force, Sunday, KMP, Rabin–Karp, Z-algorithm, and finite-state-machine matchers. I also extended Sunday matching to support wildcards and checked it against a brute-force matcher.

As an HR Intern at MKY Global Forwarding, I managed recruitment workflows for 20 job postings and verified onboarding records for 13 employees. I’m a third-year Computer Science student at University of Łódź, expecting to graduate in June 2027, and I’m seeking a software engineering internship.