Valentin Podkamennyi vpodk

## numbers.js
var n = 1;
console.log(n.toFixed(2));
// To change the number directly:
// 1. Use parentheses:
console.log((1).toFixed(2));
// 2. Use two dots:
console.log(1..toFixed(2));

// Number binary representation:
console.log(20..toString(2));

## factorial.js
/**
 * Computes the factorial of a given non-negative integer using iterative solution.
 * @param {number} n The positive integer.
 * @return {number} Returns a factorial of 'n'.
 * @see https://en.wikipedia.org/wiki/Factorial
 */
function factorial(n) {
  var result = 1;

  for (var i = 1; i <= n; ++i) {

## fibonacci.js
/**
 * +------------------------------------+
 * |           FIBONACCI TABLE          |
 * +------------------------------------+
 * | n   0 | 1 | 2 | 3 | 4 | 5 | 6 |  7 |
 * | xn  0 | 1 | 1 | 2 | 3 | 5 | 8 | 13 |
 * +------------------------------------+
 *
 * @see https://en.wikipedia.org/wiki/Big_O_notation
 * @see https://en.wikipedia.org/wiki/Fibonacci_number#Sequence_properties

## komito-analytics.html
<script src="https://komito.net/komito.js" async></script>

<script>
// The default configuration can be omitted and only changed properties can be included.
var _komito = _komito || {
  'trackTwitter': 1,     // Tracks Twitter events if widget is presented on page.
  'trackFacebook': 1,    // Tracks Facebook events if widget is presented on page.
  'trackLinkedIn': 1,    // Tracks LinkedIn events if plugin is presented on page.
  'trackDownloads': 1,   // Tracks files download links.
  'trackOutbound': 1,    // Tracks outbound links.

## merge-sorted-arrays.js
/**
 * Merge two sorted integer arrays nums1 and nums2 into nums1, sorted in non-decreasing order.
 * The time complexity of this function is O(m + n),
 * @param {number[]} nums1 The first sorted array containing elements to be merged.
 * @param {number} m The number of elements in nums1 (excluding additional space for merging).
 * @param {number[]} nums2 The second sorted array containing elements to be merged into nums1.
 * @param {number} n The number of elements in nums2.
 * @see https://leetcode.com/problems/merge-sorted-array/
 */
var merge = function(nums1, m, nums2, n) {

## clap-layout-flex.css
* {
  box-sizing: border-box;
  margin: 0;
  padding: 0;
}

body {
  display: flex;
  flex-direction: column;
  min-height: 100vh;

## clap-layout-index.html
<body>
  <header>Header</header>
  <div id="main">
    <article>Content</article>
    <aside>Left sidebar</aside>
    <aside>Right sidebar</aside>
  </div>
  <footer>Footer</footer>
</body>

## clap-layout-flex-update.css
aside, footer, header, #main > article {
  padding: 1em;
}

## clap-layout-theme.css
body {
  background-color: White;
  color: DarkSlateGray;
}
header,
footer {
  background-color: Indigo;
  color: White;
}
#main > aside {

## clap-positions-app.css
body {
  font-family: arial, sans-serif;
  -webkit-font-smoothing: antialiased;
}

#main {
  margin: 5em auto 0;
}

header,
	var n = 1;
	console.log(n.toFixed(2));
	// To change the number directly:
	// 1. Use parentheses:
	console.log((1).toFixed(2));
	// 2. Use two dots:
	console.log(1..toFixed(2));

	// Number binary representation:
	console.log(20..toString(2));
	/**
	* Computes the factorial of a given non-negative integer using iterative solution.
	* @param {number} n The positive integer.
	* @return {number} Returns a factorial of 'n'.
	* @see https://en.wikipedia.org/wiki/Factorial
	*/
	function factorial(n) {
	var result = 1;

	for (var i = 1; i <= n; ++i) {
	/**
	* +------------------------------------+
	* \| FIBONACCI TABLE \|
	* +------------------------------------+
	* \| n 0 \| 1 \| 2 \| 3 \| 4 \| 5 \| 6 \| 7 \|
	* \| xn 0 \| 1 \| 1 \| 2 \| 3 \| 5 \| 8 \| 13 \|
	* +------------------------------------+
	*
	* @see https://en.wikipedia.org/wiki/Big_O_notation
	* @see https://en.wikipedia.org/wiki/Fibonacci_number#Sequence_properties
	<script src="https://komito.net/komito.js" async></script>

	<script>
	// The default configuration can be omitted and only changed properties can be included.
	var _komito = _komito \|\| {
	'trackTwitter': 1, // Tracks Twitter events if widget is presented on page.
	'trackFacebook': 1, // Tracks Facebook events if widget is presented on page.
	'trackLinkedIn': 1, // Tracks LinkedIn events if plugin is presented on page.
	'trackDownloads': 1, // Tracks files download links.
	'trackOutbound': 1, // Tracks outbound links.
	/**
	* Merge two sorted integer arrays nums1 and nums2 into nums1, sorted in non-decreasing order.
	* The time complexity of this function is O(m + n),
	* @param {number[]} nums1 The first sorted array containing elements to be merged.
	* @param {number} m The number of elements in nums1 (excluding additional space for merging).
	* @param {number[]} nums2 The second sorted array containing elements to be merged into nums1.
	* @param {number} n The number of elements in nums2.
	* @see https://leetcode.com/problems/merge-sorted-array/
	*/
	var merge = function(nums1, m, nums2, n) {
	* {
	box-sizing: border-box;
	margin: 0;
	padding: 0;
	}

	body {
	display: flex;
	flex-direction: column;
	min-height: 100vh;
	<body>
	<header>Header</header>
	<div id="main">
	<article>Content</article>
	<aside>Left sidebar</aside>
	<aside>Right sidebar</aside>
	</div>
	<footer>Footer</footer>
	</body>
	body {
	background-color: White;
	color: DarkSlateGray;
	}
	header,
	footer {
	background-color: Indigo;
	color: White;
	}
	#main > aside {
	body {
	font-family: arial, sans-serif;
	-webkit-font-smoothing: antialiased;
	}

	#main {
	margin: 5em auto 0;
	}

	header,