# LeetCode ZigZag Conversion: 2 Different Angles

Analyze the solutions from two different angles to solve the LeetCode ZigZag Convension problem: from index of original string to zigzag one or vise verse.

Read More
Learn, Share, Inspire

Analyze the solutions from two different angles to solve the LeetCode ZigZag Convension problem: from index of original string to zigzag one or vise verse.

Read More
LeetCode Sqrt(x) with 4 methods of binary search, bit operation and numeric analysis ways (Newton's, Babylonian) are elaborated in detail here.

Read More
LeetCode Pow(x, n) could be solved both by binary search (recursive way) or bit decomposition (iterative way) useful tricks are given here too.

Read More
This LeetCode Pascal's Triangle problem is to test your array operation skills and to get the k-th row, we only need an extra array of size k + 1.

Read More
The two approaches (normal merge two list at a time and merge k list using Heap) are fully discussed and the complexity is analyzed. Plus, a trick to make the normal merge faster is given as well as the source code of the second method using heap.

Read More