Leetcode Day 12 - Binary Tree: Tree Structure and Depth
Involves manipulating binary tree structures, such as inverting a binary tree and determining symmetry. Also covers finding the maximum and minimum depth of a tree.
Involves manipulating binary tree structures, such as inverting a binary tree and determining symmetry. Also covers finding the maximum and minimum depth of a tree.
Focuses on binary tree level order traversal techniques, including regular, N-ary tree, and right-side view traversals. Also calculates averages at each tree level.
Write down description here.
Supervised Learning with scikit-learn
Description: Explores advanced applications of stacks and queues, such as evaluating reverse Polish notation, finding the maximum in a sliding window, and using heaps/queues to find the top K frequ...
Focuses on basic stack and queue operations, including implementing one data structure using the other. Also covers classic stack usage in problems like validating parentheses and removing adjacent...
Algorithm for pattern matching
Involves more advanced string operations, such as reversing the order of words, finding the first occurrence of a substring, identifying repeated patterns, and handling right-handed string manipula...
Description: Focuses on basic string reversal techniques and simple string manipulations. Includes reversing strings and segments of strings, along with replacing numbers in a string.
Focuses on more complex problems involving hash tables, such as multi-array sum combinations (4Sum II, 3Sum, 4Sum) and validating ransom note creation. These problems require more intricate use of ...