Канал: Francesco Manicardi

LeetCode [Medium] Get Biggest Three Rhombus Sums in a Grid

LeetCode [Medium] Get Biggest Three Rhombus Sums in a Grid

LeetCode [Medium] Minimize Maximum Pair Sum in Array

LeetCode [Medium] Minimize Maximum Pair Sum in Array

LeetCode [HARD] Minimum XOR Sum of Two Arrays

LeetCode [HARD] Minimum XOR Sum of Two Arrays

LeetCode [easy] Substrings of Size Three with Distinct Characters

LeetCode [easy] Substrings of Size Three with Distinct Characters

LeetCode 968. [HARD] Binary Tree Cameras

LeetCode 968. [HARD] Binary Tree Cameras

LeetCode [Medium] Rotating the Box

LeetCode [Medium] Rotating the Box

LeetCode 304. [Medium] Range Sum Query 2D - Immutable

LeetCode 304. [Medium] Range Sum Query 2D - Immutable

LeetCode [Medium] Maximum Element After Decreasing and Rearranging

LeetCode [Medium] Maximum Element After Decreasing and Rearranging

LeetCode [easy] Replace All Digits with Characters

LeetCode [easy] Replace All Digits with Characters

LeetCode [Medium] Seat Reservation Manager

LeetCode [Medium] Seat Reservation Manager

LeetCode Mock Phone Interview Speedrun

LeetCode Mock Phone Interview Speedrun

LeetCode 1828. [Medium] Queries on Number of Points Inside a Circle

LeetCode 1828. [Medium] Queries on Number of Points Inside a Circle

When should you stop trying? Codeforces C. Polycarp Restores Permutation

When should you stop trying? Codeforces C. Polycarp Restores Permutation

LeetCode 936. [HARD] Stamping The Sequence (PROOF of greedy strat)

LeetCode 936. [HARD] Stamping The Sequence (PROOF of greedy strat)

LeetCode 1808. [HARD] Maximize Number of Nice Divisors

LeetCode 1808. [HARD] Maximize Number of Nice Divisors

LeetCode 1799. [HARD] Maximize Score After N Operations

LeetCode 1799. [HARD] Maximize Score After N Operations

LeetCode 823. [Medium] Binary Trees With Factors

LeetCode 823. [Medium] Binary Trees With Factors

LeetCode 1781. [Medium] Sum of Beauty of All Substrings

LeetCode 1781. [Medium] Sum of Beauty of All Substrings

LeetCode 1780. [Medium] Check if Number is a Sum of Powers of Three

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

LeetCode 1779. [easy] Find Nearest Point That Has the Same X or Y Coordinate

LeetCode 895. [Hard] Maximum Frequency Stack

LeetCode 895. [Hard] Maximum Frequency Stack

LeetCode 946. [Medium] Validate Stack Sequences

LeetCode 946. [Medium] Validate Stack Sequences

LeetCode 1769. [Medium] Minimum Number of Operations to Move All Balls to Each Box

LeetCode 1769. [Medium] Minimum Number of Operations to Move All Balls to Each Box

LeetCode 1768. [easy] Merge Strings Alternately

LeetCode 1768. [easy] Merge Strings Alternately

LeetCode [Medium] 1249. Minimum Remove to Make Valid Parentheses

LeetCode [Medium] 1249. Minimum Remove to Make Valid Parentheses

Easy, Medium and Hard in 30 Minutes (LeetCode Mock Online Assessment)

Easy, Medium and Hard in 30 Minutes (LeetCode Mock Online Assessment)

LeetCode 1750. [Medium] Minimum Length of String After Deleting Similar Ends

LeetCode 1750. [Medium] Minimum Length of String After Deleting Similar Ends

LeetCode 1751. [HARD] Maximum Number of Events That Can Be Attended II

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)

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

LeetCode 1663. [Medium] Smallest String With A Given Numeric Value

LeetCode 1673. [Medium] Find the Most Competitive Subsequence

LeetCode 1673. [Medium] Find the Most Competitive Subsequence

LeetCode 1725. [easy] Number Of Rectangles That Can Form The Largest Square

LeetCode 1725. [easy] Number Of Rectangles That Can Form The Largest Square

LeetCode 1658. [Medium] Minimum Operations to Reduce X to Zero

LeetCode 1658. [Medium] Minimum Operations to Reduce X to Zero

LeetCode 1717. [Medium] Maximum Score From Removing Substrings

LeetCode 1717. [Medium] Maximum Score From Removing Substrings

LeetCode 1649. [HARD] Create Sorted Array through Instructions

