Welcome to part 1 of writing python like a pro. This series is definitely part of the advanced python series. It assumes you already know python and are definitely comfortable with it. However, you are a person who wants to know how you can up your python game. You want Read more…
In this series, we would focus on some of the language-agnostic parts which can be used to improve your ability to write cleaner code in any language. So let’s dive right into the SOLID concepts of object-oriented design. S.O.L.I.D is an acronym for the first five object-oriented design(OOD) principles by Robert C. Read more…
Writing clean code is more of an art rather than a science. So What really makes code cleaner?. In this series called Clean Code Concepts, we investigate some of the ways to write code in a clean way. There are several aspects to write cleaner code, some are language agnostic Read more…
Dynamic typing Majority of people have a single problem with a python feature and drumrolls it’s Ducktyping. In short “If it walks like a duck and it quacks like a duck, then it must be a duck”. I agree that this could be a case of lot of bugs if Read more…
Here is part 2 of the numpy tutorial. This is a continuation of part 1 of the numpy tutorial.
Numpy is one of the most important data science libraries. This is part 1 of the numpy tutorial. Loading Sorry, something went wrong. Reload? Sorry, we cannot display this file. Sorry, this file is invalid so it cannot be displayed. Viewer requires iframe. view raw numpy_tutorial_part1.ipynb hosted with ❤ Read more…
Question Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = “ADOBECODEBANC”, T = “ABC” Output: “BANC” Note: If there is no such window in S that covers all characters in Read more…