Wants to learn in-depth analysis of the Segment Trees? Starting from the implementation of the Segment Trees to solving a large variety of problems. Here we will start from beginner level discussion to advance level problem solving with Segment Trees. Check out the free classes taken by Riya Bansal.
Why miss an opportunity to learn 😉 Here’s the link: https://unacademy.cc/TUFST

Today’s video is out :)

https://youtu.be/9VPm6nEbVPA

Now with every video, you can find the git link for the code. The codes are the shortest and the most efficient ones you can find for the given problem. I read a lot of comments stating ki bhaiya code galat hai, for that reason I have added the codes, all the codes are submitted and thouroughly tested before putting them in the video. Cheers!

Please share feedbacks. :)

Areh feedback do, thanks nai bolo 👀 like koi v cheez speeed, ya fir code se related ya kch v lag raha kami ho rahi jo samajh nai aa rahi toh batana.

P.S: you can only give feedback if you have done basic dsa and then watching the videos!

Heard that zeta is hiring for 6 months intern. Checkout with the working people there if you can get the referral.

P.S: saw one post at Linkedin now.

Post

Be careful very careful 🤣

This took me 54 minutes to record the explanation only, not including the code. a really tough problem to explain. Will be trimmed to mostly 20/22 mints, will be uploded tomorrow ✌🏼P.S: ek baar me nai hota kyu ki bht br explain krne k bd lagta hai aur better explain kr skte hai isko ;) Do support this video tomorrow, good night

Rendering slow 😶 video apne tay samay simaaa se 1.2 hrs late chal rahi hai :P

The toughest problem’s video is out. Do watch this if you have some idea of LinkedList.

https://youtu.be/VNf6VynfpdM

This video took a lot of effort, so do watch :)

International Grandmaster on Codeforces Nishchay, will discuss and Implement the Chinese Remainder Theorem, which is an important topic in advanced number theory and is heavily utilized both in competitive problems and real-life situations alike. We will also see some problems based on this concept.
Enrol here : https://unacademy.cc/TUFCRT Free haiiiii ;)

Launching The Essential Guide to Becoming a Certified Competitive Programmer. We will cover a range of topics from Roadmap to Competitive programming, Contest Taking strategy on online judges, List of mistakes to avoid in first and second year and how to crack interviews.

Link: https://unacademy.cc/TUFCER

Top Educator Tanuj would be taking up powerful extensions of Segment Trees such as Sparse Segment Trees, Merge Sort Trees, and 2D Segment Trees, which are useful to solve many interesting hard problems, tricks, range query, and update problems on 2D structures like matrices, etc.
Enrol here for FREE : https://unacademy.cc/TUFAST **FREE**


Starts in 2 hours from now!

https://youtu.be/WaH10gQccdI

Kitno ko sue karega ye w.......jr

How many of you face problem in trapping rain water solution?

P.S: leetcode hard n prev google question h

Main problem jo h wo bata dena as i m recording a video on it. Did not find a good enough intuition explanation at yt

https://youtu.be/zUylz4F9flQ

Last week I recorded an interesting conversation with Nishant(incoming sde at cure.fit). We discussed about a lot of stuffs including work life balance and other things.

Do checkout his channel, he makes really good podcasts 👌🏻

https://youtu.be/onLoX6Nhvmg


Brute, better and optimal have been explained.


A lot of people wanted detailed explanation of brute and better too, so I made a detailed explanation of brute and better too. 🤟🏼

Tomorrow you will get the trapping rainwater video.

Do like :)

Check this out: https://stackoverflow.com/questions/47947956/reference-binding-to-null-pointer-of-type-value-type

You might be getting runtime error a lot of times when you write i < arr.size at leetcode or somewhere else. Read the above article.