LeetCode 1649. [HARD] Create Sorted Array through Instructions

LeetCode 1701. [Medium] Average Waiting Time

LeetCode 1701. [Medium] Average Waiting Time

LeetCode 1704. [easy] Determine if String Halves Are Alike

LeetCode 1704. [easy] Determine if String Halves Are Alike

LeetCode 1640. [easy] Check Array Formation Through Concatenation

LeetCode 1640. [easy] Check Array Formation Through Concatenation

LeetCode 1345. [HARD] Jump Game IV

LeetCode 1345. [HARD] Jump Game IV

LeetCode 24. [Medium] Swap Nodes in Pairs

LeetCode 24. [Medium] Swap Nodes in Pairs

LeetCode 1463. [HARD] Cherry Pickup II

LeetCode 1463. [HARD] Cherry Pickup II

LeetCode 1685. [Medium] Sum of Absolute Differences in a Sorted Array

LeetCode 1685. [Medium] Sum of Absolute Differences in a Sorted Array

LeetCode 1684. [easy] Count the Number of Consistent Strings

LeetCode 1684. [easy] Count the Number of Consistent Strings

LeetCode 865. [Medium] Smallest Subtree with all the Deepest Nodes

LeetCode 865. [Medium] Smallest Subtree with all the Deepest Nodes

LeetCode 173. [Medium] Binary Search Tree Iterator W/ Followup

LeetCode 173. [Medium] Binary Search Tree Iterator W/ Followup

LeetCode 605. [easy] Can Place Flowers

LeetCode 605. [easy] Can Place Flowers

LeetCode 897. [easy] Increasing Order Search Tree

LeetCode 897. [easy] Increasing Order Search Tree

LeetCode 1492. [Medium] The kth Factor of n

LeetCode 1492. [Medium] The kth Factor of n

LeetCode 1671. [HARD] Minimum Number of Removals to Make Mountain Array

LeetCode 1671. [HARD] Minimum Number of Removals to Make Mountain Array

LeetCode 416. [Medium] Partition Equal Subset Sum | To Take or Not To Take Technique for DP

LeetCode 416. [Medium] Partition Equal Subset Sum | To Take or Not To Take Technique for DP

LeetCode 804. [easy] Unique Morse Code Words

LeetCode 804. [easy] Unique Morse Code Words

LeetCode 902. [HARD] Numbers At Most N Given Digit Set

LeetCode 902. [HARD] Numbers At Most N Given Digit Set

LeetCode 81. [Medium] Search in Rotated Sorted Array II

LeetCode 81. [Medium] Search in Rotated Sorted Array II

LeetCode 1658. [Medium] Minimum Operations to Reduce X to Zero

LeetCode 1658. [Medium] Minimum Operations to Reduce X to Zero

LeetCode 56. [Medium] Merge Intervals

LeetCode 56. [Medium] Merge Intervals

LeetCode 1652. [easy] Defuse the Bomb

LeetCode 1652. [easy] Defuse the Bomb

LeetCode 55. [Medium] Jump Game

LeetCode 55. [Medium] Jump Game

LeetCode 1026. [Medium] Maximum Difference Between Node and Ancestor

LeetCode 1026. [Medium] Maximum Difference Between Node and Ancestor

LeetCode 1283. [Medium] Find the Smallest Divisor Given a Threshold

LeetCode 1283. [Medium] Find the Smallest Divisor Given a Threshold

LeetCode 445. [Medium] Add Two Numbers II W/ Follow Up

LeetCode 445. [Medium] Add Two Numbers II W/ Follow Up

LeetCode 310. [Medium] Minimum Height Trees

LeetCode 310. [Medium] Minimum Height Trees

LeetCode 1290. [easy] Convert Binary Number in a Linked List to Integer

LeetCode 1290. [easy] Convert Binary Number in a Linked List to Integer

LeetCode 99. [HARD] Recover Binary Search Tree

LeetCode 99. [HARD] Recover Binary Search Tree

LeetCode 228. [easy] Summary Ranges

LeetCode 228. [easy] Summary Ranges

LeetCode 1510. [HARD] Stone Game IV

LeetCode 1510. [HARD] Stone Game IV

LeetCode 735. [Medium] Asteroid Collision

LeetCode 735. [Medium] Asteroid Collision

Google Singapore Intern Online Assessment - My Experience

Google Singapore Intern Online Assessment - My Experience

LeetCode 704. [easy] Binary Search (Universal Template)

LeetCode 704. [easy] Binary Search (Universal Template)

