#leetcode Development Tutorials & Tips | Roast Dev

100daysofcode 100daysofdevops 100pay 10mistakes 10yearworkanniversary 11 11labs 11tly 11ty 127001

2302. Count Subarrays With Score Less Than K

2302. Count Subarrays With Score Less Than KDifficulty: HardTopics: Array, Binary Search, Sliding Window, Prefix SumThe score of an array is defined as the product of its sum and its length.⛶For exa...

28.04.2025 0 Read More

LeetCode # 987. Vertical Order Traversal of a Binary Tree

Problem The problem involves taking a binary tree and performing a vertical order traversal. Vertical order traversals have real world applications such as rendering user interfaces,GIS systems and d...

28.04.2025 0 Read More

2962. Count Subarrays Where Max Element Appears at Least K Times

2962. Count Subarrays Where Max Element Appears at Least K TimesDifficulty: MediumTopics: Array, Sliding WindowYou are given an integer array nums and a positive integer k.Return the number of subarra...

29.04.2025 0 Read More

1295. Find Numbers with Even Number of Digits

1295. Find Numbers with Even Number of DigitsDifficulty: EasyTopics: Array, MathGiven an array nums of integers, return how many of them contain an even number of digits.Example 1: Input: nums = [12,...

30.04.2025 0 Read More

Leetcode - 112. Path Sum

🧠 Approach: Recursive DFS To determine if a path from root to leaf equals a target sum, we use depth-first traversal. At each node, we subtract the node’s value from the target sum and r...

30.04.2025 0 Read More

2071. Maximum Number of Tasks You Can Assign

2071. Maximum Number of Tasks You Can AssignDifficulty: HardTopics: Array, Binary Search, Greedy, Queue, Sorting, Monotonic QueueYou have n tasks and m workers. Each task has a strength requirement st...

01.05.2025 0 Read More

838. Push Dominoes

838. Push DominoesDifficulty: MediumTopics: Two Pointers, String, Dynamic ProgrammingThere are n dominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously pu...

01.05.2025 0 Read More

Leetcode - 129. Sum Root to Leaf Numbers

Approach To solve this problem, we can use a Depth-First Search (DFS) strategy to traverse the tree from the root to each leaf node. The main idea is to accumulate the value of the path from ...

02.05.2025 0 Read More

1007. Minimum Domino Rotations For Equal Row

1007. Minimum Domino Rotations For Equal RowDifficulty: MediumTopics: Array, GreedyIn a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino. (A domino is a ti...

03.05.2025 0 Read More