Media Summary: In this video, I walk through the solution to problem A from I tried , I need to think more before I code couldn't solve B , It was easy ! the tc where my solution would fail : 3 1 In this video we are going to solve this problem using unordered map with the help of greedy technique. Split sort

Codeforces Pinely Round 2 Screencast - Detailed Analysis & Overview

In this video, I walk through the solution to problem A from I tried , I need to think more before I code couldn't solve B , It was easy ! the tc where my solution would fail : 3 1 In this video we are going to solve this problem using unordered map with the help of greedy technique. Split sort I have a new community Discord server! Join here: My

Photo Gallery

Codeforces Pinely Round 2 screencast
Codeforces | Pinely Round 5 (Div. 1 + Div. 2) | Teja - Smart | Rated Screen Cast
Codeforces Pinely Round 5 (Div. 1 + Div. 2) | Video Solutions - A to C | by Suvrat | TLE Eliminators
A. Channel | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution
Channel | Codeforces 1863A Solution | Pinely Round 2 (Div. 1 + Div. 2) | English
C. MEX Repetition | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution
CF Round 657 (Div2) Screencast + Solutions
Pinely Round 1 (Div. 1 + Div. 2) screencast
B. Split Sort | Codeforces 1863 Pinely Round 2 (Div 1 + Div 2)  | Map + Greedy |  C++ solution
Screencast of Codeforces Round #701 (Div. 2): 3rd place
Pinely Round 2
B. Split Sort || Pinely Round 2 (Div. 1 + Div. 2) || CodeForces
View Detailed Profile
Codeforces Pinely Round 2 screencast

Codeforces Pinely Round 2 screencast

Codeforces Pinely Round 2 screencast

Codeforces | Pinely Round 5 (Div. 1 + Div. 2) | Teja - Smart | Rated Screen Cast

Codeforces | Pinely Round 5 (Div. 1 + Div. 2) | Teja - Smart | Rated Screen Cast

00:00 Problem A -

Codeforces Pinely Round 5 (Div. 1 + Div. 2) | Video Solutions - A to C | by Suvrat | TLE Eliminators

Codeforces Pinely Round 5 (Div. 1 + Div. 2) | Video Solutions - A to C | by Suvrat | TLE Eliminators

Join us live for

A. Channel | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution

A. Channel | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution

A. #channel #

Channel | Codeforces 1863A Solution | Pinely Round 2 (Div. 1 + Div. 2) | English

Channel | Codeforces 1863A Solution | Pinely Round 2 (Div. 1 + Div. 2) | English

In this video, I walk through the solution to problem A from

C. MEX Repetition | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution

C. MEX Repetition | Pinely Round 2 (Div. 1 + Div. 2) | Codeforces | Full solution

C. #mex #repetition #A. #channel #

CF Round 657 (Div2) Screencast + Solutions

CF Round 657 (Div2) Screencast + Solutions

My

Pinely Round 1 (Div. 1 + Div. 2) screencast

Pinely Round 1 (Div. 1 + Div. 2) screencast

I tried , I need to think more before I code couldn't solve B , It was easy ! the tc where my solution would fail : 3 1

B. Split Sort | Codeforces 1863 Pinely Round 2 (Div 1 + Div 2)  | Map + Greedy |  C++ solution

B. Split Sort | Codeforces 1863 Pinely Round 2 (Div 1 + Div 2) | Map + Greedy | C++ solution

In this video we are going to solve this problem using unordered map with the help of greedy technique. Split sort

Screencast of Codeforces Round #701 (Div. 2): 3rd place

Screencast of Codeforces Round #701 (Div. 2): 3rd place

I have a new community Discord server! Join here: https://discord.gg/k5aNFDvQXB My

Pinely Round 2

Pinely Round 2

https://

B. Split Sort || Pinely Round 2 (Div. 1 + Div. 2) || CodeForces

B. Split Sort || Pinely Round 2 (Div. 1 + Div. 2) || CodeForces

CodeForces

Codeforces Round 932 (Div. 2) Screencast | A and B Solution

Codeforces Round 932 (Div. 2) Screencast | A and B Solution

Contest Link: https://