Tutorial by Examples: bas

To get started we need a factory that produces WebClients. public class ClientFactory { private Map<String, WebClient> cache = new HashMap<>(); public enum RESTClient { PORTAL; } public WebClient fetchRestClient(RESTClient restClient) { if (th...

Catalan numbers algorithm is Dynamic Programming algorithm. In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively-defined objects. The Catalan numbers on nonnegative integers n are a set of numbers t...

The partition of an integer is a way of writing it as a sum of positive integers. For example, the partitions of the number 5 are: 5 4 + 1 3 + 2 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1 Notice that changing the order of the summands will not create a different partition. The partition f...

First, you need to install Firebase tools. Simply, run the commands below: Npm Package manager npm install -g firebase-tools or Yarn package manager yarn add firebase-tools To configure your application to be ready to deploy you need to run the following in your app’s root directory: fire...

Shell sort, also known as the diminishing increment sort, is one of the oldest sorting algorithms, named after its inventor Donald. L. Shell (1959). It is fast, easy to understand and easy to implement. However, its complexity analysis is a little more sophisticated. The idea of Shell sort is the f...

This is a basic tslint.json setup which prevents use of any requires curly braces for if/else/for/do/while statements requires double quotes (") to be used for strings { "rules": { "no-any": true, "curly": true, "quotema...

Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more c...

This source code create a simple key/value store service based on map Erlang datastructure. Firstly, we need to define all information concerning our gen_server: -module(cache). -behaviour(gen_server). % our API -export([start_link/0]). -export([get/1, put/2, state/0, delete/1, stop/0]). %...

Getting You Browser Ready - Polyfill it Create a new landing page for our element, at index.html. Include polyfills for a custom element to work.Also import the custom element g-map, which we registered with Polymer. Note: Webcomponents, are the necessary polyfill for browser support. Polym...

With Class-Based Views, we use classes instead of methods to implement our views. A simple example of using Class-Based Views looks as follows: from flask import Flask from flask.views import View app = Flask(__name__) class HelloWorld(View): def dispatch_request(self): ret...

Pancake Sort is a the colloquial term for the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the stack and used to flip all pancakes above it. A pancake number is the minimum number of flips required for a given number o...

To connect to a mongo database from node application we require mongoose. Installing Mongoose Go to the toot of your application and install mongoose by npm install mongoose Next we connect to the database. var mongoose = require('mongoose'); //connect to the test database running on defau...

First Execute CREATE EXTENSION DBLINK; Then INSERT INTO <SCHEMA_NAME>.<TABLE_NAME_1> SELECT * FROM DBLINK( 'HOST=<IP-ADDRESS> USER=<USERNAME> PASSWORD=<PASSWORD> DBNAME=<DATABASE>', 'SELECT * FROM <SCHEMA_NAME>.<TABLE_NAME_2...

Aliases are named shortcuts of commands, one can define and use in interactive bash instances. They are held in an associative array named BASH_ALIASES. To use this var in a script, it must be run within an interactive shell #!/bin/bash -li # note the -li above! -l makes this behave like a login s...

The Longest Increasing Subsequence problem is to find subsequence from the give input sequence in which subsequence's elements are sorted in lowest to highest order. All subsequence are not contiguous or unique. Application of Longest Increasing Subsequence: Algorithms like Longest Increasing Subs...

'Base string Dim exStr : exStr = " <Head>data</Head> " 'Left Dim res: res = Left(exStr,6) 'res now equals " <Head" 'Right Dim res: res = Right(exStr,6) 'res now equals "Head> " 'Mid Dim res: res = Mid(exStr,8,4) 'res now equals "data&quot...

(This assumes MySQL has been installed and that sudo is being used.) Generating a CA and SSL keys Make sure OpenSSL and libraries are installed: apt-get -y install openssl apt-get -y install libssl-dev Next make and enter a directory for the SSL files: mkdir /home/ubuntu/mysqlcerts cd /home...

To add the BottomNavigationView follow these steps: Add in your build.gradle the dependency: compile 'com.android.support:design:25.1.0' Add the BottomNavigationView in your layout: <android.support.design.widget.BottomNavigationView xmlns:android="http://schemas.andro...

Maximum Path Sum is an algorithm to find out a path such that sum of element(node) of that path is greater than any other path. For example, let's we have a we a triangle as shown below. 3 7 4 2 4 6 8 5 9 3 In above triangle, find the maximum path which has ma...

Maximum subarray problem is the method to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum. The problem was originally proposed by Ulf Grenander of Brown University in 1977, as a simplified model for maximum likelihood estimation of patterns in digiti...