Канал: Leet's Code

3335. Total Characters in String After Transformations I | Math | Frequency Map | LeetCode | Medium

3335. Total Characters in String After Transformations I | Math | Frequency Map | LeetCode | Medium

3332. Maximum Points Tourist Can Earn | Recursion | Memoization | LeetCode | Medium | DP

3332. Maximum Points Tourist Can Earn | Recursion | Memoization | LeetCode | Medium | DP

3331. Find Subtree Sizes After Changes | Tree | DFS | LeetCode | Medium | Biweekly Contest 142

3331. Find Subtree Sizes After Changes | Tree | DFS | LeetCode | Medium | Biweekly Contest 142

1233. Remove Sub-Folders from the Filesystem | String | Sorting | LeetCode | Medium

1233. Remove Sub-Folders from the Filesystem | String | Sorting | LeetCode | Medium

951. Flip Equivalent Binary Trees | Tree | Binary Tree | DFS | Recursion | O(N) | LeetCode | Medium

951. Flip Equivalent Binary Trees | Tree | Binary Tree | DFS | Recursion | O(N) | LeetCode | Medium

2641. Cousins in Binary Tree II | Tree | BFS | Binary Tree | O(N) | LeetCode | Medium

2641. Cousins in Binary Tree II | Tree | BFS | Binary Tree | O(N) | LeetCode | Medium

American Express | Honeywell | ZS | NTT Data | Apply | Off Campus | CS | IT | EE | Batch 2025 2024

American Express | Honeywell | ZS | NTT Data | Apply | Off Campus | CS | IT | EE | Batch 2025 2024

2583. Kth Largest Sum in a Binary Tree | Queue | Sorting | O(N) | LeetCode | Medium | Binary Tree

2583. Kth Largest Sum in a Binary Tree | Queue | Sorting | O(N) | LeetCode | Medium | Binary Tree

1106. Parsing A Boolean Expression l Recursion l LeetCode l Hard

1106. Parsing A Boolean Expression l Recursion l LeetCode l Hard

670. Maximum Swap l Greedy l Math l LeetCode l Medium

670. Maximum Swap l Greedy l Math l LeetCode l Medium

1405. Longest Happy String l Priority Queue l Greedy l String l LeetCode l Medium

1405. Longest Happy String l Priority Queue l Greedy l String l LeetCode l Medium

2938. Separate Black and White Balls l Two Pointer l Greedy l LeetCode l Medium

2938. Separate Black and White Balls l Two Pointer l Greedy l LeetCode l Medium

2530. Maximal Score After Applying K Operations l Priority Queue l Heap l LeetCode l Medium

2530. Maximal Score After Applying K Operations l Priority Queue l Heap l LeetCode l Medium

632. Smallest Range Covering Elements from K Lists l Priority Queue l Sliding Window l LeetCode

632. Smallest Range Covering Elements from K Lists l Priority Queue l Sliding Window l LeetCode

2406. Divide Intervals Into Minimum Number of Groups | Sorting | LeetCode | Medium

2406. Divide Intervals Into Minimum Number of Groups | Sorting | LeetCode | Medium

962. Maximum Width Ramp | Stack | LeetCode | Medium | Monotonic Stack | O(n)

962. Maximum Width Ramp | Stack | LeetCode | Medium | Monotonic Stack | O(n)

921. Minimum Add to Make Parentheses Valid | Stack | LeetCode | Medium | Greedy | String

921. Minimum Add to Make Parentheses Valid | Stack | LeetCode | Medium | Greedy | String

1963. Minimum Number of Swaps to Make the String Balanced | Stack | Leetcode | O(n) | Greedy

1963. Minimum Number of Swaps to Make the String Balanced | Stack | Leetcode | O(n) | Greedy

2696. Minimum String Length After Removing Substrings | Stack | Easy | LeetCode

2696. Minimum String Length After Removing Substrings | Stack | Easy | LeetCode

1813. Sentence Similarity III | Two Pointers | Deque | Medium | LeetCode | String

1813. Sentence Similarity III | Two Pointers | Deque | Medium | LeetCode | String

567. Permutation in String | Permutation | Map | Sliding Window | LeetCode | Medium

567. Permutation in String | Permutation | Map | Sliding Window | LeetCode | Medium

2491. Divide Players Into Teams of Equal Skill | Map | Math | LeetCode | Medium

2491. Divide Players Into Teams of Equal Skill | Map | Math | LeetCode | Medium

1331. Rank Transform of an Array | Set | Map | Sorting | LeetCode | Easy

1331. Rank Transform of an Array | Set | Map | Sorting | LeetCode | Easy

