Abdussalam Mujeeb-ur-rahman’s Post

Just completed an intensive workshop on troubleshooting techniques and code analysis. Excited to apply these newfound skills to enhance problem-solving and optimize code efficiency. #Troubleshooting #CodeAnalysis #ContinuousLearning

Code comments at the right places can be invaluable. Came across an enlightening piece from Dan Harper (the post is linked at the end), where he shares a compelling narrative about the hidden complexities of software maintenance and the unexpected consequences of seemingly minor configuration changes. It's a vivid reminder of the critical role code comments can play in saving future developers from painstaking hours of unnecessary debugging and, potentially, months of head-scratching. Something like this comment added around that setting could have prevented it: // IMPORTANT: This service is set to "conservative" mode due to a known issue with memory corruption when deep-duplicating objects using the XYZ library. Changing this to "performance" mode has previously led to intermittent service failures. This decision was made after extensive debugging to prevent errors related to incompatible shared memory models. Please refer to git history around [specific date or commit hash] for more context. Link to Dan's post: https://lnkd.in/dGE_FXAC #CodeComments #SoftwareDevelopment #DebuggingTips #CodeQuality #ProgrammingBestPractices

2015: Learn how to code 2024: Learn no-code

Retesting

Understanding Code Decay and How to Mitigate It

Discover the different types of flow dependencies and how specification-driven code slicing can automatically verify the absence of unintended flows. #EmbeddedSystems https://spr.ly/6042cA19n

Day 41 of #100DaysOfProgrammingChallenge Challenge completed: Solved LeetCode Problem #2044 - Count Number of Maximum Bitwise-OR Subsets Problem Breakdown: The task was to determine the maximum possible bitwise OR of a subset of integers from an array and count how many subsets achieve that maximum OR value. A subset can be derived by removing some or no elements from the array, and the subsets are considered different if they involve different indices. Example: Input: nums = [3, 1] Output: 2 Approach: First, calculate the maximum OR value that can be achieved by combining all elements in the array. Using recursion, explore all possible subsets of the array. Each time a subset reaches the maximum OR value, increase the count. Recursively building subsets ensures that we check every possible combination. This problem was an exciting way to dive into bitwise operations and subset generation, pushing for an efficient approach to explore all possibilities. I enjoyed tackling the recursion and bitwise logic! #CodingChallenge #ProblemSolving #Leetcode

Is there anything like “self-documented” code? #softwareengineering #softwaredevelopment #softwarequality #softwarearchitecture

Are code reviews only for finding bugs before they become major issues? Here are 5 other “usually-unnoticed” ways code reviews can help you:

Are you ready? Learn more about code freeze and what to expect by reading the blog post linked below!