https://adeveloperdiary.github.io/A Developer DiaryA minimal, responsive and feature-rich Jekyll theme for technical writing. 2024-06-17T14:55:06+00:00 Abhisek Jana https://adeveloperdiary.github.io/ Jekyll © 2024 Abhisek Jana /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png Coding Board Game Using PyGame (The Lost Expedition)2024-06-17T00:00:00+00:00 2024-06-17T00:00:00+00:00 https://adeveloperdiary.github.io/python/pygame/coding-board-game-using-pygame-the-lost-expedition/ Abhisek Jana Teaching my child the basics of game programming seemed like a fun and educational project. Little did I know it would turn into an exciting adventure, culminating in the creation of “The Lost Expedition” using PyGame. This blog post recounts my very first journey using pygame, highlighting the essential aspects of game development, including high-level structures, game loops, asset management,... Dynamic Programming - Unique Paths2024-05-29T00:00:00+00:00 2024-05-29T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/dp/unique-paths/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DFS Problem You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit ... Dynamic Programming - Best Time to Buy and Sell Stock with Cooldown2024-05-28T00:00:00+00:00 2024-05-28T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/dp/Best-time-to-buy-and-sell-stock-with-cooldown/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DFS Problem You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit ... Dynamic Programming - Partition Equal Subset Sum2024-05-27T00:00:00+00:00 2024-05-27T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/dp/partition-equal-subset-sum/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DP Problem Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elem... Dynamic Programming - Longest Increasing Subsequence2024-05-27T00:00:00+00:00 2024-05-27T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/dp/longest-increasing-subsequence/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DP Problem Given an integer array nums, return the length of the longest strictly increasing subsequence. Example 1: Input: num...