# 2. Divisors + Rabin-Karp

Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. …

# Populating Next Right Pointers in Each Node

`struct Node {  int val;  Node *left;  Node *right;  Node *next;}`

# OVERVIEW BFS, Recursive DFS with Example : Binary Tree Right Side View

`Input: [1,2,3,null,5,null,4]Output: [1, 3, 4]Explanation:   1            <--- /   \2     3         <--- \     \  5     4       <---`

# Sum of left children — Preorder traversal

`    3   / \  9  20    /  \   15   7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.`
`#…`

# Binary Tree Zigzag Level Order Traversal

1. Its good to point out the differences in the space complexity of the BFS (using…

# Problem

Top view of a binary tree is the set of nodes visible when the tree…

# Tree : Level-Order-Traversal or Breath-First-Search

## Technical Interviews Preparation

Currently preparing for interviews

Get the Medium app