<p>Thanks for the article</p>

<h1><strong>Solution 2</strong></h1> <h2><u><strong>Overview</strong></u></h2> <p>In this question, we are given two integers, num1 a…

<h1>Problem 1 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Sweep line</li> <li>Sorting</li> <li>Segment Tree / Bina…

<h1>Problem 3 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li><strong>Number Theory</strong> <ul> <li>Modular Arithm…

<h1>Problem 4 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Dynamic Programming</li> </ul> <h2>Overview</h2> <p>We c…

<h1>Problem 2 Solution</h1> <h2>Topics Involved / Prerequisites</h2> <ul> <li>Lowest Common Ancestor</li> <li>Prefix Sums</li> <li>Dyn…

<p>🙋I am getting wrong ans on test case 4 for this question</p>

<p>Thank you so much for noticing this.</p>

<p>For the testcase<br /> 7<br /> 1 -1 -1 1 -1 1 1<br /> 2 2 2 2 11 11 4<br /> Your answer is:<br /> 4 5 6<br /> Correct answer is:<br /> 2…

<p>It is possible to use BIT for range min/max queries. You may refer the following article :&nbsp;<a href="https://stackoverflow.com/quest…

<p>/*&nbsp;</p> <p>Can anyone tell me what am&nbsp; i doing&nbsp; wrong in my code ?</p> <p>It is&nbsp; failing on Test Case 31</p> <p>*…

<p>/*</p> <p>solution for problem Nice Subarry.</p> <p>Here i am using the concept of sliding window.</p> <p>*/// Online C++ Compiler<br…

<p>&nbsp;</p> <pre> <code class="language-java">import java.util.*; public class Main {     static class TreeNode{         String name;   …

<p>I solved it using segment tree on flattened tree. The tutorial says we can also use BIT for range queries. I might be wrong, but I think…

<h1><strong>Solution 3 : minimum cost path</strong></h1> <hr /> <p><strong>Overview :&nbsp;</strong>In this question we have to find the a…