Read the question here: https://leetcode.com/problems/minimum-cost-to-make-array-equal/description/ Let the final array be [k, k, k, k, ...] (all the elements being equal to k) k has to be in the range between min(nums) and max(nums) If we can try ...
So here I am, solving a few problems on Trees. And I stumbled upon this problem: Two Sum IV - Input is a BST. One approach can be to travel the nodes and hash the data in a set() and alongside check if the target-x (where x is the current node) is t...
Motivation Recently, I've been doing some problem-solving. Most of my peers do that in C++, but my preferred language is Python. I never felt that I had any issues in coding in Python because most of the stuff is there in Python as well, and like peo...
No cronjobs. No extra processes in your OS.Just simple sending scheduled notifications. Where I used this: Binge-o-PhiliaFor what: To send a reminder (notifications) of upcoming booked-movie. TLDR; I maintain a table at my back-end server to store s...
Tired of installing python versions in the system, creating virtual environments in projects, pip freeze-ing, maintainingrequirements.txt, I tried some tools last month: pipenv, pyenv and poetry TL;DR My old set-up: system-installed python versions +...
