A brief explanation of recursion in JavaScript with a practical example comparing iterative and recursive vowel counting functions.
A developer shares unconventional personal rules and habits that helped them prepare for and land a software engineering job.
A technical walkthrough of three LeetCode problems: Move Zeroes, Merge Two Sorted Lists, and Merge Two Binary Trees, with Python solutions.
A developer shares solutions and analysis for three LeetCode problems: Flipping an Image, Leaf-Similar Trees, and Maximum Depth of N-ary Tree.
A developer shares solutions and insights for three LeetCode tree algorithm problems: Invert Binary Tree, N-ary Tree Postorder, and Preorder Traversal.
A developer shares solutions and analysis for three LeetCode array problems: monotonic arrays, consecutive ones, and duplicate detection.
A developer's log of solving three LeetCode problems, analyzing solutions and complexity for keyboard row, log sorting, and single number challenges.
A developer shares solutions and analysis for three LeetCode problems, focusing on algorithm efficiency and common pitfalls.
A developer continues their Leetcode streak, solving problems in Python and analyzing performance, including sorting arrays by parity and robot movement.
A technical guide on implementing Markov chains in Swift to generate realistic but nonsensical text from a given corpus.
A comprehensive overview of policy gradient algorithms in reinforcement learning, covering key concepts, notations, and various methods.
Explores the Multi-Armed Bandit problem, a classic dilemma balancing exploration and exploitation in decision-making algorithms.
A review and tips for the OMSCS CS7641 Machine Learning course, covering assignments, exams, and workload.
Analyzing the probability of self-assignment in a Secret Santa gift exchange using probability bounds and simulations.
Explores academic research papers referenced in the .NET runtime and compiler source code, focusing on data structures and optimization algorithms.
A critical guide to programming books, offering specific recommendations and anti-recommendations for topics like algorithms and data structures.
Discusses balancing trendy tech with core programming fundamentals like algorithms and clean code to master software development.
An introductory explanation of permutation patterns, covering basic permutations, slot restrictions, and their relevance to programming and mathematics.
A developer revisits and improves their JavaScript Tic Tac Toe game, focusing on refactoring win-checking logic and adding AI tactics.
A graduate reflects on their 5-year computer engineering master's at Linköping University, covering courses, projects, and personal growth.
