I'm a competitive programmer from Italy. In this channel, I want to share my passion for problem-solving and get better at explaining and communicating solutions effectively.

Some solutions displayed are inspired by the great work of Lee215 and StefanPochmann; I still have a lot to learn.

LeetCode [Medium] Minimize Maximum Pair Sum in Array
2:04
LeetCode [Medium] Minimize Maximum Pair Sum in Array
LeetCode [Medium] Get Biggest Three Rhombus Sums in a Grid
7:31
LeetCode [Medium] Get Biggest Three Rhombus Sums in a Grid
LeetCode [HARD] Minimum XOR Sum of Two Arrays
5:47
LeetCode [HARD] Minimum XOR Sum of Two Arrays
LeetCode [easy] Substrings of Size Three with Distinct Characters
2:47
LeetCode [easy] Substrings of Size Three with Distinct Characters
LeetCode 968. [HARD] Binary Tree Cameras
7:44
LeetCode 968. [HARD] Binary Tree Cameras
LeetCode [Medium] Rotating the Box
3:29
LeetCode [Medium] Rotating the Box
LeetCode 304. [Medium] Range Sum Query 2D - Immutable
11:29
LeetCode 304. [Medium] Range Sum Query 2D - Immutable
LeetCode [Medium] Maximum Element After Decreasing and Rearranging
3:30
LeetCode [Medium] Maximum Element After Decreasing and Rearranging
LeetCode [easy] Replace All Digits with Characters
2:02
LeetCode [easy] Replace All Digits with Characters
LeetCode [Medium] Seat Reservation Manager
2:10
LeetCode [Medium] Seat Reservation Manager
LeetCode Mock Phone Interview Speedrun
7:37
LeetCode Mock Phone Interview Speedrun
LeetCode 1828. [Medium] Queries on Number of Points Inside a Circle
3:04
LeetCode 1828. [Medium] Queries on Number of Points Inside a Circle
When should you stop trying? Codeforces C. Polycarp Restores Permutation
6:58
When should you stop trying? Codeforces C. Polycarp Restores Permutation
LeetCode 936. [HARD] Stamping The Sequence (PROOF of greedy strat)
13:13
LeetCode 936. [HARD] Stamping The Sequence (PROOF of greedy strat)
LeetCode 1808. [HARD] Maximize Number of Nice Divisors
10:15
LeetCode 1808. [HARD] Maximize Number of Nice Divisors
LeetCode 1799. [HARD] Maximize Score After N Operations
7:48
LeetCode 1799. [HARD] Maximize Score After N Operations
LeetCode 823. [Medium] Binary Trees With Factors
4:32
LeetCode 823. [Medium] Binary Trees With Factors
LeetCode 1781. [Medium] Sum of Beauty of All Substrings
4:30
LeetCode 1781. [Medium] Sum of Beauty of All Substrings
LeetCode 1780. [Medium] Check if Number is a Sum of Powers of Three
2:14
LeetCode 1780. [Medium] Check if Number is a Sum of Powers of Three
LeetCode 1779. [easy] Find Nearest Point That Has the Same X or Y Coordinate
1:56
LeetCode 1779. [easy] Find Nearest Point That Has the Same X or Y Coordinate
LeetCode 895. [Hard] Maximum Frequency Stack
6:26
LeetCode 895. [Hard] Maximum Frequency Stack
LeetCode 946. [Medium] Validate Stack Sequences
5:57
LeetCode 946. [Medium] Validate Stack Sequences
LeetCode 1769. [Medium] Minimum Number of Operations to Move All Balls to Each Box
5:06
LeetCode 1769. [Medium] Minimum Number of Operations to Move All Balls to Each Box
LeetCode 1768. [easy] Merge Strings Alternately
2:00
LeetCode 1768. [easy] Merge Strings Alternately
LeetCode [Medium] 1249. Minimum Remove to Make Valid Parentheses
3:41
LeetCode [Medium] 1249. Minimum Remove to Make Valid Parentheses
Easy, Medium and Hard in 30 Minutes (LeetCode Mock Online Assessment)
28:02
Easy, Medium and Hard in 30 Minutes (LeetCode Mock Online Assessment)
LeetCode 1750. [Medium] Minimum Length of String After Deleting Similar Ends
4:12
LeetCode 1750. [Medium] Minimum Length of String After Deleting Similar Ends
LeetCode 1751. [HARD] Maximum Number of Events That Can Be Attended II
9:30
LeetCode 1751. [HARD] Maximum Number of Events That Can Be Attended II
This might just be the easiest Hard LeetCode problem (987. Vertical Order Traversal of a Tree)
6:57
This might just be the easiest Hard LeetCode problem (987. Vertical Order Traversal of a Tree)
LeetCode 1663. [Medium] Smallest String With A Given Numeric Value
7:35
LeetCode 1663. [Medium] Smallest String With A Given Numeric Value