Legions Soft’s Post

Saw a very interesting YouTube video yesterday that had to do with the history of communication and programming. in 1990, a developer miscoded one line of code at ATT&T and it caused a major crash at the company that resulted in over 50 million calls being dropped. Thought I'd share it here. #coding #softwaredevelopment #techhistory #technology https://lnkd.in/ekSWjWE4

Sometimes, the best way to learn is by building something from scratch. That’s exactly what I did with Passlock—a simple key-value store built with Go. The goal? - To explore encryption practices like AES. - To get more comfortable with Go, through hands-on coding. Passlock allows users to securely store and manage key-value pairs through a command-line interface. No external libraries, just pure Go. Source Code: https://lnkd.in/dgsrKe82

The worst bug is a Heisenbug. If you've never heard of it before it's the kind of bug which just suddenly appears BUT (pick one or two): 1) Only appears in production under certain cases which elude reproduction 2) Once in a blue moon with little to no discernible pattern 3) When something is changed about the environment but no one can tell from any analysis or configuration what the different is You know, something "magical" happens where the stars align to cause strife and pain. All day long I've been working on this *%!^ Heisenbug I'm facing. Code works absolutely fine one place and you move the exact same code to another, it suddenly fails deep down in an event queue far away from anything you've written. #debugging #code #software

Excited to share that I participated in #CodeChef STARTERS145A (division 1), got 4 problems and was 35th on official standings. Following are some high level ideas for the problems I solved, if anyone finds it useful. A. Make Bob Win (https://lnkd.in/dVz6q75x) Observe that blocks of 1 have to be strictly greater than blocks of 0, for bob to always win because bob can just make sure this constraint hold after moves by both player.  Otherwise alice can force the same constraint and bob will lose. B. Square String (https://lnkd.in/dgPFgXQN) For a single index i, having last unequal character at some j position, contribution to answer in such case will be 2 ^ (n - i - j - 1) * (i - j) ^ 2. Notice that this function can be precalculated for each value of i - j and then we can add prefix sums to our final answer. C. Beautiful Array (https://lnkd.in/dEBZ7rSs) First try to greedily build the answer for each query bit by bit starting from the highest bit. For some bit either it's already present in all elements of array or it's missing at some places, in case of missing, we can add back this bit to missing positions if and only if total number of consecutive blocks of such positions <= k. Also once we add some bit using operations at certain intervals, we are now restricted and cannot perform any more operations for any other bit, because that will break the greedily taken bit earlier and thus reducing the answer. This when implemented with some precalculations will be enough. D. Querified (https://lnkd.in/dGV6sXyy) First gcd(v, u) has to be one of the divisors of u, so for each u we can iterate over divisors of it and see if some multiple of that divisor is in it's subtree. Problem will be easier if we kind of start putting values from 1 to N, hence when we are calculating for some value we know for sure we only have values lower than this one, hence no longer to worry about the constraint v < u. Only issue when iterating value-wise(1 to N) is how to know for each divisors of u, that we have some multiple of it in it's subtree. I used Euler tour for this which essentially maps subtrees to a range [L, R] so we can just use sets to track indexes of found elements and then check if desired multiple is in current range or not.

How much do you know about DOM Clobbering? recently, I've had conversations with developers, many mentioned that they weren't aware of it! If you are hearing this name for the first time, take a look at this older challenge #14 (retired a couple of weeks ago): https://lnkd.in/eZct7iF9 give it a try and then read the short summary writeup at: https://lnkd.in/ecGiWby6. Code Wizer! #developercommunity #ctf #appsecurity

Let's dive deeper in CPPMETA - our C++ compiler able to express complex introspection and code generation operations. By discussing how it can solve the automatic differentiation code generation problem! The article : https://lnkd.in/eqGFJZS7 CPPMETA  : https://lnkd.in/ea_AQJE8 #codereckons #developer #cpp #compiler #softwareengineer

Daily growth by tackling LeetCode problems. Consistency is key! ✨ Today's problem : 330. Patching Array The “Patching Array” problem requires you to add the fewest numbers to a sorted array so that you can create every number between 1 to N(given) by summing different combinations of numbers from the array. The goal is to ensure that all numbers in this range are covered by the sums you can make with the original array plus any numbers you add/patch. Return the minimum number of patches required. . . . . . #CodingJourney #ProblemSolving #LeetCodeDaily #100daysofcoding

At Flagright, we're making our vision a reality - enabling #financial institutions to achieve end-to-end #compliance in under 30 minutes. Say goodbye to the months-long integration processes! 🚀 Exciting Milestone: Our customers can now execute an #API call to our Sandbox in less than 30 seconds, all through our revamped documentation page. 🚀 We're committed to providing clarity, usability, and comprehensive support, ensuring a seamless integration experience. Discover how we're changing the game in compliance integration. Check out our demo! #AMLCompliance #APIIntegration

Since the inception of Flagright our vision has been to enable any organization to achieve end-to-end compliance within 30 minutes. The idea that compliance vendors could take months to integrate made no sense to us—and it still doesn’t. Today, we move closer to that 30-minute benchmark with our new API documentation. Customers can now make an API call to our Sandbox in under 30 seconds (!) after signing up with us, directly through our documentation page. With a focus on clarity, usability, and comprehensive support, our updated documentation is designed to revolutionize how customers integrate with and utilize Flagright's API. Key Benefits and Features: 🚀 Integrated SDKs: Jumpstart your integration with pre-built code snippets in Python and Node.js, showcasing best practices to accelerate implementation. 🕹 API Playground: Test, debug, and refine your integration in a sandbox environment before going live, making your first API call in under 30 seconds! 🛠 Practical Use Cases: Discover numerous examples illustrating how our API strengthens your compliance and anti-financial crime framework. 🔎 Detailed API Reference: Gain a comprehensive understanding of our API's capabilities, with extensive descriptions of endpoints, parameters, and response details. 📚 Clear Guide on Entities: Get to the heart of Flagright with our detailed guide on users, transactions, and transaction events. Check out the demo below! #AML #amlcompliance #api

A win-win: Fixed a bug and managed not to create a new feature called 'more bugs.' #CodingLife #DeveloperWins #BugFixing #TechCelebration #SmallVictories #CodeJoy #CelebrateSuccess #SoftwareDevelopment #TechHumor #EveryBugCounts