Haocheng Lin

@HAOCHENGLIN

Website

Full-time AI Developer 🤖 | Part-time Historian 📚

NorwichJoined June 2023

About

💻 AI Developer & Researcher @ Geologix

🏛️ UCL MEng Computer Science (2019 - 23).

🏛️ UCL MSc AI for Sustainable Development (2023 - 24)

🥇 Microsoft Golden Global Ambassador (2023 - 24)🏆

Available for

🎓One-to-one programming mentoring. 💻Collaboration for team coding projects. 📝World class writing services.

Haocheng Lin's blogs

Haocheng's Coding Hubhaochengcodedev.hashnode.dev33 posts

Codeforces Archivecodeforcesarchive.hashnode.dev4 posts

Articles Threads Comments2

Recently published

codeforcesarchive.hashnode.dev

Bitwise Optimisation for Finding the Last Number

🧩 Problem Recap You’re given a hidden permutation in Equation 1. $$p = [p_1, p_2, \dots, p_n] \qquad (1)$$You can’t directly access the nth value and can only query using the following instruction, where the inequalities Equations 2 and 3 apply. $$?...

Nov 4, 20253 min read

codeforcesarchive.hashnode.dev

From Stacks to Sparse Tables: Reflections on Two Paths to the Same Problem

One of the most fascinating moments from algorithm design comes from two different implementations attempting to solve the same mathematical challenge. This happened recently while comparing two solutions to a competitive programming problem that req...

Nov 1, 20251 min read

codeforcesarchive.hashnode.dev

Codeforces 1060 (Div 2) Problem D. Catshock

If you are exploring graph algorithms, the tree structures can look deceptively simple until you encounter recursion depth, node parity, and leaf-handling logic. In this CatShock problem, it combines dynamic leaf update, depth parity, and DFS into on...

Oct 24, 20255 min read

codeforcesarchive.hashnode.dev

Reverse XOR: Cracking the Palindrome Code (Codeforces Problem)

When I first read the Reverse XOR problem on Codeforces, my instinct was to reach for a brute-force loop. After all, the task seems simple: Does there exist a positive integer x such that x ⊕ reverse(x) = n? Where reverse(x) means reversing the binar...

Oct 15, 20252 min read

haochengcodedev.hashnode.dev

🍬 Solving the "Candy" Problem from LeetCode: A Greedy Algorithm Approach

🚩 The Problem Imagine a line of children, each with a performance rating. You’re tasked with distributing candies to them. But there’s a catch: Every child must get at least one candy. Children with a higher rating than their neighbours must get m...

Jun 2, 20253 min read

Haocheng Lin

About

Available for

Haocheng Lin's blogs

Recently published

Bitwise Optimisation for Finding the Last Number

From Stacks to Sparse Tables: Reflections on Two Paths to the Same Problem

Codeforces 1060 (Div 2) Problem D. Catshock

Reverse XOR: Cracking the Palindrome Code (Codeforces Problem)

🍬 Solving the "Candy" Problem from LeetCode: A Greedy Algorithm Approach

Search Hashnode

Haocheng Lin

About

Available for

Haocheng Lin's blogs

Recently published

Bitwise Optimisation for Finding the Last Number

From Stacks to Sparse Tables: Reflections on Two Paths to the Same Problem

Codeforces 1060 (Div 2) Problem D. Catshock

Reverse XOR: Cracking the Palindrome Code (Codeforces Problem)

🍬 Solving the "Candy" Problem from LeetCode: A Greedy Algorithm Approach