Software Developer
Hi, my name is
I'm a backend software developer specializing in building exceptional, high-performing, and scalable digital experiences. Currently focused on creating robust backend services with Golang.
Get In TouchI'm a Software Developer with 4+ years of experience in building high-performance backend systems and microservices. My expertise lies in designing and implementing scalable solutions using Golang, with a strong focus on performance optimization and system reliability.
Throughout my career, I've worked on various projects, from payment gateway integrations to real-time chat servers, always striving to build systems that can handle high throughput with minimal latency. I'm passionate about solving complex technical challenges and continuously expanding my knowledge in distributed systems design.
Software Developer Backend
CyberSecurity Analyst
Built a scalable chat server with Go, WebSockets, and Kafka, supporting 10,000+ concurrent clients and 200,000+ daily messages. Achieved 99.9% reliability with low-latency messaging.
Developed a custom Redis-like server, improving performance by 50% and handling 1,000,000+ operations per second. Focused on concurrency and memory management.
Created a real-time dashboard backend, managing 5,000+ concurrent connections and reducing data update latency by 60%. Achieved 99.5% uptime for data streaming.
April 24, 2025
Real-time chat is virtually any online communication that provides a live transmission of text messages from sender to receiver. WebSockets are a perfect fit for applications like chats, creating bidirectional communication channels with low latency.
Read More
March 15, 2025
A dashboard is a data visualization and management tool that visually tracks and analyzes the Key Performance Indicators (KPIs), business analytics metrics, infrastructure health and status, and data points for an organization, team, or process. It can be used to present operational and analytical business data with interactive data visualizations to your team.
Read More
January 19, 2025
The Go programming language is a popular statically-typed, compiled programming language that has a C-like syntax. It is gaining more popularity every day in modern developer communities because of features such as memory safety, garbage collection, concurrency, performance, and a developer-friendly minimal syntax.
Go provides a set of libraries known as Go’s standard library, these libraries has almost all the features we need for a modern programming language. It also offers a package to work with reflection, which is a concept that comes from the metaprogramming paradigm.
February 8, 2025
Pub/Sub messaging enables you to create an event-driven systems consisting of event producers and consumers, called publishers and subscribers. Publishers asynchronously broadcast the events to communicate, rather than by synchronous remote procedure calls (RPCs), in which publishers must wait for subscribers to receive the data. However, the asynchronous integration in Pub/Sub increases the flexibility and robustness of the overall system.
Read More
December 10, 2024
Pub/Sub is a messaging paradigm that consists of defining Publishers and Subscribers which Channels in between them, where Publishers act as “message senders” and Subscribers act as “message receivers”. The Publishers do not send messages directly to Subscribers but rather to Channels; those Channels act as an intermediary between Publishers and Subscribers, the idea is to have those Subscribers to only receive the messages they are interested to, and having them decoupled from the Publishers.
Read MoreThe problem of computing the reversal distance and determining a sequence of reversals to transform a genome in molecular biology is a powerful tool to derive relationships between genes. Given two signed permutations, we need to find the shortest sequence of reversals to transform one into another. The foremost polynomial-time algorithm to calculate the reversal distance used an overlap graph formed from the permutation to find connected components and then identified graph structures like hurdles. Previous researchers have used a Union-Find structure, an O(nα(n)) algorithm (α → inverse Ackermann function) to determine the connected components. A linear time algorithm for finding the connected components, which was a faster implementation of the existing works, was proposed later. This algorithm is applied to an unsigned extension of the signed permutation. In the first scan, cycles in a breakpoint graph were located. Then in a second scan, an overlap forest is formed which gave all the connected components of the permutation. In this paper, we optimize the existing algorithm to construct the overlap forest by reducing a scan of the unsigned permutation.