#leetcode Development Tutorials & Tips | Roast Dev

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

Leetcode - 146. LRU Cache

🔁 Building an LRU Cache in JavaScript (The Right Way) Imagine you're building a browser, an in-memory database, or any service where you want to store recently accessed items and automatic...

14.04.2025 0 Read More

1534. Count Good TripletsDifficulty: EasyTopics: Array, EnumerationGiven an array of integers arr, and three integers a, b and c. You need to find the number of good triplets.A triplet (arr[i], arr[j]...

14.04.2025 0 Read More

I Built a Free Tracker to Filter Leetcode Questions by Company

I built this to make DSA prep less overwhelming, especially when targeting companies.link → https://dsaprep.dev...

14.04.2025 0 Read More

2179. Count Good Triplets in an Array

2179. Count Good Triplets in an ArrayDifficulty: HardTopics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered SetYou are given two 0-indexed arrays nums...

15.04.2025 0 Read More

2537. Count the Number of Good Subarrays

2537. Count the Number of Good SubarraysDifficulty: MediumTopics: Array, Hash Table, Sliding WindowGiven an integer array nums and an integer k, return the number of good subarrays of nums.A subarray ...

16.04.2025 0 Read More

2176. Count Equal and Divisible Pairs in an Array

2176. Count Equal and Divisible Pairs in an ArrayDifficulty: EasyTopics: ArrayGiven a 0-indexed integer array nums of length n and an integer k, return the number of pairs (i, j) where 0 <= i < ...

17.04.2025 0 Read More

🔥 Kadane's Algorithm — The Power of Maximum Subarrays

*Used in Amazon, Google, Microsoft Interviews 🚀 *Hey devs 👋 If you’ve ever struggled with finding the maximum sum of a subarray, this is the trick you were probably missing: Kadane’s Algorit...

17.04.2025 0 Read More

Leetcode - 104. Maximum Depth of Binary Tree

Finding the maximum depth (or height) of a binary tree is one of the most classic problems in tree data structures. In this post, we’ll explore three powerful approaches: ✅ Recursive DFS ✅ Iter...

17.04.2025 0 Read More

38. Count and Say

38. Count and SayDifficulty: MediumTopics: StringThe count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = "1" countAndSay(n) is the run-length enco...

18.04.2025 0 Read More

Copy Linked List with random pointer

Problemtc :O(n) where n is no. of nodes in the original linked list Iterative approach: ⛶/* // Definition for a Node. class Node { int val; Node next; Node random; public Node(int v...

18.04.2025 0 Read More

Leetcode - 146. LRU Cache

1534. Count Good Triplets

I Built a Free Tracker to Filter Leetcode Questions by Company

2179. Count Good Triplets in an Array

2537. Count the Number of Good Subarrays

2176. Count Equal and Divisible Pairs in an Array

🔥 Kadane's Algorithm — The Power of Maximum Subarrays

Leetcode - 104. Maximum Depth of Binary Tree

38. Count and Say

Copy Linked List with random pointer

#reading

#popular