1381. Design a Stack With Increment Operation | LeetCode | Medium | Stack | Vector

1381. Design a Stack With Increment Operation | LeetCode | Medium | Stack | Vector

Total count | GeeksforGeeks | Math | Ceiling | Easy | O(n)

Total count | GeeksforGeeks | Math | Ceiling | Easy | O(n)

432. All O`one Data Structure | Design | hash Map | Hash Set | Hard | O(1) | LeetCode

432. All O`one Data Structure | Design | hash Map | Hash Set | Hard | O(1) | LeetCode

1581. Customer Who Visited but Did Not Make Any Transactions | MySQL | LeetCode | SQL 50

1581. Customer Who Visited but Did Not Make Any Transactions | MySQL | LeetCode | SQL 50

2416. Sum of Prefix Scores of Strings | Hash Map | Trie | Hard | LeetCode | String

2416. Sum of Prefix Scores of Strings | Hash Map | Trie | Hard | LeetCode | String

3043. Find the Length of the Longest Common Prefix | Brute Force | Trie Solution | Hash Table

3043. Find the Length of the Longest Common Prefix | Brute Force | Trie Solution | Hash Table

2707. Extra Characters in a String | Recursion | Dynamic Programming | Memoization | Set | LeetCode

2707. Extra Characters in a String | Recursion | Dynamic Programming | Memoization | Set | LeetCode

440. K-th Smallest in Lexicographical Order | Math | Hard | LeetCode

440. K-th Smallest in Lexicographical Order | Math | Hard | LeetCode

386. Lexicographical Numbers | DFS | Iterative Approach | Math | Trie | LeetCode | Medium

386. Lexicographical Numbers | DFS | Iterative Approach | Math | Trie | LeetCode | Medium

214. Shortest Palindrome | KMP Algorithm | Brute Force | Two Pointer Approach | HARD | LeetCode

214. Shortest Palindrome | KMP Algorithm | Brute Force | Two Pointer Approach | HARD | LeetCode

241. Different Ways to Add Parentheses | Recursion | LeetCode | Medium | Math

241. Different Ways to Add Parentheses | Recursion | LeetCode | Medium | Math

539. Minimum Time Difference | Sorting | Math | Logic | LeetCode | Medium | String | Array

539. Minimum Time Difference | Sorting | Math | Logic | LeetCode | Medium | String | Array

1310. XOR Queries of a Subarray | Prefix Sum | Array | Bit Manipulation | XOR Properties | LeetCode

1310. XOR Queries of a Subarray | Prefix Sum | Array | Bit Manipulation | XOR Properties | LeetCode

1684. Count the Number of Consistent Strings | Hash Set | Map | String | Counting | LeetCode | Easy

1684. Count the Number of Consistent Strings | Hash Set | Map | String | Counting | LeetCode | Easy

2220. Minimum Bit Flips to Convert Number | Bit Manipulation | Math | XOR operation | LeetCode |Easy

2220. Minimum Bit Flips to Convert Number | Bit Manipulation | Math | XOR operation | LeetCode |Easy

2807. Insert Greatest Common Divisors in Linked List | Linked List | Math | Number Theory | GCD

2807. Insert Greatest Common Divisors in Linked List | Linked List | Math | Number Theory | GCD

2326. Spiral Matrix IV | Linked List | Matrix | LeetCode | Medium

2326. Spiral Matrix IV | Linked List | Matrix | LeetCode | Medium

725. Split Linked List in Parts | Linked List | Math | Medium | LeetCode

725. Split Linked List in Parts | Linked List | Math | Medium | LeetCode

1367. Linked List in Binary Tree | Linked List | Tree | Binary Tree | Queue | DFS | BFS | Recursion

1367. Linked List in Binary Tree | Linked List | Tree | Binary Tree | Queue | DFS | BFS | Recursion

3217. Delete Nodes From Linked List Present in Array | Linked List | Set | Hash Map | LeetCode

3217. Delete Nodes From Linked List Present in Array | Linked List | Set | Hash Map | LeetCode

2028. Find Missing Observations | Array | Logic | Math | LeetCode | Medium

2028. Find Missing Observations | Array | Logic | Math | LeetCode | Medium

874. Walking Robot Simulation | Array | Hash Table | Set | Hash Map | LeetCode | Medium

874. Walking Robot Simulation | Array | Hash Table | Set | Hash Map | LeetCode | Medium

1945. Sum of Digits of String After Convert | String | Math | LeetCode | Easy

1945. Sum of Digits of String After Convert | String | Math | LeetCode | Easy

1894. Find the Student that Will Replace the Chalk | Prefix Sum | Binary Search | Math | LeetCode

