- Merge Strings Alternately
- find min, loop over string and add the rest using res.append([word1[min:], word[min:]])
- GCD of string
- loop min(len1,len2), 0, -1 -> check if its a valid gcd | valid gcd -> if len1, len2 is divisible and base * n1 = str1, base * n2 = str2
- Move all zeros to end
- loop over array, maintain pointer for zeros. for each non-zero, swap the array and increment the zeroPtr
- Is SubSequence
- loop over main string, maintain pointer for matching chars, if s[ptr] == t[i] => ptr += 1, return true if ptr == len(s)
- Container water distance
- left and right index of array, calc current area and maintain gobal area max for each step. and update the idx based on max left and righ value
- find max depth of the Tree
- recursive -> return 1 + max(self.maxDepth(left), self.maxDepth(right))
- iter -> use stack to store node and depth, find max(depth) and add child to stack
- check leaf similarity of two tree
- calc leaf using dfs find_leaf(node, leaf) -> if not node.left and not node.right -> leaf.append(node.val) find_leaf(node.left, leaf) find_leaf(node.right, leaf)
- good nodes
- use dfs with recursive and keep track of maxValue. return the good nodes
- right side view of tree
- use queue with node and level, and maintain previous_level. while traversing if not level != previous_level and add to res, add right to queue before left
- max level sum
- with queue, maintain maxsum, res, inside while queue: loop through all element [which is the current level]. calc maxSum and currSum
- Search BST
- general bst search using recursion
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent