aprilmintacpineda

/**
 * NOTE from the developer:
 * You only need to manipulate the codes inside the main function, the rest of the codes are
 * the core functionality of the program and requires no refactoring
 */

import java.util.Random;

public class TestSuite {
	public static void main(String [] args) {

aprilmintacpineda

# NOTE from the developer:
# You only need to manipulate the codes BELOW, the rest of the codes
# are the core functionality of the program and requires no refactoring

import time
import math
from random import randint

# generates random data for testing purpose
def generateRandomTestData(dataLength, maxNumber):

aprilmintacpineda

<?php

$ten = 10;
$hundred = 100;
$thousand = 1000;
$ten_thousand = 10000;
$hundred_thousand = 100000;
$million = 1000000;

// very self-explanatory

aprilmintacpineda

var ten = 10,
		hundred = 100,
		thousand = 1000,
		ten_thousand = 10000,
		hundred_thousand = 100000,
		million = 1000000;

// very self-explanatory
// int numberOfTests, int max, int dataLength, boolean showSortedArray = false, runTest = true
doIt(ten, million, million);

aprilmintacpineda

function longestConsecutiveSubstr(str) {
	var longestConsecutiveSubstr = '';
	var leftOff = 1;

	for (var a = 0; a < str.length - 1; a = leftOff) {
		var newLongestConsecutiveSubstr = '';

		for (var b = a + 1; b < str.length; b++) {
			if (str[a] == str[b]) {
				newLongestConsecutiveSubstr += str[a];

aprilmintacpineda

Bubble Sort pseudocode

Bubble sort is composed of two loops, one inside the other, the idea is to push the largest number on the right most side of the list, one by one.

Key factors

For the sake of discussion, we'll call a the outer loop and b the inner loop.

• a starts at list.length - 1, last step occurs at 0.
• b starts at 0, last step occurs at a - 1, i.e., if a = 3, then last step of b would be 2.

aprilmintacpineda

Fun with strings!

Longest Common Substring & longest consecutive substring

The idea here is to get the longest common substring of two or more strings. For example, given the strings Heeeeeeeelllllloooo and teeeeeeeestoooo, it will return the string eeeeeeee, because it is the longest common string of the two.

• See Javascript implementation.

Criteria for deciding if a string is the longest commong substring.

aprilmintacpineda

#! /bin/bash

# ECHO COMMAND
# echo Hello World!

# VARIABLES
# Uppercase by convention
# Letters, numbers, underscores
NAME="Bob"
# echo "My name is $NAME"

aprilmintacpineda

People

:bowtie:	😄 :smile:	😆 :laughing:
😊 :blush:	😃 :smiley:	☺️ :relaxed:
😏 :smirk:	😍 :heart_eyes:	😘 :kissing_heart:
😚 :kissing_closed_eyes:	😳 :flushed:	😌 :relieved:
😆 :satisfied:	😁 :grin:	😉 :wink:
😜 :stuck_out_tongue_winking_eye:	😝 :stuck_out_tongue_closed_eyes:	😀 :grinning:
😗 :kissing:	😙 :kissing_smiling_eyes:	😛 :stuck_out_tongue:

aprilmintacpineda

Looping through elements

http://jsben.ch/UgRvN

• Accesses length property every loop.
• Accesses length property only once and saves it into a constant.
• Uses forEach method.

Removing an element of an array