ENKR's Blog | Jing Hui PANG

Discover the Euclidean Algorithm, an efficient method for finding the greatest common divisor (GCD) of two numbers. This guide includes a step-by-step explanation and Java implementation, perfect for software engineers and algorithm enthusiasts.

wip ...

https://www.phoenixframework.org/

Dive into Dijkstra's Algorithm, a fundamental graph algorithm for finding the shortest paths between nodes with non-negative weights. Learn how it works, its use cases, and how it compares to other shortest path algorithms.

Explore the Floyd-Warshall algorithm for finding shortest paths between all pairs of vertices in a weighted graph. Learn about its applications, benefits, and limitations in handling both positive and negative edge weights.

Explore Floyd's Tortoise and Hare Algorithm for detecting cycles in linked lists and arrays. This efficient algorithm, named after Robert W. Floyd, uses two pointers moving at different speeds to identify cycles with linear time complexity and minimal space usage.

A personal collection of SQL notes, including basic commands, useful tips, and best practices for working with databases. This notebook covers practical examples and insights from using MySQL and PostgreSQL, aimed at helping you keep track of essential SQL concepts and techniques.

Explore a personal collection of Vim commands and tricks that I've found useful in enhancing my text editing efficiency. Whether you're a DevOps engineer, a frontend developer, or a backend coder, these notes will guide you through mastering Vim.

Explore my portfolio of cutting-edge software and technology projects. From mobile apps to web platforms, discover how I solve real-world challenges with innovative and effective solutions.

In 2024, I am aiming to grow both professionally and personally. From pursuing a Computer Science degree and levelling up at ByteDance to rekindling old hobbies like beatboxing and investing in financial growth. Here's my plan.

Join me as I explore Big-O Notation through my personal notes. This blog is a space where I document my understanding of algorithm efficiency, offering insights into how I approach time and space optimisation in coding.

A collection of notes and resources for Java programming language

Unlock the secrets of Manacher's Algorithm in this detailed exploration. Learn how this ingenious method enables rapid identification of the longest palindromic substrings, drastically reducing computational complexity and enhancing algorithmic efficiency. Perfect for both budding and seasoned computer scientists.

Dive into the intricacies of computer networking with this detailed notebook. From basic concepts to advanced networking techniques, this post offers a thorough exploration of network design, protocols, and security measures. Ideal for students and professionals alike, learn how to effectively manage and optimize network infrastructure for better performance and reliability.