Leetcode Problem 32: Trapping Rain Water in go

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example: Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6… Read more »

Multiprocessing vs. Threading in Python: What Every Data Scientist Needs to Know

Sooner or later, every data science project faces an inevitable challenge: speed. Working with larger data sets leads to slower processing thereof, so you’ll eventually have to think about optimizing… Read more »