MOHD ARSH SIDDIQUI’s Post

A while back I released algodesigner-genetic, a lightweight, no-nonsense Genetic Programming library for Java. What makes it different: - Zero external dependencies - Available on Maven Central - Simple enough for learning, flexible enough for prototyping If you tinker with GP/GA in Java, give it a look. https://lnkd.in/gH7ErDts #Java #GeneticProgramming #OpenSource #Coding #AI

A couple of years ago, I wrote that "The Builder pattern is a finite state machine!". A state machine consists of states and transitions between them. As a developer, I want to make illegal states unrepresentable, i.e., users of my API can’t create non-existent transitions. My hypothesis is that only a static typing system allows this at compile-time. Dynamic typing systems rely on runtime validation. In this blog post, I will show that it holds true, with a caveat. If your model has many combinations, you also need generics and other niceties to avoid too much boilerplate code. My exploration will use #Python, #Java, #Kotlin, #Rust, and #Gleam. With that background in mind, let’s move on to the model itself. #builderpattern #finiteStateMachine #illegalState #programming #coding (link in the comments)

You write code. But do you know what actually runs? 💻⚙️ Python. Java. C++. All of it eventually turns into something much closer to raw silicon and electricity. And that layer? Most developers never truly understand it. I’m building something to fix that. Introducing: Silicon to Assembly 🚀 A documentation project that breaks down what really happens inside a CPU — from the lowest level up to assembly language. No shortcuts. No black boxes. No “just accept it”. Just pure logic. As Charles E. Leiserson once said: "If you really wanna understand something, you want to understand it to a level that’s necessary and then one level below that, because it gives you an insight as to why that layer is what it is and what’s really going on." 📌 What makes it different? Explains every term — nothing assumed Completely architecture-independent Focuses on understanding, not memorizing Covers the full journey: → CPU internals → Registers & memory → Instruction flow → Assembly If this sounds interesting: Check it out → https://lnkd.in/gVDr7Jmp 🔗 And if you find it valuable, consider dropping a ⭐ on the repo — it really helps the project grow. Most people code. Very few understand what their code becomes. Be one of them. #AssemblyLanguage #LowLevel #ComputerScience #CPU #OpenSource #LearnInPublic #TechEducation

🔐 Dictionary becomes unforgettable when students connect it to OTP verification systems. Today in class, instead of teaching key-value pairs as just syntax, I mapped Python Dictionary to something students use every day: 📱 mobile OTP login 📧 email verification 💳 payment confirmations 🔑 password reset systems The moment they understood: ✅ key = mobile number ✅ value = OTP code ✅ lookup = instant verification …the topic instantly shifted from theory to authentication workflow thinking. This is where Python DSA starts building backend engineering intuition. 📌 Swipe through the slides to see Python implementation + real-world software use cases. Where else do you use Dictionary in real systems? 👇 #Python #DSA #Dictionary #HashMap #PythonDSA #Teaching #Backend #Programming

🚀 Code 6 – #50LeetCodeChallenge 🧩 Problem: Search Insert Position Given a sorted array of distinct integers and a target value, return its index if found. If not, return the position where it should be inserted to maintain sorted order. 💡 Approach: Use Binary Search to efficiently locate the target or its correct insertion position in O(log n) time. 📚 Key Takeaway: Binary search is the go-to technique for problems involving sorted arrays, especially when optimal time complexity is required. #LeetCode #Java #Coding #ProblemSolving #BinarySearch #Arrays #Programming

Where is programming headed? This article explores how concepts from functional programming have spread into “mainstream” languages and how increasing abstraction can reshape the way programmers work. Read here: https://lpi.org/rug6 #LinuxProfessionalInstitute #LPI #functionalprogramming #programminglanguages #python #java #rust #softwaredevelopment #futureofprogramming #programming

Conquering LeetCode one problem at a time! 🚀 Today, let's break down a classic: Problem #53 - Maximum Subarray. Understanding Kadane's Algorithm is an absolute game-changer when diving into Dynamic Programming. To make it easier to digest, I've put together this quick cheat sheet covering: ✅ The core theory behind the algorithm ✅ A step-by-step logical flow ✅ Clean code solutions in both Java and Python Whether you're prepping for upcoming interviews or just sharpening your problem-solving skills, this \bm{O(N)} time complexity approach is a must-know. Which language is your go-to for cracking DSA problems? Let me know in the comments! 👇 #VaruncodeX #LeetCode #DataStructures #Algorithms #Java #Python #SoftwareEngineering #TechCommunity #Coding #Programming

🚀 Day 79 of #100DaysOfCode 💡 LeetCode 338 – Counting Bits Solved today’s problem with a clean and efficient Dynamic Programming + Bit Manipulation approach 💪 🔍 Problem: For a given number "n", return an array where each index "i" contains the number of 1’s in the binary form of "i". ⚡ My Approach: Instead of recalculating bits every time, I reused previous results: 👉 "ans[i] = ans[i >> 1] + (i & 1)" 🧠 Why this works: - "i >> 1" → removes the last bit - "(i & 1)" → checks if last bit is 1 📈 Performance: ✅ Runtime: 3 ms (Beats 95% 🚀) ✅ Memory: 20.14 MB 🔥 Key Learning: Patterns in binary operations can simplify problems drastically. DP + bit tricks = powerful combo ⚡ #Day79 #LeetCode #CodingJourney #Python #DSA #DynamicProgramming #BitManipulation #100DaysOfCode

What will be the output of this code? a = [[0]*3]*3 a[0][0] = 1 print(a) A) [[1, 0, 0], [0, 0, 0], [0, 0, 0]] B) [[1, 0, 0], [1, 0, 0], [1, 0, 0]] C) Error D) Something else? Drop your answer below 👇 #Python #Programming #Coding #DeveloperLife

🚀 Day 23 of #50DaysOfCode Solved Daily Temperatures (LeetCode 739) 🌡️ Today’s focus was on mastering the Monotonic Stack concept — one of the most powerful patterns in DSA. Learned how to efficiently find the next greater element by storing indices and resolving them smartly instead of brute force. 💡 Key Learnings: • Stack helps reduce time complexity from O(n²) → O(n) • Always think in terms of “pending answers” • Monotonic stacks are 🔥 for interview questions ✅ Status: Accepted ✔️ ⏱️ Optimized approach implemented Every day getting better at problem-solving and consistency 💪 #DSA #LeetCode #Java #CodingJourney #Consistency #100DaysOfCode #Programming