Hi ! I am Shivam Jaiswal a B.Tech student (DTU) , this channel is all about competitive coding where I be adding content such as Solution to coding contests such as Codeforces, Codechef and with full explanation so that a beginner can understand it to, I will highlight what is the main logic or technique you should learn and pick from the discussed question so that it can not only help you solve that question but similar question which apply same techniques as well in future.

This channel generally focus on beginner Coders who are newbie in competitive coding and help them to get a kickstart to their coding journey, I will be discussing all of your doubts regarding coding such as how to start how to improve competitive coding and all, how can you learn free just mention your doubt in discussion on my channel and I will get back to you as soon as possible.

Topological-Sort | Graph Traversal - (Part-4)
18:04
Topological-Sort | Graph Traversal - (Part-4)
Flood-fill algorithm | Graph traversal (Part - 3)
9:53
Flood-fill algorithm | Graph traversal (Part - 3)
Mostly asked in interviews |Graph in matrix
16:29
Mostly asked in interviews |Graph in matrix
BFS - Graph Traversal (Part-2)
11:46
BFS - Graph Traversal (Part-2)
DFS - Graph Traversal (part-1) Detailed Explanation
33:09
DFS - Graph Traversal (part-1) Detailed Explanation
Graph Introduction
15:46
Graph Introduction
Can you solve it ?? Fermat's Theorem | Number theory
11:05
Can you solve it ?? Fermat's Theorem | Number theory
How to code faster with Templates and Macros | What is trace function ?
15:40
How to code faster with Templates and Macros | What is trace function ?
N Queen Problem | Backtracking(part-2)
21:45
N Queen Problem | Backtracking(part-2)
Backtracking ??? OR recursion ? :)
32:19
Backtracking ??? OR recursion ? :)
Intro to codedigger | A complete website for competitive Programming
17:30
Intro to codedigger | A complete website for competitive Programming
Google meet discussion (part -2) | girls meet
31:03
Google meet discussion (part -2) | girls meet
Google meet Doubt discussion (Part 1) | Girls meet
32:55
Google meet Doubt discussion (Part 1) | Girls meet
Google Step Intern | Amazon-Wow | Microsoft Codes | Interview Process and experience
22:48
Google Step Intern | Amazon-Wow | Microsoft Codes | Interview Process and experience
Path to Learn New Topic |CP as Body Building |Constraints It helps| Common CP Doubts Discussion Meet
27:20
Path to Learn New Topic |CP as Body Building |Constraints It helps| Common CP Doubts Discussion Meet
When to see Editorial | UVa Problems are also good to Practice | Common CP Doubts Discussion Meet
16:52
When to see Editorial | UVa Problems are also good to Practice | Common CP Doubts Discussion Meet
Project Tips | Virtual Contest Motivation | Common CP Doubts Discussion Meet
14:21
Project Tips | Virtual Contest Motivation | Common CP Doubts Discussion Meet
Coding and Development Side-by-Side |How to Debug Code |Do CP helps in Interview | Interview Tips
19:55
Coding and Development Side-by-Side |How to Debug Code |Do CP helps in Interview | Interview Tips
Don't be Impatient | Practice and Upsolving Motivation | Common CP Doubts Discussion Meet
20:24
Don't be Impatient | Practice and Upsolving Motivation | Common CP Doubts Discussion Meet
Recursion on matrix | Minimum cost to travel in matrix
20:41
Recursion on matrix | Minimum cost to travel in matrix
Coin change Problem| Maximum number of ways | Recursive approach
21:08
Coin change Problem| Maximum number of ways | Recursive approach
Recursion 2 | Can you hack me ! | Recursion on string
31:30
Recursion 2 | Can you hack me ! | Recursion on string
Subarray with Max Product in min Length | Modular Inverse | Problem E
15:19
Subarray with Max Product in min Length | Modular Inverse | Problem E
Catalan Number with dp | Number of regular bracket sequence for n| Problem D
8:58
Catalan Number with dp | Number of regular bracket sequence for n| Problem D
Balanced Parentheses with a twist without using stack | Problem C
14:07
Balanced Parentheses with a twist without using stack | Problem C
What is modular exponentiation (power in modular arithmetic)| Problem B
11:43
What is modular exponentiation (power in modular arithmetic)| Problem B
How to earn and learn with CP and codealittle | Problem A
6:44
How to earn and learn with CP and codealittle | Problem A
Recursion | Foundation for many topics
33:56
Recursion | Foundation for many topics
Ternary search algorithm | Unimodal functions
32:29
Ternary search algorithm | Unimodal functions
Codeforces round 659 | Video editorial
37:14
Codeforces round 659 | Video editorial