1894. Find the Student that Will Replace the Chalk | Prefix Sum | Binary Search | Math | LeetCode

947. Most Stones Removed with Same Row or Column | DFS | Graph | LeetCode | Medium | Hash Set

947. Most Stones Removed with Same Row or Column | DFS | Graph | LeetCode | Medium | Hash Set

3253 & 3255. Find the Power of K-Size Subarrays I & II | Prefix sum | Array | Brute force | LeetCode

3253 & 3255. Find the Power of K-Size Subarrays I & II | Prefix sum | Array | Brute force | LeetCode

1937. Maximum Number of Points with Cost | DP | Math | Array | LeetCode | Medium

1937. Maximum Number of Points with Cost | DP | Math | Array | LeetCode | Medium

624. Maximum Distance in Arrays | Greedy | Brute Force approach | Optimal Approach | Array

624. Maximum Distance in Arrays | Greedy | Brute Force approach | Optimal Approach | Array

719. Find K-th Smallest Pair Distance | Binary search | Sorting | Bucket Sort | Two pointer | Hard

719. Find K-th Smallest Pair Distance | Binary search | Sorting | Bucket Sort | Two pointer | Hard

40. Combination Sum II | Recursion | LeetCode | Medium

40. Combination Sum II | Recursion | LeetCode | Medium

959. Regions Cut By Slashes | Graph | Disjoint Set Union | LeetCode | Medium

959. Regions Cut By Slashes | Graph | Disjoint Set Union | LeetCode | Medium

840. Magic Squares In Grid | Matrix | Math | Greedy | LeetCode | Medium

840. Magic Squares In Grid | Matrix | Math | Greedy | LeetCode | Medium

885. Spiral Matrix III | Matrix | Array | LeetCode | Medium

885. Spiral Matrix III | Matrix | Array | LeetCode | Medium

273. Integer to English Words | Recursion | String | Math

273. Integer to English Words | Recursion | String | Math

3016. Minimum Number of Pushes to Type Word II | Map | Greedy | Counting | String | Sorting

3016. Minimum Number of Pushes to Type Word II | Map | Greedy | Counting | String | Sorting

2134. Minimum Swaps to Group All 1's Together II | Sliding Window | Array | O(n)

2134. Minimum Swaps to Group All 1's Together II | Sliding Window | Array | O(n)

1605. Find Valid Matrix Given Row and Column Sums | Matrix | Greedy | Array | LeetCode | Medium

1605. Find Valid Matrix Given Row and Column Sums | Matrix | Greedy | Array | LeetCode | Medium

1110. Delete Nodes And Return Forest | Tree | DFS | BFS | Binary Tree | Queue | Set

1110. Delete Nodes And Return Forest | Tree | DFS | BFS | Binary Tree | Queue | Set

3218 & 3219 Minimum Cost for Cutting Cake I & II | Sorting | Greedy | Array | Matrix | Two pointer

3218 & 3219 Minimum Cost for Cutting Cake I & II | Sorting | Greedy | Array | Matrix | Two pointer

2751. Robot Collisions | Stack | Sorting | Array | String | LeetCode | Hard

2751. Robot Collisions | Stack | Sorting | Array | String | LeetCode | Hard

1190. Reverse Substrings Between Each Pair of Parentheses | Stack | Brute force | Optimal | String

1190. Reverse Substrings Between Each Pair of Parentheses | Stack | Brute force | Optimal | String

1598. Crawler Log Folder | Stack | Counting | LeetCode | Array | String

1598. Crawler Log Folder | Stack | Counting | LeetCode | Array | String

1068. Product Sales Analysis I | LeetCode SQL 50 | MySQL | JOIN | Inner Join | LeetCode

1068. Product Sales Analysis I | LeetCode SQL 50 | MySQL | JOIN | Inner Join | LeetCode

1378. Replace Employee ID With The Unique Identifier | MySQL | LeetCode SQL 50 |

1378. Replace Employee ID With The Unique Identifier | MySQL | LeetCode SQL 50 |

3211. Generate Binary Strings Without Adjacent Zeros | Recursion | String | Backtracking

3211. Generate Binary Strings Without Adjacent Zeros | Recursion | String | Backtracking

3212. Count Submatrices With Equal Frequency of X and Y | DP | Prefix Sum | Matrix

3212. Count Submatrices With Equal Frequency of X and Y | DP | Prefix Sum | Matrix

3203. Find Minimum Diameter After Merging Two Trees | Graph | LeetCode | BFS | DFS | HARD

3203. Find Minimum Diameter After Merging Two Trees | Graph | LeetCode | BFS | DFS | HARD

2058. Find the Minimum and Maximum Number of Nodes Between Critical Points | Linked List | Iterative

