Root Inc.’s Post

Rust's data types are crucial: Scalars handle individual values, while compounds like tuples and arrays organize them. With Rust's safety, your data behaves reliably for robust software development. 🦀🛠️💡

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.

Times I've Bricked my Own Machine: 3 Times I've Un-bricked my Own Machine: 3 I've been daily driving with Pop!OS for four years now. It's been a learning experience trying to migrate and upgrade from a 1TB drive to a 4TB drive in-place. I've ran the gambit of dealing with Clonezilla and how deep the cloning goes, pulling my hair out over why my /etc/fstab edits weren't changing the drive I boot into. Then realizing that I had to edit my /boot/efi/loader/entries/Pop_OS-current.conf to point to the right partitions has rewarded me with not having to worry about upgrading for a few more years--along with more knowledge about systemd.

Remember, while it's tempting to play the blame game with external tools, more often than not, the gremlin is partying in our own code. Before pointing fingers at 'select' or its friends, let's turn our magnifying glass inward. Chances are, that elusive bug is just doing the cha-cha slide somewhere between your functions and loops. So let's roll up our sleeves, dive into our application, and show that bug the exit door. After all, the most fulfilling bug hunt is the one that ends in our own backyard! #BugHunting101 #ItsNotYouItsMyCode #CodeSleuth

Today I participated in Codeforces Round 953 (Div 2) and sloved A,B,C problems..... A) In problem A, just return the maximum element of starting n-1 elements of array + last element of array. B) we will sell the buns with modified price untill the modified price < usual price..and rest buns will be sold with usual price. C) After reading the problem, one thing is noticed, if k is odd , then it is impossible to make such array .... and if not.... then make an array with 1 to n elements..and two pointer ..one is in 0 index and other is in last index ...and check if the sum of the difference between the arr[i],j+1 and arr[j],i+1 is less than or equal to k, just swap the elements and update the k, otherwise just swap the elements arr[i] and arr[i] + k/2...and break the loop.... and check if k is 0 .. then print the updated permutation otherwise print NO....

Yesterday, I participated in Codeforces Round 958 (Div. 2). I solved one question in today's contest. For the second question, my approach was correct but had wrong answers on some test cases. My rank in this contest was 12,971 and my rating increased from 781 to 799.  Here are the approaches I took for the respective questions. A.   Split the Multiset : We started with a set S containing only one element n, which we had to convert into n ones using a specific operation. The approach was straightforward due to the small constraints: run a while loop until n is greater than 1, subtract (k−1) from n, and increment the count. Finally, print the count. B.   Make Majority : Given a binary string, we could choose two indices and replace the entire sequence with its minority. The goal was to determine if it was possible to make the string equal to 1 after a finite number of operations. My approach involved replacing consecutive zeros with a single zero, then counting the number of ones and zeros and comparing them. However, I struggled with the implementation despite its simplicity. I will work on improving this.

We're going to launch a DevBetter sub-series where we look at code examples and discuss why it's "bad." Here's a simple preview of one we're going to chat about. So, my question to you: Why is this bad?

FIVE REASONS WHY YOU SHOULD START USING SVELTE 1) The Svelte Compiler 2) State Management 3) Reactivity 4) Scoped Styles 5) Component Events For detail read our blog https://lnkd.in/ep82XpiZ

The Algorithms - Rust is an open-source repository that shows you all algorithms implemented in Rust. This is a perfect educational resource for those who want to learn or practice Rust. https://lnkd.in/dtnm-xYQ #rust #opensource #software

Hi friends, I have moved all my Cypress blogs to https://lnkd.in/gSZ5yCRU, as dev.to does not impose read cap limits. Current posts: - Once upon a time a cy.session()… - What do the number φ (Phi), a cheese pizza pie, and a Cypress fixture have in common? - And the nominees for “Best Cypress Helper” are: Utility Function, Custom Command, Custom Query, Task, and External Plugin Hope you enjoy the reading. Cheers!