Thank you for explaining in such a clear and concise way, I had problems with other videos like many other people, but you saved us! Thank you!
@pavankumar-of4ew10 күн бұрын
neatly explained
@indianengineer580219 күн бұрын
Never did open source, but I heard that for contribution we do fork. It's strange to see checkout here.
@JyotinderSingh19 күн бұрын
@@indianengineer5802 you're correct, ideally you'd be forking the repository and checking out a branch there. I have commit access on the repo so I usually do this on upstream directly.
@indianengineer580219 күн бұрын
@JyotinderSingh thanks for clarification
@dilipkumarbk765721 күн бұрын
Hello there, If I have to use it to test in a Springboot application how can we integrate dicedb and use.
@JyotinderSingh21 күн бұрын
@@dilipkumarbk7657 while we don't have java SDKs for DiceDB yet (we're focusing on Golang tooling for now), any existing Redis Java SDK should work fine. This should be enough for some basic testing. However, you won't be able to use the reactivity features when using the Redis SDK (since they require custom client side logic).
@dilipkumarbk765721 күн бұрын
@JyotinderSingh yeah I got the same doubt about the reactivity. Anyways thanks for the response. Hope we get SDK for Java too soon. 🙌🤗
@nimil22 күн бұрын
Very cool
@AruneshSrivastavaАй бұрын
for those , who find subtracting '0' from sum bit confusing , can use Character.getNumericValue(a.charAt(i)); as well , it just returns the integer value for that character
@anthonya880Ай бұрын
Guys how popular is Go in India ?
@JyotinderSinghАй бұрын
@@anthonya880 quite popular I'd say!
@studentsheaven-d8vАй бұрын
love from PAKISTAN.
@janjoska25492 ай бұрын
Thx
@tharuushi2 ай бұрын
@Asingh422 ай бұрын
Indian Nick White :) I mean to the point explanation
@Genji_hehe3 ай бұрын
Great video and git repo. I had one question though, before writting the entry to the segment file we are checking if rotation is needed right? But we are calling the rotateIfNeeded() before adding anyting to the writer buffer. So when it checks for a overflow of file size then the wal.bufWriter.Buffered() return 0 as the buffer is empty because entry is being filled after the rotateIfNeeded() call?
@Genji_hehe3 ай бұрын
Like shouldnt we first fill the buffer then check if the file size would exceed? Or maybe im wrong about the Buffered() function's working?
@Genji_hehe3 ай бұрын
For eg if we have a log segment file lets say "f" filled with "x" bytes and assume that f is the last segment file written to. We have the file limit of x+1 bytes. Which makes 1 bytes yet to be filled. Lets say we boot up the system and write a log entry of say 3 bytes. Now, the buffer is currently empty so the rotation check of f.Size()+int(bufwriter.Buffered()) would still be x bytes which would be less than file size limit. But we wouldnt have space in the file would we?
@rajeshkilladi71243 ай бұрын
Thank you so much for the explanation❤, simply get the whole concept within the first 5 min, for those guys who are checking the comments whether to watch this video is simple, go for it.
@smilingworld96474 ай бұрын
thank u brother you saved my exam 🌹🌹🌹🌹
@EugeneTolbakov5 ай бұрын
Nice walkthrough Jyotinder! Thank you for the video!
@Tiyasa-d8f5 ай бұрын
the only intuitive video all over you tube! Thanks
@jayaprakashreddy99805 ай бұрын
How did you make the diagrams and what do you to draw.
@JyotinderSingh5 ай бұрын
@@jayaprakashreddy9980 I use Notability on my iPad
@jayaprakashreddy99805 ай бұрын
@@JyotinderSingh thank you! Your videos are awesome. I'm thinking of implementing a Distributed task scheduler.
@evanxg8520005 ай бұрын
Great video, more like this please. I think the worker SendHeartbeat & UpdateTaskStatus could be combined into a single RPC
@zekicaneksi6 ай бұрын
even if i understood it, you made a fanstastic job. thanks my man
@20-213K.abhilasha7 ай бұрын
we cannot use it as a[i] & b[j] it is not an array
@jasonzavaglia7 ай бұрын
Best explanation I've seen on it though, thanks! Just wanted to point out though that there is an off-by-one error in the code. The for loops need to be up to <= word1.size() , not < word1.size(), and the final result should be retrieved from dp[word1.size()][word2.size()]. Try the test case "abc" / "xyz" for an example with edit distance 3. I noticed that the initial array sizing with +1's - but the algorithm coded there (incorrectly) does not use the last column/row.
@aarushisharma78567 ай бұрын
Thanks a lot!!!
@vaibhavmewada45088 ай бұрын
nice explanation
@chhayakumardas95398 ай бұрын
A very insightful video. Just had one question around repair. Once we find a corrupted log wouldn't the data be insconsistent even after the repair? I am coming from the place where I have to use repair for a DB recovery
@JyotinderSingh8 ай бұрын
The repair is essentially discarding all data that it cannot read. It preserves entries up till the last row of data that the system is able to read successfully. We work on the assumption that all data which we can read is correctly stored in the WAL (Reinforced by the checksum). The recovery mechanism is on best effort basis, and attempts to retrieve all data that it can successfully read.
@sambhavmishra54238 ай бұрын
bro can you bring something with golang
@prashlovessamosa8 ай бұрын
Great explanation
@snehasaxena81988 ай бұрын
So concise and on point
@dwivedishashank98 ай бұрын
Thanks man. Will be using variable names going forward :)
@obarlanytska30518 ай бұрын
cool video with brilliant explanation.
@ecliipvzz8 ай бұрын
Thankyou so much for the explanation!! I have my finals next week and this helped a lot.
@terfamike-kusah67159 ай бұрын
Supposing I want to Design and implement a distributed system that monitors and optimizes resource utilization across multiple nodes in a network. What changes do I make?
@zaorincito9 ай бұрын
good video explanation thanks
@og1kenobi9739 ай бұрын
You, sir, are a LEGEND!
@engineeringflix9 ай бұрын
very welll explained....
@janogashoamatalaah776410 ай бұрын
thank you
@RiteshKumar-sx7ng10 ай бұрын
thank you very much!! Bhaiya.
@teeshadembla692010 ай бұрын
amazing explanation!!!
@angeltran38110 ай бұрын
Thank you. At first, I feel difficult to understand the problem. Thanks to your video, it is clear and easy to implement.
@thiccphone116611 ай бұрын
Why would you want the minimum health at the end? I would want maximum health especially if you can carry health over to the next floor. TBH, wasn't really paying attention and you may have explained it but I don't get what you mean by "wasting health" since you aren't technically wasting anything since if the goal is only to reach (2,2) from (0,0) as long as you get to the location then the optimal solution is taking less steps. Since both solutions are equal, except one solution results in having more health at the end, it would be safe to assume that MORE health at the end is better rather than having the minimum. Having the maximum health means you will be prepared for the future, while having the minimum means you can only do the single task. So if the rule was to get there with the fewest steps, then health is irrelevant outside of being alive upon reaching the destination. If the rule was to get there before the princess's health reaches 0, say after every step she loses health and has a number of health points, the optimal solution would be to get as much health for the knight as possible and the princess has the minimum required to reach the goal. Given that the only rule is to reach the princess without dying then there are two solutions. If the question was what's the minimum health required by a knight to reach the princess then the optimal solution is still Down-Down-Right-Right as the minimum health require is 6, not 7. At the same time, my knight would be stronger by the time I reach the princess and your knight would be the weakest. My underdog knight could continue adventuring.
@prashlovessamosa11 ай бұрын
I have seen your projects those are super awesome. Please guide me how have you started learning so deeply and how can i achieve it.
@JyotinderSingh11 ай бұрын
Thanks for the kind words Prashant. I usually read books for inspiration and guidance in these domans. Some good books I can recommend are Architecture of Open Source Applications, Designing Data Intensive Applications, Database Internals by Alex Petrov, Understanding Distributed Systems.
@prashlovessamosa11 ай бұрын
great thanks for sharing@@JyotinderSingh
@shameerbaramy310311 ай бұрын
Thank you. Really good stuff !!
@avi_582711 ай бұрын
Thank you for the video, It was highly insightful !!
@prashlovessamosa11 ай бұрын
Great video please make more videos on low level stuff
@AMAN-oz8ud11 ай бұрын
really liked your vscode theme, please share
@JyotinderSingh11 ай бұрын
I use Darcula
@abhishekmehandiratta424111 ай бұрын
What a great video! thanks for the clear explanation!
@JyotinderSingh11 ай бұрын
Thank you!
@damercy11 ай бұрын
Great stuff! Thanks a lot! Please keep posting such videos with such clear explanation. 👌
@JyotinderSingh11 ай бұрын
Thanks! More videos and articles coming!
@sids02711 ай бұрын
Great video on a topic I was curious about. Thanks!
@tarun3847 Жыл бұрын
Zoom screen so it will be clear
@JyotinderSingh Жыл бұрын
Will keep this in mind, thanks.
@deathdefier45 Жыл бұрын
Absolute pillar of the grpc community, thanks for this brother!