LeetCode 18, 4Sum asks for every unique quadruplet [a, b, c, d] in an array nums that sums to a target. For example, given nums = [1, 0, -1, 0, -2, 2] and target = 0, the answer is [[-2, -1, 1, 2], [-2, 0, 0, 2], [-1, 0, 0, 1]]. The word unique is the whole game here. It is easy to find quadruplets that sum to the target; it is annoying to make sure you never report the same one twice. ...
From Array Confusion to a Mixed-Radix Decoder: Solving LeetCode 17 in Go LeetCode 17, Letter Combinations of a Phone Number is simple: given a string of digits like "23", return every combination of letters those digits could spell on an old phone keypad. For example, 2 maps to ['a', 'b', 'c'] and if given the input 22, we would expect the output: ["aa", "ab", "ac", "ba", "bb", "bc", "ca", "cb", "cc"]. ...
An introduction to arrays and linear search, live-coded in C11. In this video we cover: Declaring and initializing arrays Accessing and modifying elements Implementing linear search from scratch Brief analysis time complexity All code is written live in C11 with no frameworks or libraries — just the standard library and a text editor. ...
I’m working on a game, and I want to ship that game bug-free. The best way to ensure that is to test, test, and test. Game testing—sometimes called QA or quality assurance—is simple in theory: play the game, try to break it, fix what breaks. The problem is that you built the thing. You play it the way it’s meant to be played. Your players won’t. ...
Learn how to build the classic Snake game in C from scratch! In this tutorial, we’ll create a fully functional Snake game in under 400 lines of clean, readable code using C and Raylib. Perfect for beginners wanting to learn game programming in C or anyone interested in understanding the fundamentals of game development without unnecessary complexity. ...
Learn to code the classic Pong game in C using Raylib in just 220 lines of clean, beginner-friendly code! Perfect for beginners wanting to learn game programming in C or anyone interested in Raylib development. Source Code: https://github.com/bi3mer/raylib-pong Raylib: https://www.raylib.com/
Learn how pathfinding algorithms work through interactive visualizations. In this video, I implement and compare three fundamental search algorithms - Depth-First Search (DFS), Breadth-First Search (BFS), and A* - showing exactly how each one explores a grid to find the optimal path. We’ll cover how DFS explores deeply before backtracking, why BFS guarantees the shortest path in unweighted grids, and how A* uses heuristics to find paths efficiently. Everything is implemented in C using Raylib for visualization with terrain generation via Perlin noise. ...
Stop recompiling your C code just to change a number. adjust.h is a single-header library that lets you edit variables while your program is running - no rebuilds needed. Just include the header, mark your variables, and watch them update live as you edit your source file. In this video, I’ll show you how to set it up and demonstrate why this simple tool can save you time. ...
Tired of the compile-restart-test loop when tuning parameters? In this video, I show you a clever technique for hot reloading hardcoded constants. By wrapping values in a TWEAK() macro, you can edit numbers directly in your source code and see them update in real-time while your program is running—no recompiling or restarting needed. ...
In this video, I implement a Boids flocking simulation using C++ and Raylib. Watch as autonomous agents exhibit emergent behavior through simple rules of separation, alignment, and cohesion, creating mesmerizing patterns that mimic real-world flocking behaviors found in birds, fish, and other animals. Source Code: https://gist.github.com/bi3mer/0017a28837bfa4f380364c6a4e089f68 Raylib: https://www.raylib.com/ ...