#leetcode Development Tutorials & Tips | Roast Dev

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

Leetcode - 92. Reverse Linked List II

Approach Find the leftPrev Node** Create a dummy node to handle edge cases (like when left = 1). Move leftPrev to the node before the left position. Reverse the Sublist Use the standard linke...

03.04.2025 0 Read More

Leetcode - 206. Reverse Linked List

Reversing a linked list is a common problem in coding interviews and data structures. In this blog, we'll discuss the approach, implementation, and time complexity of reversing a singly linked list. ...

03.04.2025 0 Read More

Cracking JavaScript: My Notes from LeetCode’s 30-Day Challenge

I have compiled my notes while working on LeetCode's 30 Days of JavaScript exercises. This study covers key aspects of JavaScript and explains concepts we frequently use but may not fully understand. ...

03.04.2025 0 Read More

1123. Lowest Common Ancestor of Deepest Leaves

1123. Lowest Common Ancestor of Deepest LeavesDifficulty: MediumTopics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary TreeGiven the root of a binary tree, return the lowest common...

03.04.2025 0 Read More

connected components

connected components What Are Connected Components? In graph theory, a connected component is a group of nodes where there is a path between any two nodes in the group, and no path exists fro...

05.04.2025 0 Read More

368. Largest Divisible Subset

368. Largest Divisible SubsetDifficulty: MediumTopics: Array, Math, Dynamic Programming, SortingGiven a set of distinct positive integers nums, return the largest subset answer such that every pair (a...

06.04.2025 0 Read More

416. Partition Equal Subset Sum

416. Partition Equal Subset SumDifficulty: MediumTopics: Array, Dynamic ProgrammingGiven an integer array nums, return true if you can partition the array into two subsets such that the sum of the ele...

07.04.2025 0 Read More

3396. Minimum Number of Operations to Make Elements in Array Distinct

3396. Minimum Number of Operations to Make Elements in Array DistinctDifficulty: EasyTopics: Array, Hash TableYou are given an integer array nums. You need to ensure that the elements in the array are...

08.04.2025 0 Read More

LeetCode problem 3396

In this post, I’ll walk through my two solutions to LeetCode Problem 3396: Minimum Number of Operations to Make Elements in Array Distinct, using pythonic a algorithmic approach. Each method has its...

08.04.2025 0 Read More

Leetcode - 25. Reverse Nodes in k-Group

💡 Approach The idea is to reverse each group of k nodes while maintaining the correct links to the rest of the list.Here’s the plan: Use a dummy node before the head to simplify edge cas...

08.04.2025 0 Read More

Leetcode - 92. Reverse Linked List II

Leetcode - 206. Reverse Linked List

Cracking JavaScript: My Notes from LeetCode’s 30-Day Challenge

1123. Lowest Common Ancestor of Deepest Leaves

connected components

368. Largest Divisible Subset

416. Partition Equal Subset Sum

3396. Minimum Number of Operations to Make Elements in Array Distinct

LeetCode problem 3396

Leetcode - 25. Reverse Nodes in k-Group

#reading

#popular