"đź”’" means Locked and requires Premium
-
- 1. Two Sum
**Javaâś… JavaScriptâś…
- 1. Two Sum
-
- 34. Find First and Last Position of Element in Sorted Array
***Practise sometime laterJavaâś… JavaScriptâś…
- 34. Find First and Last Position of Element in Sorted Array
-
- 287. Find the Duplicate Number
***Floyd's Cycle Detection (Tortoise & Hare) algoPractise sometime later
- 287. Find the Duplicate Number
-
- 2186. Minimum Number of Steps to Make Two Strings Anagram II
***Practise sometime later
- 2186. Minimum Number of Steps to Make Two Strings Anagram II
-
- 876. Middle of the Linked List
Javaâś… JavaScriptâś…
- 876. Middle of the Linked List
-
- 374. Guess Number Higher or Lower
**Javaâś… JavaScriptâś…
- 374. Guess Number Higher or Lower
-
- 1832. Check if the Sentence Is Pangram
Javaâś… JavaScriptâś…
- 1832. Check if the Sentence Is Pangram
-
- 1854. Maximum Population Year
***Practise sometime later
- 1854. Maximum Population Year
-
- 26. Remove Duplicates from Sorted Array
*Javaâś… JavaScriptâś…
- 26. Remove Duplicates from Sorted Array
-
- 1351. Count Negative Numbers in a Sorted Matrix
Practise sometime later
- 1351. Count Negative Numbers in a Sorted Matrix
-
- 888. Fair Candy Swap
**MathPractise sometime later
- 888. Fair Candy Swap
-
- 1346. Check If N and Its Double Exist
**Tricky!Practise sometime later
- 1346. Check If N and Its Double Exist
-
- 53. Maximum Subarray
***Practise sometime later
- 53. Maximum Subarray
-
- 2216. Minimum Deletions to Make Array Beautiful
***Practise sometime later
- 2216. Minimum Deletions to Make Array Beautiful
-
- 74. Search a 2D Matrix
***Practise sometime later
- 74. Search a 2D Matrix
-
- 410. Split Array Largest Sum
****ImportantPractise sometime later
- 410. Split Array Largest Sum
-
- 169. Majority Element
**Boyer-Moore Voting algoPractise sometime later
- 169. Majority Element
-
- 2221. Find Triangular Sum of an Array
**Practise sometime later
- 2221. Find Triangular Sum of an Array
-
- 2222. Number of Ways to Select Buildings
***Practise sometime later
- 2222. Number of Ways to Select Buildings
-
- 11. Container With Most Water
**Practise sometime later
- 11. Container With Most Water
-
- 238. Product of Array Except Self
***Practise sometime later
- 238. Product of Array Except Self
-
- 1886. Determine Whether Matrix Can Be Obtained By Rotation
***Practise sometime later
- 1886. Determine Whether Matrix Can Be Obtained By Rotation
-
- 2235. Add Two Integers
Never solve again
- 2235. Add Two Integers
-
- 2244. Minimum Rounds to Complete All Tasks
***Practise sometime later
- 2244. Minimum Rounds to Complete All Tasks
-
- 28. Implement strStr()
***KMPPractise sometime later
- 28. Implement strStr()
-
- 70. Climbing Stairs
**DPPractise sometime later
- 70. Climbing Stairs
-
- 1396. Design Underground System
**Practise sometime later
- 1396. Design Underground System
-
- 2251. Number of Flowers in Full Bloom
****Practise sometime later
- 2251. Number of Flowers in Full Bloom
-
- 2250. Count Number of Rectangles Containing Each Point
****PractiseTricky!
- 2250. Count Number of Rectangles Containing Each Point
-
- 885. Spiral Matrix III
***Practise sometime later
- 885. Spiral Matrix III
-
- 198. House Robber
**DPPractise sometime laterTricky!
- 198. House Robber
-
- 55. Jump Game
***Practise sometime laterDPGreedyJavaâś… JavaScriptâś…
- 55. Jump Game
-
- 600. Non-negative Integers without Consecutive Ones
****Practise sometime laterDP
- 600. Non-negative Integers without Consecutive Ones
-
- 1250. Check If It Is a Good Array
***Mathematical
- 1250. Check If It Is a Good Array
-
- 2. Add Two Numbers
***Practise sometime later
- 2. Add Two Numbers
-
- 142. Linked List Cycle II
**Practise sometime later
- 142. Linked List Cycle II
-
- 202. Happy Number
**LL slow-fast approach usedTricky!
- 202. Happy Number
-
- 2095. Delete the Middle Node of a Linked List
**Javaâś… JavaScriptâś…
- 2095. Delete the Middle Node of a Linked List
-
- 148. Sort List
***Practise sometime later
- 148. Sort List
-
- 206. Reverse Linked List
*Practise sometime later
- 206. Reverse Linked List
-
- 905. Sort Array By Parity
**Take a look later
- 905. Sort Array By Parity
-
- 2255. Count Prefixes of a Given String
*nice use String.prototype.indexOf()
- 2255. Count Prefixes of a Given String
-
- 2256. Minimum Average Difference
**Javaâś… JavaScriptâś…
- 2256. Minimum Average Difference
-
- 2257. Count Unguarded Cells in the Grid
***Practise sometime later
- 2257. Count Unguarded Cells in the Grid
-
- 2211. Count Collisions on a Road
***Tricky!
- 2211. Count Collisions on a Road
-
- 92. Reverse Linked List II
***Practise sometime later
- 92. Reverse Linked List II
-
- 234. Palindrome Linked List
***Practise sometime later
- 234. Palindrome Linked List
-
- 143. Reorder List
***Practise sometime later
- 143. Reorder List
-
- 25. Reverse Nodes in k-Group
****Practise sometime later
- 25. Reverse Nodes in k-Group
-
- 61. Rotate List
***Practise sometime later
- 61. Rotate List
-
- 48. Rotate Image
***
- 48. Rotate Image
-
- 2259. Remove Digit From Number to Maximize Result
**Use substring
- 2259. Remove Digit From Number to Maximize Result
-
- 2260. Minimum Consecutive Cards to Pick Up
***Practise sometime later
- 2260. Minimum Consecutive Cards to Pick Up
-
- 2266. Count Number of Texts
***Practise sometime later
- 2266. Count Number of Texts
-
- 1802. Maximum Value at a Given Index in a Bounded Array
***Practise sometime later
- 1802. Maximum Value at a Given Index in a Bounded Array
-
- 1818. Minimum Absolute Sum Difference
***Practise sometime later
- 1818. Minimum Absolute Sum Difference
-
- 1095. Find in Mountain Array
***Take a look again sometime later
- 1095. Find in Mountain Array
-
- 315. Count of Smaller Numbers After Self
****Practise again
- 315. Count of Smaller Numbers After Self
-
- 455. Assign Cookies
Greedy
- 455. Assign Cookies
-
- 561. Array Partition I
Pattern after sorting
- 561. Array Partition I
-
- 15. 3 Sum
***Practise sometime later
- 15. 3 Sum
-
- 18. 4 Sum
***Practise sometime later
- 18. 4 Sum
-
- 49. Group Anagrams
***Javaâś… JavaScriptâś…
- 49. Group Anagrams
-
- 56. Merge Intervals
***Meeting Room I & II SimilarPractise again
- 56. Merge Intervals
-
- 2279. Maximum Bags With Full Capacity of Rocks
**Javaâś… JavaScriptâś…
- 2279. Maximum Bags With Full Capacity of Rocks
-
- 78. Subsets
**
- 78. Subsets
-
- 312. Burst Balloons
****DPPractise sometime later
- 312. Burst Balloons
-
- 304. Range Sum Query 2D - Immutable
***Practise sometime later
- 304. Range Sum Query 2D - Immutable
-
- 51. N Queens
***Practise sometime later
- 51. N Queens
-
- 65. Valid Number
***
- 65. Valid Number
-
- 52. N Queens II
***
- 52. N Queens II
-
- 90. Subsets II
***
- 90. Subsets II
-
- 2302. Count Subarrays With Score Less Than K
***Practise sometime later
- 2302. Count Subarrays With Score Less Than K
-
- 2304. Minimum Path Cost in a Grid
***Solve again later
- 2304. Minimum Path Cost in a Grid
-
- 583. Delete Operation for Two Strings
***DPSolve again later
- 583. Delete Operation for Two Strings
-
- 1763. Longest Nice Substring
***DPSolve again laterRecursion
- 1763. Longest Nice Substring
-
- 89. Gray Code
***
- 89. Gray Code
-
- 968. Binary Tree Cameras
****Solve again later
- 968. Binary Tree Cameras
-
- 121. Best Time to Buy and Sell Stock
**Not so easy
- 121. Best Time to Buy and Sell Stock
-
- 2310. Sum of Numbers With Units Digit K
***Tricky!Practise sometime later
- 2310. Sum of Numbers With Units Digit K
-
- 89. Gray Code
**Not so easy
- 89. Gray Code
-
- 820. Short Encoding of Words
***setsubstring
- 820. Short Encoding of Words
-
- 703. Kth Largest Element in a Stream
***Solve again later
- 703. Kth Largest Element in a Stream
-
- 1985. Find the Kth Largest Integer in the Array
***Tricky!
- 1985. Find the Kth Largest Integer in the Array
-
- 2226. Maximum Candies Allocated to K Children
***Nice Binary Search Q
- 2226. Maximum Candies Allocated to K Children
-
- 2317. Maximum XOR After Operations
***Tricky!
- 2317. Maximum XOR After Operations
-
- 237. Delete Node in a Linked List
Tricky!Easy
- 237. Delete Node in a Linked List
-
- 445. Add Two Numbers II
***Solve again laterImp
- 445. Add Two Numbers II
-
- 496. Next Greater Element I
**Make it more optimised
- 496. Next Greater Element I
-
- 503. Next Greater Element II
***Stack
- 503. Next Greater Element II
-
- 146. LRU Cache
****Solve again later
- 146. LRU Cache
-
- 2335. Minimum Amount of Time to Fill Cups
***Tricky!
- 2335. Minimum Amount of Time to Fill Cups
-
- 2337. Move Pieces to Obtain a String
***Practise sometime later
- 2337. Move Pieces to Obtain a String
-
- 39. Combination Sum
***RecursionSolve again using dfs
- 39. Combination Sum
-
- 40. Combination Sum II
***Recursion
- 40. Combination Sum II
-
- 46. Permutations
**Recursion
- 46. Permutations
-
- 47. Permutations II
**Recursion
- 47. Permutations II
-
- 37. Sudoku Solver
****BacktrackingPractise sometime later
- 37. Sudoku Solver
-
- 36. Valid Sudoku
***Practise sometime later
- 36. Valid Sudoku
-
- 239. Sliding Window Maximum
***Important!!DequeueSolve again later
- 239. Sliding Window Maximum
-
- 994. Rotting Oranges
***BFS
- 994. Rotting Oranges
-
- 493. Reverse Pairs
****Solve again later
- 493. Reverse Pairs
-
- 84. Largest Rectangle in Histogram
****StackPractise sometime later
- 84. Largest Rectangle in Histogram
-
- 131. Palindrome Partitioning
***Backtracking
- 131. Palindrome Partitioning
-
- 60. Permutation Sequence
****Tricky!
- 60. Permutation Sequence
-
- 2350. Shortest Impossible Sequence of Rolls
****Tricky!Solve again later
- 2350. Shortest Impossible Sequence of Rolls
-
- 213. House Robber II
**DP
- 213. House Robber II
-
- 62. Unique Paths
***DP
- 62. Unique Paths
-
- 416. Partition Equal Subset Sum
***DPPractise sometime later
- 416. Partition Equal Subset Sum
-
- 63. Unique Paths II
***DP
- 63. Unique Paths II
-
- 371. Sum of Two Integers
Tricky!
- 371. Sum of Two Integers
-
- 64. Minimum Path Sum
***DP
- 64. Minimum Path Sum
-
- 409. Longest Palindrome
**Greedy
- 409. Longest Palindrome
-
- 858. Mirror Reflection
**GeometryPractise sometime later
- 858. Mirror Reflection
-
- 1302. Deepest Leaves Sum
**BinaryTree
- 1302. Deepest Leaves Sum
-
- 377. Combination Sum IV
***DP
- 377. Combination Sum IV
-
- 1038. Binary Search Tree to Greater Sum Tree
***Practise sometime later
- 1038. Binary Search Tree to Greater Sum Tree
-
- 538. Convert BST to Greater Tree
Same as above
- 538. Convert BST to Greater Tree
-
- 2368. Reachable Nodes With Restrictions
***DFSBFSPractise sometime later
- 2368. Reachable Nodes With Restrictions
-
- 94. Binary Tree Inorder Traversal
Morris Traversalâś…
- 94. Binary Tree Inorder Traversal
-
- 823. Binary Trees With Factors
****DPHashmap
- 823. Binary Trees With Factors
-
- 300. Longest Increasing Subsequence
**DpGreedyBS
- 300. Longest Increasing Subsequence
-
- 104. Maximum Depth of Binary Tree
**DFSBFS
- 104. Maximum Depth of Binary Tree
-
- 111. Minimum Depth of Binary Tree
*DFSBFS
- 111. Minimum Depth of Binary Tree
-
- 543. Diameter of Binary Tree
**Imp Concept
- 543. Diameter of Binary Tree
-
- 2381. Shifting Letters II
***Optimization is important
- 2381. Shifting Letters II
-
- 134. Gas Station
***GreedyJavaâś… JavaScriptâś…
- 134. Gas Station
-
- 1463. Cherry Pickup II
****DPSolve again later
- 1463. Cherry Pickup II
-
- 662. Maximum Width of Binary Tree
***Practise sometime later
- 662. Maximum Width of Binary Tree
-
- 2385. Amount of Time for Binary Tree to Be Infected
***Practise sometime later
- 2385. Amount of Time for Binary Tree to Be Infected
-
- 863. All Nodes Distance K in Binary Tree
***Practise sometime later
- 863. All Nodes Distance K in Binary Tree
-
- 2217. Find Palindrome With Fixed Length
***Practise sometime later
- 2217. Find Palindrome With Fixed Length
-
- 871. Minimum Number of Refueling Stops
****Practise sometime later
- 871. Minimum Number of Refueling Stops
-
- 2170. Minimum Operations to Make the Array Alternating
***GreedyPractise sometime later
- 2170. Minimum Operations to Make the Array Alternating
-
- 2171. Removing Minimum Number of Magic Beans
***Tricky!
- 2171. Removing Minimum Number of Magic Beans
-
- 2400. Number of Ways to Reach a Position After Exactly k Steps
***Combinatorics - Math
- 2400. Number of Ways to Reach a Position After Exactly k Steps
-
- 98. Validate Binary Search Tree
***Imp
- 98. Validate Binary Search Tree
-
- 297. Serialize and Deserialize Binary Tree
***ImpNice Ques
- 297. Serialize and Deserialize Binary Tree
-
- 200. Number of Islands
***GraphPractise sometime later
- 200. Number of Islands
-
- 260. Single Number III
***Bit ManipulationPractise sometime later
- 260. Single Number III
-
- 201. Bitwise AND of Numbers Range
**Tricky!
- 201. Bitwise AND of Numbers Range
-
- 1008. Construct Binary Search Tree from Preorder Traversal
**Practise again - Optimized approach
- 1008. Construct Binary Search Tree from Preorder Traversal
-
- 130. Surrounded Regions
***Nice Q
- 130. Surrounded Regions
-
- 658. Find K Closest Elements
***Nice QBSJavaâś… JavaScriptâś…
- 658. Find K Closest Elements
-
- 802. Find Eventual Safe States
***Using DFS
- 802. Find Eventual Safe States
-
- 207. Course Schedule
***Using topo sort
- 207. Course Schedule
-
- 2428. Maximum Sum of an Hourglass
*Javaâś… JavaScriptâś…
- 2428. Maximum Sum of an Hourglass
-
- 560. Subarray Sum Equals K
***Practise sometime laterJavaâś… JavaScriptâś…
- 560. Subarray Sum Equals K
-
- 2442. Count Number of Distinct Integers After Reverse Operations
**Javaâś… JavaScriptâś…
- 2442. Count Number of Distinct Integers After Reverse Operations
-
- 219. Contains Duplicate II
*Javaâś… JavaScriptâś…
- 219. Contains Duplicate II
-
- 1047. Remove All Adjacent Duplicates In String
*StackJavaâś… JavaScriptâś…
- 1047. Remove All Adjacent Duplicates In String
-
- 1884. Egg Drop With 2 Eggs and N Floors
***Tricky!DPPractise sometime laterJavaâś… JavaScriptâś…
- 1884. Egg Drop With 2 Eggs and N Floors
-
- 2414. Length of the Longest Alphabetical Continuous Substring
***Practise sometime laterJavaâś… JavaScriptâś…
- 2414. Length of the Longest Alphabetical Continuous Substring
-
- 2441. Largest Positive Integer That Exists With Its Negative
Javaâś… JavaScriptâś…
- 2441. Largest Positive Integer That Exists With Its Negative
-
- 523. Continuous Subarray Sum
***Practise sometime laterJavaâś… JavaScriptâś…
- 523. Continuous Subarray Sum
-
- 1171. Remove Zero Sum Consecutive Nodes from Linked List
***Javaâś… JavaScriptâś…
- 1171. Remove Zero Sum Consecutive Nodes from Linked List
-
- 127. Word Ladder
****BFSJavaâś… JavaScriptâś…
- 127. Word Ladder
-
- 766. Toeplitz Matrix
*Javaâś… JavaScriptâś…
- 766. Toeplitz Matrix
-
- 2452. Words Within Two Edits of Dictionary
*Javaâś… JavaScriptâś…
- 2452. Words Within Two Edits of Dictionary
-
- 2079. Watering Plants
*Javaâś… JavaScriptâś…
- 2079. Watering Plants
-
- 1980. Find Unique Binary String
**Javaâś… JavaScriptâś…
- 1980. Find Unique Binary String
-
- 1860. Incremental Memory Leak
**Javaâś… JavaScriptâś…
- 1860. Incremental Memory Leak
-
- 1963. Minimum Number of Swaps to Make the String Balanced
**Javaâś… JavaScriptâś…
- 1963. Minimum Number of Swaps to Make the String Balanced
-
- 2460. Apply Operations to an Array
Javaâś… JavaScriptâś…
- 2460. Apply Operations to an Array
-
- 1323. Maximum 69 Number
Javaâś… JavaScriptâś…
- 1323. Maximum 69 Number
-
- 1910. Remove All Occurrences of a Substring
***Practise with KMPJavaâś… JavaScriptâś…
- 1910. Remove All Occurrences of a Substring
-
- 1877. Minimize Maximum Pair Sum in Array
*Javaâś… JavaScriptâś…
- 1877. Minimize Maximum Pair Sum in Array
-
- 1409. Queries on a Permutation With Key
***Practise optimized approach using Fenwick tree
- 1409. Queries on a Permutation With Key
-
- 2471. Minimum Number of Operations to Sort a Binary Tree by Level
**Javaâś… JavaScriptâś…
- 2471. Minimum Number of Operations to Sort a Binary Tree by Level
-
- 2401. Longest Nice Subarray
***Sliding WindowBit ManipulationJavaâś… JavaScriptâś…
- 2401. Longest Nice Subarray
-
- 279. Perfect Squares
***DPJavaâś… JavaScriptâś…
- 279. Perfect Squares
-
- 2476. Closest Nodes Queries in a Binary Search Tree
***Practise sometime later
- 2476. Closest Nodes Queries in a Binary Search Tree
-
- 2482. Difference Between Ones and Zeros in Row and Column
**Javaâś… JavaScriptâś…
- 2482. Difference Between Ones and Zeros in Row and Column
-
- 2483. Minimum Penalty for a Shop
***Javaâś… JavaScriptâś…
- 2483. Minimum Penalty for a Shop
-
- 413. Arithmetic Slices
**Javaâś… JavaScriptâś…
- 413. Arithmetic Slices
-
- 2487. Remove Nodes From Linked List
**Javaâś… JavaScriptâś…
- 2487. Remove Nodes From Linked List
-
- 1657. Determine if Two Strings Are Close
**Javaâś…little tricky!
- 1657. Determine if Two Strings Are Close
-
- 446. Arithmetic Slices II - Subsequence
****Practise sometime laterDPJavaâś…
- 446. Arithmetic Slices II - Subsequence
-
- 451. Sort Characters By Frequency
***Practise sometime laterJavaScriptâś…
- 451. Sort Characters By Frequency
-
- 2491. Divide Players Into Teams of Equal Skill
**Javaâś… JavaScriptâś…
- 2491. Divide Players Into Teams of Equal Skill
-
- 1780. Check if Number is a Sum of Powers of Three
**MathJavaâś… JavaScriptâś…
- 1780. Check if Number is a Sum of Powers of Three
-
- 2443. Sum of Number and Its Reverse
*MathJavaâś… JavaScriptâś…
- 2443. Sum of Number and Its Reverse
-
- 938. Range Sum of BST
Javaâś… JavaScriptâś…
- 938. Range Sum of BST
-
- 24. Swap Nodes in Pairs
*Javaâś… JavaScriptâś…
- 24. Swap Nodes in Pairs
-
- 1026. Maximum Difference Between Node and Ancestor
***Practise sometime later
- 1026. Maximum Difference Between Node and Ancestor
-
- 1991. Find the Middle Index in Array
**Nice Q
- 1991. Find the Middle Index in Array
-
- 2032. Two Out of Three
*Practise BitMask method
- 2032. Two Out of Three
-
- 309. Best Time to Buy and Sell Stock with Cooldown
***Practise again
- 309. Best Time to Buy and Sell Stock with Cooldown
-
- 2509. Cycle Length Queries in a Tree
***Practise again
- 2509. Cycle Length Queries in a Tree
-
- 150. Evaluate Reverse Polish Notation
**Javaâś… JavaScriptâś…
- 150. Evaluate Reverse Polish Notation
-
- 2512. Reward Top K Students
***Practise sometime later
- 2512. Reward Top K Students
-
- 944. Delete Columns to Make Sorted
Javaâś… JavaScriptâś…
- 944. Delete Columns to Make Sorted
-
- 1833. Maximum Ice Cream Bars
**Greedy
- 1833. Maximum Ice Cream Bars
-
- 149. Max Points on a Line
***Math
- 149. Max Points on a Line
-
- 30. Substring with Concatenation of All Words
****Sliding WindowPractise sometime later
- 30. Substring with Concatenation of All Words
-
- 1443. Minimum Time to Collect All Apples in a Tree
***Practise again
- 1443. Minimum Time to Collect All Apples in a Tree
-
- 926. Flip String to Monotone Increasing
***Javaâś…
- 926. Flip String to Monotone Increasing
-
- 918. Maximum Sum Circular Subarray
***Javaâś… JavaScriptâś…
- 918. Maximum Sum Circular Subarray
-
- 491. Non-decreasing Subsequences
***Javaâś…
- 491. Non-decreasing Subsequences
-
- 93. Restore IP Addresses
***JavaScriptâś…
- 93. Restore IP Addresses
-
- 909. Snakes and Ladders
***JavaScriptâś…
- 909. Snakes and Ladders
-
- 2359. Find Closest Node to Given Two Nodes
***Javaâś…
- 2359. Find Closest Node to Given Two Nodes
-
- 787. Cheapest Flights Within K Stops
****Javaâś…
- 787. Cheapest Flights Within K Stops
-
- 472. Concatenated Words
****JavaScriptâś…
- 472. Concatenated Words
-
- 352. Data Stream as Disjoint Intervals
****BSDesignJavaScriptâś…
- 352. Data Stream as Disjoint Intervals
-
- 460. LFU Cache
****DesignNeed much more Practise for implementationJavaâś…
- 460. LFU Cache
-
- 1626. Best Team With No Conflicts
****JavaScriptâś…
- 1626. Best Team With No Conflicts
-
- 45. Jump Game II
***
- 45. Jump Game II
-
- Rat in a Maze Problem - I
***GFG
- Rat in a Maze Problem - I
-
- Subset Sums
**GFG
- Subset Sums
-
- Ninja’s Training
***DP
- Ninja’s Training
-
- Subset Sum Problem
**GFG
- Subset Sum Problem
-
- N meetings in one room
**GreedyGFG
- N meetings in one room
-
- Minimum Platforms
***GreedyGFG
- Minimum Platforms
-
- Top View of Binary Tree
***GFG
- Top View of Binary Tree
-
- Bottom View of Binary Tree
**GFG
- Bottom View of Binary Tree
-
- Mirror Tree
*GFG
- Mirror Tree
-
- Number of Provinces
***GFG
- Number of Provinces
-
- Minimum cost of choosing 3 increasing elements in an array of size N
***GFGPractise sometime later
- Minimum cost of choosing 3 increasing elements in an array of size N
-
- Find the number of islands
***8 directionsNumber of Islands - 4 directions
- Find the number of islands
-
- Largest BST
***GFG
- Largest BST
-
- Replace O's with X's
***GFG
- Replace O's with X's
-
- Number Of Enclaves
**GFG
- Number Of Enclaves
-
- Number of Distinct Islands
***GFG
- Number of Distinct Islands
-
- Bipartite Graph
***GFG
- Bipartite Graph
-
- Detect cycle in a directed graph
***GFG
- Detect cycle in a directed graph
-
- Topological sort
ImpGFG
- Topological sort
-
- Alien Dictionary
***
- Alien Dictionary
-
- Egg Dropping Puzzle
***GFGDP
- Egg Dropping Puzzle