Just adding daily coding problem that I solve
- Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i,(Problem_2.cs.)
- Given an array of integers, find the first missing positive integer in linear time and constant space.In other words, find the lowest positive integer that does not exist in the array.The array can contain duplicates and negative numbers as well,(Problem_3.cs).
- Given the root to a binary tree, implement serialize(root), which serializes the tree into a string, and deserialize(s), which deserializes the string back into the tree,(Problem_4.cs).