# interview prep
[LeetCode] #142: Linked List Cycle II
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
Interview Question #2: Counting Sort
You are given with an unsorted int list and max_int_limit of the list. Sort the int list in time O(n).
[LeetCode] #743: Network Delay Time
Return the time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.
Interview Question #1: In-Place Shuffle
We will write a function that shuffles the list in-place.
[LeetCode] #103: Binary Tree Zigzag Level Order Traversal
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values.
[LeetCode] #102: Binary Tree Level Order Traversal
Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
[LeetCode] #112: Path Sum
Return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.
[LeetCode] #108: Convert Sorted Array to Binary Search Tree
Problem: Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.
[LeetCode] #111: Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.
[LeetCode] #49: Group Anagrams
Given an array of strings strs, group the anagrams together. You can return the answer in any order.
[LeetCode] #695: Max Area of Island
You are given an m x n binary matrix grid. An island is a group of 1's connected 4-directionally. Return the maximum area of an island in grid.
[LeetCode] #200: Number of Islands
Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
[LeetCode] #617: Merge Two Binary Trees
You are given two binary trees root1 and root2. Return the merged tree.
.png)
.png)
