gatarelib

var countChange = function(money, coins) {
  return findComboCount(money, coins, 0);
}

function findComboCount(money, coin, index) {
  if(money === 0){
    return 1;
  }
  else if (money < 0 || coin.length == index) {
    return 0;

gatarelib

function numberToOrdinal(n) {

  if (n==0) {
    return n;
}
var j = n % 10,
    k = n % 100;
   

if (j == 1 && k != 11) {

gatarelib

function mySort(nums) {
  let evens = [];
  let odds = [];

  for (let i = 0; i < nums.length; i++) {
    if(typeof nums[i] === "number"){
      if ((nums[i] % 2) === 1) {
          odds.push(parseInt(nums[i]));
      }
      else {

gatarelib

const digitize = (n) => {
        r = n.toString().split('');
        r.forEach((el, i, a) => { a[i] = parseInt(el); })
        return r
}
digitize(715)  // [7, 1, 5]

gatarelib

class User {
  constructor(name) {
   this._name = name;
   this._loggedIn = false;
   this._lastLoggedInAt = null;
  }
  isLoggedIn() {
    return this._loggedIn;
  }
  getLastLoggedInAt() {

gatarelib

# Insertion Sort In Python
# 
# Performance Complexity = O(n^2)
# Space Complexity = O(n)

def insertionSort(my_list):
    # for every element in our array
    for index in range(1, len(my_list)):
        current = my_list[index]
        position = index

gatarelib

# Insertion Sort In Python
# 
# Performance Complexity = O(n^2)
# Space Complexity = O(n)

def insertionSort(my_list):
    # for every element in our array
    for index in range(1, len(my_list)):
        current = my_list[index]
        position = index