LeetCode 1605. [Medium] Find Valid Matrix Given Row and Column Sums

LeetCode 1605. [Medium] Find Valid Matrix Given Row and Column Sums

LeetCode 61. [Medium] Rotate List

LeetCode 61. [Medium] Rotate List

LeetCode 701. [Medium] Insert into a Binary Search Tree

LeetCode 701. [Medium] Insert into a Binary Search Tree

LeetCode 1604. [Medium] Alert Using Same Key-Card Three or More Times in a One Hour Period

LeetCode 1604. [Medium] Alert Using Same Key-Card Three or More Times in a One Hour Period

LeetCode 1603. [easy] Design Parking System

LeetCode 1603. [easy] Design Parking System

LeetCode 1288. [Medium] Remove Covered Intervals

LeetCode 1288. [Medium] Remove Covered Intervals

LeetCode 532. [Medium] K-diff Pairs in an Array

LeetCode 532. [Medium] K-diff Pairs in an Array

LeetCode 1356. [easy] Sort Integers by The Number of 1 Bits

LeetCode 1356. [easy] Sort Integers by The Number of 1 Bits

Leetcode 933. [easy] Number of Recent Calls

Leetcode 933. [easy] Number of Recent Calls

LeetCode 139. [Medium] Word Break

LeetCode 139. [Medium] Word Break

LeetCode 41. [HARD] First Missing Positive (w/ followup)

LeetCode 41. [HARD] First Missing Positive (w/ followup)

LeetCode 399. [Medium] Evaluate Division

LeetCode 399. [Medium] Evaluate Division

LeetCode 54. [Medium] Spiral Matrix

LeetCode 54. [Medium] Spiral Matrix

LeetCode 268. [easy] Missing Number

LeetCode 268. [easy] Missing Number

LeetCode 389. [easy] Find the Difference

LeetCode 389. [easy] Find the Difference

LeetCode 136. [easy] Single Number

LeetCode 136. [easy] Single Number

LeetCode 1094. [Medium] Car Pooling

LeetCode 1094. [Medium] Car Pooling

LeetCode 1592. [easy] Rearrange Spaces Between Words

LeetCode 1592. [easy] Rearrange Spaces Between Words

Leetcode 1589. [Medium] Maximum Sum Obtained of Any Permutation

Leetcode 1589. [Medium] Maximum Sum Obtained of Any Permutation

LeetCode 1588. [easy] Sum of All Odd Length Subarrays

LeetCode 1588. [easy] Sum of All Odd Length Subarrays

LeetCode 980. [HARD] Unique Paths III

LeetCode 980. [HARD] Unique Paths III

LeetCode 121. [easy] Best Time to Buy and Sell Stock

LeetCode 121. [easy] Best Time to Buy and Sell Stock

Leetcode 165. [Medium] Compare Version Numbers

Leetcode 165. [Medium] Compare Version Numbers

LeetCode 1041. [Medium] Robot Bounded In Circle

LeetCode 1041. [Medium] Robot Bounded In Circle

LeetCode [easy] 1582. Special Positions in a Binary Matrix

LeetCode [easy] 1582. Special Positions in a Binary Matrix

LeetCode 4. [HARD] Median of Two Sorted Arrays

LeetCode 4. [HARD] Median of Two Sorted Arrays

LeetCode 216. Combination Sum III

LeetCode 216. Combination Sum III

LeetCode 3. [Medium] Longest Substring Without Repeating Characters

LeetCode 3. [Medium] Longest Substring Without Repeating Characters

LeetCode 2. [Medium] Add Two Numbers

LeetCode 2. [Medium] Add Two Numbers

LeetCode 1208. [Medium] Get Equal Substrings Within Budget

LeetCode 1208. [Medium] Get Equal Substrings Within Budget

LeetCode 1022. [easy] Sum of Root To Leaf Binary Numbers

LeetCode 1022. [easy] Sum of Root To Leaf Binary Numbers

LeetCode 241. [Medium] Different Ways to Add Parentheses

LeetCode 241. [Medium] Different Ways to Add Parentheses

LeetCode 930. [Medium] Binary Subarrays With Sum

LeetCode 930. [Medium] Binary Subarrays With Sum

LeetCode 290. [easy] Word Pattern

LeetCode 290. [easy] Word Pattern

LeetCode 1305. [Medium] All Elements in Two Binary Search Trees

LeetCode 1305. [Medium] All Elements in Two Binary Search Trees

LeetCode 343. [Medium] Integer Break

LeetCode 343. [Medium] Integer Break

