Deci-Binary Partitioning Problem Solution

DAY->12 Solved Running Sum of 1d Array on LeetCode today. Implemented the solution using the Prefix Sum technique to compute the cumulative sum of elements efficiently. -> Time Complexity: O(n) -> Space Complexity: O(n) All 54/54 test cases passed with 0 ms runtime. Small problems like this help strengthen fundamentals in arrays and prefix sums, which are widely used in many algorithmic problems. #LeetCode #DSA #CodingJourney #Programming #Cplusplus #ProblemSolving

Linked list in 10 seconds: Each node = value + pointer to next. Insert anywhere = O(1). Random access = O(n). Use it when you insert/delete a lot. Skip it when you need fast index lookups. That's the whole trade-off. GeeksforGeeks GeeksforGeeks GATE #DSA #LinkedList #DataStructures #Programming

Duplicate enum values can hijack your reverse lookup. Two members are assigned the same numeric constant. A console.log reads the enum by that number. In production this can surface as wrong status codes. Logs may point to an unexpected enum name. Buggy conditionals silently pick the last defined key. Comment A, B, C, or D with the output you think appears and defend your choice. #typescript #programming #codinginterview #backend

"You hit Run… and the computer magically prints the output. But behind that single click, a powerful chain of processes begins. From source code → compilation → assembling → linking → execution, your program travels through multiple stages before the CPU finally runs it. All that… just to print “Hello World.” Welcome to the hidden journey of code. Follow Syntax Squad to learn what really happens inside the machine. #SyntaxSquad #Programming #CodingJourney #ComputerScience #Developers #LearnToCode #TechEducation #CodingCommunity #CodeExplained #BuildInPublic"

Dived deeper into Pointers, exploring stack vs heap memory, dynamic allocation, and how vectors utilize heap memory. Understanding memory management is crucial for writing efficient and optimized code 🚀 Rohit Negi CoderArmy #DSA #Programming #Pointers #MemoryManagement #LearningJourney

Day 6/30 – Arrays ≠ Pointers Today was about memory clarity. arr is not a pointer. But it behaves like one. • arr vs &arr[0] • *(arr + i) == arr[i] • Why array name can’t be reassigned The more I understand memory, the fewer “magic” errors I make. 6 days in. Getting sharper. #30DaysOfCode #Cplusplus #DSA #Programming #BuildInPublic

Minimum Changes to Make Alternating Binary String Intuition A binary string can be alternating in only two ways: 0101... or 1010.... Check one pattern while iterating through the string. If a character doesn’t match the expected bit, we increase a counter cnt (number of changes needed). But this pattern might not be optimal. The operations needed for the other pattern will be: len(s) - cnt So we simply return: min(cnt, len(s) - cnt) This gives the minimum number of changes required to make the string alternating. #problem_solving #leetcode #programming

k-th Lexicographical Happy String of Length n🪢 Given n and k, return the k-th lexicographical happy string of length n. Thought process Brute force idea: Generate all possible happy strings of length n, Sort them, Return the string at k-1 index Optimization Instead of generating everything and sorting later, we can control the order while generating. During backtracking: Try characters in order → a, b, c Skip if the current character is the same as the previous one This way strings are already generated in lexicographical order, so we can directly return the k-th string. #leetcode #thoughtProcess #problemSolving #programming #recursion #backtracking

Another clip from my interview with Thijs Nieuwdorp: this time talking about competition in the open source "marketplace". I learned a lot about the fine art of benchmarking, the importance of accurate comparisons for the team at Polars and the value of learning from other open source projects. Check it out! #Polars #opensource #AUC #programming #Pandas

Learned core concepts of Pointers, including memory addressing, pointer arithmetic, and how arrays are accessed internally. Understanding how data is stored and accessed at a low level improves coding clarity 🚀 Rohit Negi CoderArmy #DSA #Programming #Pointers #LearningJourney