2058. Find the Minimum and Maximum Number of Nodes Between Critical Points | Linked List | Iterative

1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Sorting | Greedy |Arra

1509. Minimum Difference Between Largest and Smallest Value in Three Moves | Sorting | Greedy |Arra

2181. Merge Nodes in Between Zeros | Iterative | Recursion | Linked List | LeetCode

2181. Merge Nodes in Between Zeros | Iterative | Recursion | Linked List | LeetCode

1683. Invalid Tweets | LeetCode SQL 50 | MySQL | Select | Length LeetCode

1683. Invalid Tweets | LeetCode SQL 50 | MySQL | Select | Length LeetCode

1148. Article Views I | SQL 50 | MySQL | Select | Distinct | Order By | LeetCode

1148. Article Views I | SQL 50 | MySQL | Select | Distinct | Order By | LeetCode

595. Big Countries | MySQL | SQL 50 | Select | Where | Database | SQL Queries

595. Big Countries | MySQL | SQL 50 | Select | Where | Database | SQL Queries

584. Find Customer Referee

584. Find Customer Referee

1757. Recyclable and Low Fat Products | MySQL | LeetCode SQL 50 | SQL Queries

1757. Recyclable and Low Fat Products | MySQL | LeetCode SQL 50 | SQL Queries

1579. Remove Max Number of Edges to Keep Graph Fully Traversable | Graph | Union Find | LeetCode

1579. Remove Max Number of Edges to Keep Graph Fully Traversable | Graph | Union Find | LeetCode

2192. All Ancestors of a Node in a Directed Acyclic Graph | Graph | Directed Graph | DFS | LeetCode

2192. All Ancestors of a Node in a Directed Acyclic Graph | Graph | Directed Graph | DFS | LeetCode

2285. Maximum Total Importance of Roads | Graph | Indegree Count | Sorting | LeetCode | Medium

2285. Maximum Total Importance of Roads | Graph | Indegree Count | Sorting | LeetCode | Medium

1791. Find Center of Star Graph | Graph | Indegree Count | Greedy | LeetCode | Easy

1791. Find Center of Star Graph | Graph | Indegree Count | Greedy | LeetCode | Easy

1382. Balance a Binary Search Tree | Inorder Traversal | Divide and Conquer | BST | Tree | LeetCode

1382. Balance a Binary Search Tree | Inorder Traversal | Divide and Conquer | BST | Tree | LeetCode

1038. Binary Search Tree to Greater Sum Tree | In-order Traversal | Tree | Binary Search Tree | DFS

1038. Binary Search Tree to Greater Sum Tree | In-order Traversal | Tree | Binary Search Tree | DFS

995. Minimum Number of K Consecutive Bit Flips | Brute force | Prefix sum | Sliding window | O(N)

995. Minimum Number of K Consecutive Bit Flips | Brute force | Prefix sum | Sliding window | O(N)

1052. Grumpy Bookstore Owner | Brute Force | Sliding Window | Array | LeetCode | Medium | Amazon

1052. Grumpy Bookstore Owner | Brute Force | Sliding Window | Array | LeetCode | Medium | Amazon

1552. Magnetic Force Between Two Balls | Brute force | Sorting | Binary search | Array | LeetCode

1552. Magnetic Force Between Two Balls | Brute force | Sorting | Binary search | Array | LeetCode

1482. Minimum Number of Days to Make m Bouquets | Brute force approach | Binary search | Array

1482. Minimum Number of Days to Make m Bouquets | Brute force approach | Binary search | Array

826. Most Profit Assigning Work | Sorting | Greedy | Binary Search | Array | Two pointers | Medium

826. Most Profit Assigning Work | Sorting | Greedy | Binary Search | Array | Two pointers | Medium

2037. Minimum Number of Moves to Seat Everyone | Greedy | Sorting | Counting Sort | Array | O(m)

2037. Minimum Number of Moves to Seat Everyone | Greedy | Sorting | Counting Sort | Array | O(m)

75. Sort Colors | Brute Force | Counting Sort | Two Pointers | Sorting | Array | O(n) | FAANG

75. Sort Colors | Brute Force | Counting Sort | Two Pointers | Sorting | Array | O(n) | FAANG

1122. Relative Sort Array | Array | Brute Force | Counting Sort | Sorting | LeetCode | Easy | O(n)

1122. Relative Sort Array | Array | Brute Force | Counting Sort | Sorting | LeetCode | Easy | O(n)

3179. Find the N-th Value After K Seconds | Prefix Sum | Array | Logic | Math | LeetCode

3179. Find the N-th Value After K Seconds | Prefix Sum | Array | Logic | Math | LeetCode

3178. Find the Child Who Has the Ball After K Seconds | Easy | LeetCode | Math

3178. Find the Child Who Has the Ball After K Seconds | Easy | LeetCode | Math

523. Continuous Subarray Sum | Prefix sum | Map | Hash Table | Array | FAANG | LeetCode | Medium

523. Continuous Subarray Sum | Prefix sum | Map | Hash Table | Array | FAANG | LeetCode | Medium

648. Replace Words | String | Hash Set | Map | Medium | Array | FAANG

648. Replace Words | String | Hash Set | Map | Medium | Array | FAANG

846. Hand of Straights | 1296. Divide Array in Sets of K Consecutive Numbers | Hash Table | Sorting

846. Hand of Straights | 1296. Divide Array in Sets of K Consecutive Numbers | Hash Table | Sorting

1002. Find Common Characters | String | Hash Table | Map | EASY | LeetCode

1002. Find Common Characters | String | Hash Table | Map | EASY | LeetCode

409. Longest Palindrome | Map | String | Logic | Hash Table | Greedy | Facebook | Amazon | Google

409. Longest Palindrome | Map | String | Logic | Hash Table | Greedy | Facebook | Amazon | Google

2486. Append Characters to String to Make Subsequence | Two Pointer | String | Greedy | O(n) |Amazon

2486. Append Characters to String to Make Subsequence | Two Pointer | String | Greedy | O(n) |Amazon

3170. Lexicographically Minimum String After Removing Stars | String | Logic | Array | Medium |FAANG

3170. Lexicographically Minimum String After Removing Stars | String | Logic | Array | Medium |FAANG

3169. Count Days Without Meetings | Merge intervals | Array | Sorting | Medium | LeetCode | FAANG

3169. Count Days Without Meetings | Merge intervals | Array | Sorting | Medium | LeetCode | FAANG

3168. Minimum Number of Chairs in a Waiting Room | Easy | LeetCode | Array | String

3168. Minimum Number of Chairs in a Waiting Room | Easy | LeetCode | Array | String

260. Single Number III | Brute Force | Map | Optimal Approach | XOR properties | Bit manipulation

260. Single Number III | Brute Force | Map | Optimal Approach | XOR properties | Bit manipulation

1442. Count Triplets That Can Form Two Arrays of Equal XOR | Brute force | Optimal approach | Map

1442. Count Triplets That Can Form Two Arrays of Equal XOR | Brute force | Optimal approach | Map

1404. Number of Steps to Reduce a Number in Binary Representation to One | Bit manipulation | String

1404. Number of Steps to Reduce a Number in Binary Representation to One | Bit manipulation | String

1208. Get Equal Substrings Within Budget | Brute force | Sliding window | O(n) | String | Amazon

1208. Get Equal Substrings Within Budget | Brute force | Sliding window | O(n) | String | Amazon

1608. Special Array With X Elements Greater Than or Equal X | Brute force | Sorting | Binary search

1608. Special Array With X Elements Greater Than or Equal X | Brute force | Sorting | Binary search

3163. String Compression III | Logic | Array | String | LeetCode | Medium

3163. String Compression III | Logic | Array | String | LeetCode | Medium

3162 && 3163 Find the Number of Good Pairs I && II || Brute force | Factorization | Math | Logic

3162 && 3163 Find the Number of Good Pairs I && II || Brute force | Factorization | Math | Logic

3160. Find the Number of Distinct Colors Among the Balls | Map | Logic | LeetCode | Medium | Array

3160. Find the Number of Distinct Colors Among the Balls | Map | Logic | LeetCode | Medium | Array

3159. Find Occurrences of an Element in an Array | Map | Medium | Array | LeetCode

3159. Find Occurrences of an Element in an Array | Map | Medium | Array | LeetCode

3158. Find the XOR of Numbers Which Appear Twice | EASY | Map | Array | O(n) | LeetCode

3158. Find the XOR of Numbers Which Appear Twice | EASY | Map | Array | O(n) | LeetCode

140. Word Break II | Recursive | Memoization | Dynamic Programming | LeetCode Hard | FAANG | Hashing

140. Word Break II | Recursive | Memoization | Dynamic Programming | LeetCode Hard | FAANG | Hashing

1255. Maximum Score Words Formed by Letters | Recursion | Backtracking | Bitmask | Bit manipulation

1255. Maximum Score Words Formed by Letters | Recursion | Backtracking | Bitmask | Bit manipulation

2597. The Number of Beautiful Subsets | Backtracking | Recursion | Map | Bit Masking | GOOGLE | FB

