ENKR's Blog | Jing Hui PANG

A comprehensive solution and detailed explanation for solving LeetCode Problem 194: Transpose File. This guide includes the problem statement, approach, and code implementation.

A comprehensive solution and detailed explanation for solving LeetCode Problem 192: Word Frequency. This guide includes the problem statement, approach, and code implementation.

Searching for a room to rent in Singapore for two siblings by July 2024. Budget around 1,100 SGD per month. Full-time employees and permanent residents. Contact via WhatsApp for more details. / 寻找 2024 年 7 月前在新加坡的租房，适合两兄妹居住。预算约为每月 1,100 新币。我们是全职员工和永久居民。请通过 WhatsApp 联系获取更多信息。

Read about my experience interviewing for a Site Reliability Engineer role at TikTok. Learn from my mistakes, discover key insights, and get valuable tips for your own job search.

Explore my personal experience interviewing for a Site Reliability Engineer (SRE) role at Google, my first ever job interview. Follow my journey from the initial HR call to the technical interview rounds, including valuable insights, challenges, and key takeaways.

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/ https://devhints.io/phoenix-migrations https://thinkingelixir.com/available-courses/ https://www.openmymind.net/Pattern-Matching-In-Elixir/ https://hashrocket.com/blog https://felt.com/blog/rate-limiting https://curiosum.com/blog/phoenix-framework-guide

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.