Codeforces Round 1036 ( Div-1 + Div-2 ) | A-D Problems Solved & Explained !!!
Welcome to the editorial of Codeforces Round 1036 ( Div-1 + Div-2 )!
In this video, we have discussed the strategies, ideas, and underlying concept that requires you to solve these problems. Moreover, these ideas will enhance your problem-solving skills in general and the chances of you solving the problems next time on your own will be increased.
If you liked any part of this video you can show your gratitude by liking the video and dont forget to subscribe my channel.
Happy coding !!
Timestamps:-
00:00 Intro
00:09 Deranged Deletions
06:01 Minimise Sum
13:58 Subset Multiplication
27:30 Make a Palindrome
Hashtags: (ignore them)
#shivamgupta #dsa #competitiveProgramming #codeforcessolutions #codeforces #leetcode #leetcodecontest #codeforcesRound1036 #codeforcestodayscontest #codeforcesround
Видео Codeforces Round 1036 ( Div-1 + Div-2 ) | A-D Problems Solved & Explained !!! канала Shivam Gupta
In this video, we have discussed the strategies, ideas, and underlying concept that requires you to solve these problems. Moreover, these ideas will enhance your problem-solving skills in general and the chances of you solving the problems next time on your own will be increased.
If you liked any part of this video you can show your gratitude by liking the video and dont forget to subscribe my channel.
Happy coding !!
Timestamps:-
00:00 Intro
00:09 Deranged Deletions
06:01 Minimise Sum
13:58 Subset Multiplication
27:30 Make a Palindrome
Hashtags: (ignore them)
#shivamgupta #dsa #competitiveProgramming #codeforcessolutions #codeforces #leetcode #leetcodecontest #codeforcesRound1036 #codeforcestodayscontest #codeforcesround
Видео Codeforces Round 1036 ( Div-1 + Div-2 ) | A-D Problems Solved & Explained !!! канала Shivam Gupta
Комментарии отсутствуют
Информация о видео
7 июля 2025 г. 19:15:51
00:39:17
Другие видео канала
Find the Number of Subarrays Where Boundary Elements Are Maximum | Leetcode Biweekly Contest - 128
Codechef Starter - 189 | A-E Explained
Leetcode Weekly - 452 | A - D Explained ✅
Leetcode Weekly - 449 | A - D Explained ✅
Closest Neighbour in BST | Find Lower_bound and Upper_bound in a sorted array
Codeforces Round 1006 (Div. 3) | A-D Problems Solved & Explained !!!
Leetcode Weekly Contest- 391 | Rank- 137 | Editorial for problem A-D
Leetcode Biweekly Contest - 151 | A-C explained
Find All Duplicates in an Array | Leetcode - 442 | Interview Problem
Codeforces Round 1014 (Div-2) | A-D Problems Solved & Explained !!!
Count Subarrays with given XOR | GFG POTD
Longest Common Subsequence | GFG POTD
Educational Codeforces Round 180 (Div-2) | A-D Problems Solved & Explained !!!
Euler Circuit in an Undirected Graph | GFG POTD
Educational Codeforces Round 175 (Div-2) | A-D Problems Solved & Explained !!!
Minimize the Difference | GFG POTD | Prefix max/min
Palindromic Substrings (GPL) Solution with detailed explanation (Codechef Starters 129)| Game Theory
Power of Two | Leetcode 231 | Interview problem ( 6 approaches )
Maximum Width Ramp | Leetcode - 962
Codeforces Educational Round 164 (Div. 2) | A-C Problems Solved & Explained !!!
Ways to Reach the n'th Stair | GFG POTD | Climbing Stairs
