I have been uploading video editorials(B, C and D mostly) for Div-2 and Div-3 rounds. The videos are generally updated within 5/6 hours after the contest ends. This blog will contain all the video links. It will be updated after every contest gets over and the videos are uploaded.

Round 645:

• Problem D — Link

Educational Round:

• Problem D — Link (N log^2 Approach) (Binary Search + Fenwick Trees)

• Problem D — Link (N log N Approach) (Binary Lifting on Fenwick Trees)

Round 643:

• Problem C — Link

Round 642:

• Problem F — Link

• Problem E — Link

• Problem D — Link

Round 641:

• Problem D — Link

• Problem C — Link

• Problem B — Link

Round 638:

• Problem D — Link

• Problem C — Link

• Problem B — Link

Educational Round #86:

• Problem C — Link

Round #637:

• Problem D — Link

Round #636:

• Problem D — Link

Round #635:

• Problem D — Link

• Problem C — Link

Round #633:

• Problem D — Link

If you feel I can improve in any aspect, please drop in your valuable advice below. Please do-not expect me to make editorials on Div2-E or above because I solve it sometime during the contest hours due to the time constraint.

P.S: I never posted this, because I doubted on myself whether I could do it for long or not, on whether people will understand the explanations or not.

Hello everyone! I would like to invite you to participate in AARAMBH. It’s the fourth version of this short contest, that runs for 2:30 hours! The problem set consists of 5 tasks of various difficulties. The contest starts on the 19th of November, 9.30 PM to 20th November 00:00 A.M IST. It is the annual coding contest of Jalpaiguri Government Engineering College which is organized essentially for the starters so that they get a real taste of competitive programming at an early age(I meant their year of study XD).

The contest is based on ACM-ICPC style.

Contest Details:

Time: 19th November 2018 (21:30 hrs) to 20th November 2018 (00:00 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone

Contest link: https://www.codechef.com/AARA2018

Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.

Prizes: Prizes are only for the top performer globally and top 2 performers in the college. You need to fill the form in order to be eligible for prize money before the contest ends.

Good Luck!

Hope to see you participating!!

Happy Coding!!

Given 2 Linked Lists containing single digit as data representing number with most significant digit at head and least significant at the tail return the addition of both.

The solution must not reverse the given linked lists and do it in O(n) time complexity and constant space complexity(Recursive solution will take O(n) space because of stack).

For example:

9 -> 3 -> 2 -> 2 ->

+

3 -> 4 -> 8 -> 3 ->

=

1 -> 2 -> 8 -> 0 -> 5 .

Can anyone help me out ?