2597. The Number of Beautiful Subsets | Backtracking | Recursion | Map | Bit Masking | GOOGLE | FB

131. Palindrome Partitioning | Recursion | Backtracking | DP | Dynamic Programming | String | FAANG

131. Palindrome Partitioning | Recursion | Backtracking | DP | Dynamic Programming | String | FAANG

78. Subsets | Recursive Approach | Iterative Approach | Backtracking | Bit Manipulation | Array

78. Subsets | Recursive Approach | Iterative Approach | Backtracking | Bit Manipulation | Array

1863. Sum of All Subset XOR Totals | Recursion | Iterative | Bit manipulation | Leetcode | EASY

1863. Sum of All Subset XOR Totals | Recursion | Iterative | Bit manipulation | Leetcode | EASY

3153. Sum of Digit Differences of All Pairs | Map | Logic | Math | Array | C++ | Leetcode | Medium

3153. Sum of Digit Differences of All Pairs | Map | Logic | Math | Array | C++ | Leetcode | Medium

3152. Special Array II | LEETCODE | MEDIUM | Prefix sum | O(N) | C++ | Logic

3152. Special Array II | LEETCODE | MEDIUM | Prefix sum | O(N) | C++ | Logic

3151. Special Array I | Array | Logic | O(N) | LEETCODE | EASY | C++

3151. Special Array I | Array | Logic | O(N) | LEETCODE | EASY | C++

979. Distribute Coins in Binary Tree | DFS | Recursion | Tree | Binary Tree | O(N) | Logic | FAANG

979. Distribute Coins in Binary Tree | DFS | Recursion | Tree | Binary Tree | O(N) | Logic | FAANG

1325. Delete Leaves With a Given Value | O(N) | LeetCode | DFS | Recursion | Tree | Binary Tree

1325. Delete Leaves With a Given Value | O(N) | LeetCode | DFS | Recursion | Tree | Binary Tree

2331. Evaluate Boolean Binary Tree | Recursion | DFS | Stack | Tree | Binary Tree | LeetCode | Easy

2331. Evaluate Boolean Binary Tree | Recursion | DFS | Stack | Tree | Binary Tree | LeetCode | Easy

2812. Find the Safest Path in a Grid | BFS | Binary Search | Priority Queue | Matrix | FAANG

2812. Find the Safest Path in a Grid | BFS | Binary Search | Priority Queue | Matrix | FAANG

1219. Path with Maximum Gold | DFS | BFS | Recursion | Backtracking | Matrix | C++ | LeetCode Medium

1219. Path with Maximum Gold | DFS | BFS | Recursion | Backtracking | Matrix | C++ | LeetCode Medium

861. Score After Flipping Matrix | Bit Manipulation | Greedy | Matrix | Array | LeetCode Medium

861. Score After Flipping Matrix | Bit Manipulation | Greedy | Matrix | Array | LeetCode Medium

3146. Permutation Difference between Two Strings | Permutation | EASY | LeetCode | String | Map

3146. Permutation Difference between Two Strings | Permutation | EASY | LeetCode | String | Map

3147. Taking Maximum Energy From the Mystic Dungeon | DP | Math | LeetCode Medium | Array

3147. Taking Maximum Energy From the Mystic Dungeon | DP | Math | LeetCode Medium | Array

3144. Minimum Substring Partition of Equal Character Frequency | Recursion | DP | Memoization

3144. Minimum Substring Partition of Equal Character Frequency | Recursion | DP | Memoization

3143. Maximum Points Inside the Square | Map && Sorting && Logic | Medium | String | LeetCode

3143. Maximum Points Inside the Square | Map && Sorting && Logic | Medium | String | LeetCode

3142. Check if Grid Satisfies Conditions | LeetCode EASY | Matrix

3142. Check if Grid Satisfies Conditions | LeetCode EASY | Matrix

1. SOLID Principles | Low Level System design

1. SOLID Principles | Low Level System design

857. Minimum Cost to Hire K Workers | Sorting | Priority queue | Heap | FAANG | C++ | Hard

857. Minimum Cost to Hire K Workers | Sorting | Priority queue | Heap | FAANG | C++ | Hard

786. K-th Smallest Prime Fraction | Priority Queue | Heap | Binary Search | Two pointer | Array

786. K-th Smallest Prime Fraction | Priority Queue | Heap | Binary Search | Two pointer | Array

