DSA
🌙 Problem Statement: Given two strings a and b, return the minimum number of times you should repeat string a so that string b…
🌙 Problem Statement: Given two strings a and b, return…
🌙 Problem Statement: The count-and-say sequence is a sequence of…
Problem Statement: Given the root of a binary tree, return its maximum depth. A binary…
Problem Statement: Given the root of a binary tree, return the level order traversal of…
Problem Statement: Given the root of a binary tree, return the level order traversal of…
DFS and BFS in Binary Tree: DFS: Depth First Search DFS explores a tree by…
🌙 Problem Statement: Given the root of a binary tree, return the postorder traversal of…
🌙 Problem Statement: Given the root of a binary tree, return the inorder traversal of…
Explore
