#leetcode Development Tutorials & Tips | Roast Dev

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

Understanding Leetcode #15 3Sum

Leetcode # 15. 3Sum provides an unsorted list of integers and asks that you find all unique triplets from that list that add to a target number, in this case zero (0). A brute force approach would be ...

19.04.2025 0 Read More

Leetcode - 100. Same Tree

The “Same Tree” problem is a classic interview question that tests your understanding of tree traversal. It asks: Given two binary trees, check if they are structurally identical and node values a...

19.04.2025 0 Read More

Leetcode - 226. Invert Binary Tree

One of the most elegant problems in tree manipulation is inverting a binary tree — essentially flipping it along its vertical axis. It's a simple yet beautiful example of recursion and tree traversa...

19.04.2025 0 Read More

781. Rabbits in Forest

781. Rabbits in ForestDifficulty: MediumTopics: Array, Hash Table, Math, GreedyThere is a forest with an unknown number of rabbits. We asked n rabbits "How many rabbits have the same color as you?" an...

20.04.2025 0 Read More

Leetcode - 101. Symmetric Tree

Checking if a binary tree is symmetric is a classic recursive problem in data structures. In this post, let’s break it down into simple steps, understand the thought process, and see how recursion m...

21.04.2025 0 Read More

2145. Count the Hidden Sequences

2145. Count the Hidden SequencesDifficulty: MediumTopics: Array, Prefix SumYou are given a 0-indexed array of n integers differences, which describes the differences between each pair of consecutive i...

21.04.2025 0 Read More

Leetcode - 105. Construct Binary Tree from Preorder and Inorder Traversal

Constructing a binary tree from preorder and inorder traversal is a classic problem that teaches recursion, tree structures, and performance optimization. Let’s explore two different approaches to s...

22.04.2025 0 Read More

2338. Count the Number of Ideal Arrays

2338. Count the Number of Ideal ArraysDifficulty: HardTopics: Math, Dynamic Programming, Combinatorics, Number TheoryYou are given two integers n and maxValue, which are used to describe an ideal arra...

22.04.2025 0 Read More

1399. Count Largest Group

1399. Count Largest GroupDifficulty: EasyTopics: Hash Table, MathYou are given an integer n.Each number from 1 to n is grouped according to the sum of its digits.Return the number of groups that have ...

23.04.2025 0 Read More

1128. Number of Equivalent Domino Pairs

1128. Number of Equivalent Domino PairsDifficulty: EasyTopics: Array, Hash Table, CountingGiven a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a ...

04.05.2025 0 Read More

Understanding Leetcode #15 3Sum

Leetcode - 100. Same Tree

Leetcode - 226. Invert Binary Tree

781. Rabbits in Forest

Leetcode - 101. Symmetric Tree

2145. Count the Hidden Sequences

Leetcode - 105. Construct Binary Tree from Preorder and Inorder Traversal

2338. Count the Number of Ideal Arrays

1399. Count Largest Group

1128. Number of Equivalent Domino Pairs

#reading

#popular