The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

Blood group compatibility checker. Validates receiver/donor strings, reports invalid entries, and determines donation safety using complex logical operators.

DuckDB Community Extension adding RapidFuzz algorithms for search, deduplication, and record linkage.

Some interesting problems I solved on competition platforms such as codeforces

⚡ Comprehensive collection of Design & Analysis of Algorithms 🚀 | Includes 🧮 Sorting, 💡 Dynamic Programming, 🎯 Greedy, 🌐 Graph, and 🔤 String Matching | Implemented in ⚙️ C++ with STL | Perfect for 🎓 students & 👨‍💻 developers exploring algorithmic problem-solving ✨

Rapid fuzzy string matching in C++ using the Levenshtein Distance

🔉 Python wrapper for a C++ Double Metaphone

A comparative C++ toolkit for wildcard string matching.

A calculator program that takes in an equation as a string and returns the output.

Effcee is a C++ library for stateful pattern matching of strings, inspired by LLVM's FileCheck

universal text processor

Smart Metro is a modular C++-based Delhi Metro simulator using algorithms like Dijkstra, SJF, Ford-Fulkerson, and more. It features shortest paths, ticket verification, scheduling, and admin tools—all via CLI.

A collection of useful data structures and algorithms for competitive programming.

Implementations of some of the most popular fundamental algorithms in computer science.

Resume Analyzer is a C++ tool that reads resumes, matches them with required skills, ranks them using heaps based on experience and skill relevance, and displays top candidates—all through a menu-driven console interface.

Aho-Corasick algorithm

Knuth Morris Pratt algorithm

Library and command line utility to do approximate string matching of a source against a bitext index and get matched source and target.

A lightweight Python module providing KMP-based search for strings and bytes.

This IDS focuses on detecting intrusion attempts by matching patterns in network data (such as suspicious strings in payloads or requests). It integrates the Knuth-Morris-Pratt (KMP) string-search algorithm for efficient pattern matching while also using auxiliary methods such as hashing and tries for indexing or rule-based detection.