#### How to Dockerize a Django 3.0 Web Application

We will dockerize a Django web application in this post and for this we will consider the django application which we built in the previous post. In my previous post,…

Skip to content
# Month: April 2020

#### How to Dockerize a Django 3.0 Web Application

#### LeetCode – Tree – Invert Binary Tree

#### LeetCode – Tree – Leaf-Similar Trees

#### LeetCode – Tree -Sum of Root To Leaf Binary Numbers

#### How to build a basic Django 3.0 application

#### LeetCode – Arrays – Lucky Integer in an Array

#### LeetCode – Arrays – Find the Distance Value Between Two Arrays

#### LeetCode – Strings – Is Subsequence

#### LeetCode – Strings – Remove Palindromic Subsequence

#### LeetCode – Strings – Minimum Number of Steps to Make Two Strings Anagram

#### You missed

We will dockerize a Django web application in this post and for this we will consider the django application which we built in the previous post. In my previous post,…

Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9…

Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given tree above, the leaf value…

Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 ->…

There are various python web frameworks and Django is one of the most popular ones. If we compare Django with Flask, we can say full-stack vs lightweight. If you want…

Given an array of integers arr, a lucky integer is an integer which has a frequency in the array equal to its value. Return a lucky integer in the array. If there are…

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[i] such that there is not any element arr2[j] where |arr1[i]-arr2[j]| <=…

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 t. t is potentially a very long (length ~= 500,000) string,…

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 make the given string empty. A string is a subsequence…

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 make t an anagram of s. An Anagram of a string is a string that contains the…