LeetCode 835. [Medium] Image Overlap

LeetCode 835. [Medium] Image Overlap

LeetCode 1. [easy] Two Sum

LeetCode 1. [easy] Two Sum

LeetCode 763. [Medium] Partition Labels

LeetCode 763. [Medium] Partition Labels

LeetCode 128. [HARD] Longest Consecutive Sequence

LeetCode 128. [HARD] Longest Consecutive Sequence

LeetCode 984. [Medium] String Without AAA or BBB

LeetCode 984. [Medium] String Without AAA or BBB

LeetCode 785. [Medium] Is Graph Bipartite?

LeetCode 785. [Medium] Is Graph Bipartite?

LeetCode 1472. [Medium] Design Browser History

LeetCode 1472. [Medium] Design Browser History

LeetCode 954. [Medium] Array of Doubled Pairs

LeetCode 954. [Medium] Array of Doubled Pairs

LeetCode 1568. [Medium] Minimum Number of Days to Disconnect Island

LeetCode 1568. [Medium] Minimum Number of Days to Disconnect Island

LeetCode 1567. [Medium] Maximum Length of Subarray With Positive Product

LeetCode 1567. [Medium] Maximum Length of Subarray With Positive Product

LeetCode 1566. [easy] Detect Pattern of Length M Repeated K or More Times

LeetCode 1566. [easy] Detect Pattern of Length M Repeated K or More Times

LeetCode 452. [Medium] Minimum Number of Arrows to Burst Balloons

LeetCode 452. [Medium] Minimum Number of Arrows to Burst Balloons

LeetCode 1423. [Medium] Maximum Points You Can Obtain from Cards

LeetCode 1423. [Medium] Maximum Points You Can Obtain from Cards

LeetCode 328. [Medium] Odd Even Linked List

LeetCode 328. [Medium] Odd Even Linked List

LeetCode 45. [HARD] Jump Game II

LeetCode 45. [HARD] Jump Game II

LeetCode 236. [Medium] Lowest Common Ancestor of a Binary Tree

LeetCode 236. [Medium] Lowest Common Ancestor of a Binary Tree

LeetCode 151. [Medium] Reverse Words in a String

LeetCode 151. [Medium] Reverse Words in a String

LeetCode 1296. [Medium] Divide Array in Sets of K Consecutive Numbers

LeetCode 1296. [Medium] Divide Array in Sets of K Consecutive Numbers

LeetCode 388. [Medium] Longest Absolute File Path

LeetCode 388. [Medium] Longest Absolute File Path

LeetCode 80. [Medium] Remove Duplicates from Sorted Array II

LeetCode 80. [Medium] Remove Duplicates from Sorted Array II

LeetCode 1559. [HARD] Detect Cycles in 2D Grid

LeetCode 1559. [HARD] Detect Cycles in 2D Grid

LeetCode 1557. [Medium] Minimum Number of Vertices to Reach All Nodes

LeetCode 1557. [Medium] Minimum Number of Vertices to Reach All Nodes

LeetCode 1556. [easy] Thousand Separator

LeetCode 1556. [easy] Thousand Separator

LeetCode 200. [Medium] Number of Islands

LeetCode 200. [Medium] Number of Islands

LeetCode 103. [Medium] Binary Tree Zigzag Level Order Traversal

LeetCode 103. [Medium] Binary Tree Zigzag Level Order Traversal

LeetCode 329. [HARD] Longest Increasing Path in a Matrix

LeetCode 329. [HARD] Longest Increasing Path in a Matrix

LeetCode 78. [Medium] All Possible Subsets

LeetCode 78. [Medium] All Possible Subsets

LeetCode 117. [Medium with HARD followup] Populating Next Right Pointers in Each Node II

LeetCode 117. [Medium with HARD followup] Populating Next Right Pointers in Each Node II

LeetCode 1095. [HARD] Find in Mountain Array

LeetCode 1095. [HARD] Find in Mountain Array

LeetCode 1552. [Medium] Magnetic Force Between Two Balls - Powerful Binary Search Template!

LeetCode 1552. [Medium] Magnetic Force Between Two Balls - Powerful Binary Search Template!

LeetCode 967. [Medium] Numbers With Same Consecutive Differences

LeetCode 967. [Medium] Numbers With Same Consecutive Differences

LeetCode 124. [HARD] Binary Tree Maximum Path Sum Video Explaination

LeetCode 124. [HARD] Binary Tree Maximum Path Sum Video Explaination

Live stream di Francesco Manicardi

Live stream di Francesco Manicardi