3075. Maximize Happiness of Selected Children | Sorting && Greedy | Priority queue | Heap | O(nlogn

3075. Maximize Happiness of Selected Children | Sorting && Greedy | Priority queue | Heap | O(nlogn

506. Relative Ranks | Map && Sorting | Heap | Priority queue | O(nlogn) | C++ | Array

506. Relative Ranks | Map && Sorting | Heap | Priority queue | O(nlogn) | C++ | Array

2816. Double a Number Represented as a Linked List | Linked List | Stack | Recursion | Math

2816. Double a Number Represented as a Linked List | Linked List | Stack | Recursion | Math

2487. Remove Nodes From Linked List | Stack | Recursion | O(n) | C++ | FAANG | Linked List

2487. Remove Nodes From Linked List | Stack | Recursion | O(n) | C++ | FAANG | Linked List

3138. Minimum Length of Anagram Concatenation | String && Anagram | Map | Factors of a number |FAANG

3138. Minimum Length of Anagram Concatenation | String && Anagram | Map | Factors of a number |FAANG

3136. Valid Word | EASY | Logic based | C++ | String

3136. Valid Word | EASY | Logic based | C++ | String

3137. Minimum Number of Operations to Make Word K-Periodic | Map && Math | Medium | FAANG | C++

3137. Minimum Number of Operations to Make Word K-Periodic | Map && Math | Medium | FAANG | C++

881. Boats to Save People | Sorting | Two pointer | Array | O(nlogn) | Medium | C++ | FAANG

881. Boats to Save People | Sorting | Two pointer | Array | O(nlogn) | Medium | C++ | FAANG

165. Compare Version Numbers | Two Pointer | String | O(n) | Google | Amazon | Facebook | Apple

165. Compare Version Numbers | Two Pointer | String | O(n) | Google | Amazon | Facebook | Apple

2441. Largest Positive Integer That Exists With Its Negative | Brute force | Set | Two pointer

2441. Largest Positive Integer That Exists With Its Negative | Brute force | Set | Two pointer

Permutations of given String | String | Recursion | O(n^2) | C++

Permutations of given String | String | Recursion | O(n^2) | C++

2952. Minimum Number of Coins to be Added | Sorting + Math | Google | Amazon | Microsoft | Medium

2952. Minimum Number of Coins to be Added | Sorting + Math | Google | Amazon | Microsoft | Medium

3133. Minimum Array End | Bit manipulation | Medium | AND operation | Google | Amazon | Microsoft

3133. Minimum Array End | Bit manipulation | Medium | AND operation | Google | Amazon | Microsoft

2000. Reverse Prefix of Word | Stack | Two pointer | O(n) | Google | Microsoft | Apple | Adobe

2000. Reverse Prefix of Word | Stack | Two pointer | O(n) | Google | Microsoft | Apple | Adobe

1915. Number of Wonderful Substrings | Brute force | Bit manipulation | O(N) | C++

1915. Number of Wonderful Substrings | Brute force | Bit manipulation | O(N) | C++

2997. Minimum Number of Operations to Make Array XOR Equal to K | XOR | Math | Easy | C++ | Hindi

2997. Minimum Number of Operations to Make Array XOR Equal to K | XOR | Math | Easy | C++ | Hindi

3131 & 3132 Find the Integer Added to Array I & II | Sort | Math | Amazon | Google | C++ | Hindi

3131 & 3132 Find the Integer Added to Array I & II | Sort | Math | Amazon | Google | C++ | Hindi

834. Sum of Distances in Tree | Tree | Graph | DFS | O(n^2) | O(n) | Amazon | Google | Microsoft

834. Sum of Distances in Tree | Tree | Graph | DFS | O(n^2) | O(n) | Amazon | Google | Microsoft

Google 514. Freedom Trail | Recursion | Memoization | DP | Amazon | Microsoft | String | DFS | BFS

Google 514. Freedom Trail | Recursion | Memoization | DP | Amazon | Microsoft | String | DFS | BFS

Google Microsoft 1289. Minimum Falling Path Sum II | Recursion | Memoization | DP | Math | C++

Google Microsoft 1289. Minimum Falling Path Sum II | Recursion | Memoization | DP | Math | C++

Amazon 2370. Longest Ideal Subsequence | Recursion | Memoization | DP | Math | String | C++ | Hindi

Amazon 2370. Longest Ideal Subsequence | Recursion | Memoization | DP | Math | String | C++ | Hindi

1137. N-th Tribonacci Number | DP | Array | Math | C++ | Hindi | Amazon | Google | Microsoft | Apple

1137. N-th Tribonacci Number | DP | Array | Math | C++ | Hindi | Amazon | Google | Microsoft | Apple

310. Minimum Height Trees | BFS | WHY NOT DFS | QUEUE | TREE | AMAZON | GOOGLE | MICROSOFT | C++

310. Minimum Height Trees | BFS | WHY NOT DFS | QUEUE | TREE | AMAZON | GOOGLE | MICROSOFT | C++

752. Open the Lock | BFS | QUEUE | C++ | HINDI

752. Open the Lock | BFS | QUEUE | C++ | HINDI

3123. Find Edges in Shortest Paths | Dijkstra's algorithm | Graph | Priority Queue | C++ | Hindi

3123. Find Edges in Shortest Paths | Dijkstra's algorithm | Graph | Priority Queue | C++ | Hindi

3122. Minimum Number of Operations to Satisfy Conditions | RECURSION | DP | C++ | HINDI

3122. Minimum Number of Operations to Satisfy Conditions | RECURSION | DP | C++ | HINDI

3121. Count the Number of Special Characters II | String | Array | C++ | Hindi

3121. Count the Number of Special Characters II | String | Array | C++ | Hindi

3120. Count the Number of Special Characters I | Set | C++ | Hindi

3120. Count the Number of Special Characters I | Set | C++ | Hindi

1971. Find if Path Exists in Graph | DFS | BFS | UNION-FIND | O(N) | C++ | HINDI

1971. Find if Path Exists in Graph | DFS | BFS | UNION-FIND | O(N) | C++ | HINDI

1992. Find All Groups of Farmland | DFS | BFS | Without DFS and BFS | GREEDY | GRAPH | C++ | HINDI

1992. Find All Groups of Farmland | DFS | BFS | Without DFS and BFS | GREEDY | GRAPH | C++ | HINDI

200. Number of Islands | DFS | BFS | UNION-FIND | QUEUE | GRAPH | C++ | HINDI

200. Number of Islands | DFS | BFS | UNION-FIND | QUEUE | GRAPH | C++ | HINDI

How to Start Leetcode in 2025 (as a beginner)

How to Start Leetcode in 2025 (as a beginner)

463. Island Perimeter | DFS | BFS | O(r*c) | Array | Matrix | C++ | Hindi

463. Island Perimeter | DFS | BFS | O(r*c) | Array | Matrix | C++ | Hindi

988. Smallest String Starting From Leaf | DFS | Tree | Binary Tree | O(n*L) | String | C++ | Hindi

988. Smallest String Starting From Leaf | DFS | Tree | Binary Tree | O(n*L) | String | C++ | Hindi

623. Add One Row to Tree | BFS | DFS | O(n) | Tree | Binary Tree | Queue | C++ | Hindi

623. Add One Row to Tree | BFS | DFS | O(n) | Tree | Binary Tree | Queue | C++ | Hindi

129. Sum Root to Leaf Numbers | DFS | Tree | Binary Tree | O(n) | C++ | Hindi

129. Sum Root to Leaf Numbers | DFS | Tree | Binary Tree | O(n) | C++ | Hindi

404. Sum of Left Leaves | Tree | Binary Tree | DFS | BFS | C++ | Hindi

404. Sum of Left Leaves | Tree | Binary Tree | DFS | BFS | C++ | Hindi

3115. Maximum Prime Difference | Sieve of Eratosthenes | Brute force | optimal | Array | C++ | Hindi

3115. Maximum Prime Difference | Sieve of Eratosthenes | Brute force | optimal | Array | C++ | Hindi

3114. Latest Time You Can Obtain After Replacing Characters | String | Hindi

3114. Latest Time You Can Obtain After Replacing Characters | String | Hindi

3112. Minimum Time to Visit Disappearing Nodes | O(NlogN) | Dijkstras | Graph | Hindi

3112. Minimum Time to Visit Disappearing Nodes | O(NlogN) | Dijkstras | Graph | Hindi

3111. Minimum Rectangles to Cover Points | Array | Sorting | greedy | O(NlogN) | Hindi

3111. Minimum Rectangles to Cover Points | Array | Sorting | greedy | O(NlogN) | Hindi

3110 Score of a String | O(N) | String | Hindi

3110 Score of a String | O(N) | String | Hindi

85. Maximal Rectangle | Stack | Monotonic Stack | Hard | C++ | Hindi

85. Maximal Rectangle | Stack | Monotonic Stack | Hard | C++ | Hindi

42. Trapping Rain Water | LeetCode | Brute | Optimal | Hindi

42. Trapping Rain Water | LeetCode | Brute | Optimal | Hindi

3107. Minimum Operations to Make Median of Array Equal to K | Sorting | Math | Hindi

3107. Minimum Operations to Make Median of Array Equal to K | Sorting | Math | Hindi

3106. Lexicographically Smallest String After Operations With Constraint | Strings | Hindi

3106. Lexicographically Smallest String After Operations With Constraint | Strings | Hindi

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Array | Sliding Window (O(n))

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Array | Sliding Window (O(n))