LeetCode – Arrays – Find the Distance Value Between Two Arrays
Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the number of elements arr1…
LeetCode – Strings – Is Subsequence
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and…
LeetCode – Strings – Remove Palindromic Subsequence
Given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s. Return the minimum number of steps to…
LeetCode – Strings – Minimum Number of Steps to Make Two Strings Anagram
Given two equal-size strings s and t. In one step you can choose any character of t and replace it with another character. Return the minimum number of steps to…
LeetCode – LinkedList – Split Linked List in Parts
Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list “parts”. The length of each part should be…
LeetCode – LinkedList – Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in…
LeetCode – Strings – Compare Strings by Frequency of the Smallest Character
Let’s define a function f(s) over a non-empty string s, which calculates the frequency of the smallest character in s. For example, if s = "dcce" then f(s) = 2…
Dockerize a Flask Web Application
In my previous post, I have shown you how to build a basic Flask application, now lets dockerize the application. You can follow the Django 3.0 application which we will…
How to build a basic Flask Application
This tutorial will explain the step by step procedure on building a basic Flask application. Flask can be defined as a lightweight WSGI web application framework. It’s quick and easy…
LeetCode – LinkedList – Next Greater Node In Linked List
We are given a linked list with head as the first node. Let’s number the nodes in the list: node_1, node_2, node_3, ... etc. Each node may have a next…