Pooja DasWord loudYou want to build a word cloud, an infographic where the size of a word corresponds to how often it appears in the body of text.Aug 11Aug 11
Pooja DasGreedy AlgorithmsA greedy algorithm builds up a solution by choosing the option that looks the best at every step.Aug 11Aug 11
Pooja DasBottom-Up AlgorithmsGoing bottom-up is a way to avoid recursion, saving the memory cost that recursion incurs when it builds up the call stack.Aug 11Aug 11
Pooja DasMemoizationMemoization ensures that a method doesn’t run for the same inputs more than once by keeping a record of the results for the given inputs…Aug 11Aug 11
Pooja DasOverlapping SubproblemsA problem has overlapping subproblems if finding its solution involves solving the same subproblem multiple times.Aug 11Aug 11
Pooja DasYou are a renowned thief who has recently switched from stealing precious metals to stealing cakes…While Queen Elizabeth has a limited number of types of cake, she has an unlimited supply of each type.Aug 11Aug 11
Pooja DasWrite a method to see if a binary tree ↴ is “superbalanced” (a new tree property we just made up)A tree is “superbalanced” if the difference between the depths of any two leaf nodes ↴ is no greater than one.Aug 11Aug 11
Pooja DasWrite a method to check that a binary tree is a valid binary search tree.Here’s a sample binary tree node class:Aug 11Aug 11