Skip to content

Instantly share code, notes, and snippets.

View codingvideo's full-sized avatar
🎯
Focusing

codingvideo

🎯
Focusing
View GitHub Profile
import json;
def get_bills(amount):
leftover = amount
# for $100 bills
bills_100 = int( ( leftover - (leftover % 100) ) / 100 )
leftover = leftover % 100
# for $50 bills
bills_50 = int( ( leftover - (leftover % 50) ) / 50 )
leftover = leftover % 50
function getBills(amount){
let leftover = amount;
// for $100 bills
let bills_100 = ( leftover - (leftover % 100) ) / 100;
leftover = leftover % 100;
// for $50 bills
let bills_50 = ( leftover - (leftover % 50) ) / 50;
leftover = leftover % 50;
// for $20 bills
let bills_20 = ( leftover - (leftover % 20) ) / 20;
#include <fstream>
#include <iostream>
using namespace std;
int main(){
ifstream file("file.txt", ifstream::in);
char token;
while (file >> token){
cout << token << endl;
}
@codingvideo
codingvideo / practice_binary_to_int.java
Last active March 30, 2020 08:09
This code is part of a video tutorial - www.codingvideo.com
import java.lang.Math;
public class HelloWorld
{
public static void main(String[] args)
{
int output = binaryToInt("11010");
System.out.println(output);
}
@codingvideo
codingvideo / practice_binary_to_int.py
Last active March 30, 2020 07:47
This code is part of a video tutorial - www.codingvideo.com
def binary_to_int(digits):
last = len(digits) - 1
sum = 0
for i in range(0, len(digits)):
digit = int(digits[i])
exponent = last - i
multiplier = 2 ** exponent
integer = digit * multiplier
sum += integer
return sum
@codingvideo
codingvideo / practice_binary_to_decimal.js
Last active April 1, 2020 02:54
This code is part of a video tutorial - www.codingvideo.com
function binaryToDecimal(digits){
const last = digits.length - 1;
let sum = 0;
for(let i=0; i<digits.length; i++){
let digit = parseInt(digits[i]);
let exponent = last - i;
let multiplier = 2 ** exponent;
let decimal = digit * multiplier;
sum += decimal;
}
@codingvideo
codingvideo / practice_binary_to_int.rb
Last active March 30, 2020 07:46
This code is part of a video tutorial - www.codingvideo.com
def binary_to_int(digits)
last = digits.size - 1
sum = 0
(0..(digits.size-1)).each do |i|
digit = digits[i].to_i
exponent = last - i
multiplier = 2 ** exponent
integer = digit * multiplier
sum += integer
end
require 'minitest/autorun'
class Foo
def initialize(id, bar)
@id = id
@bar = bar
end
def update
@bar.log
<html>
<head>
<script src="https://code.jquery.com/jquery-3.3.1.min.js"></script>
<script src="https://unpkg.com/@popperjs/core@2"></script>
<script src="https://unpkg.com/tippy.js@6"></script>
<style>
.grid .box {
width:12px;
@codingvideo
codingvideo / quicksort-pseudocode
Created February 27, 2020 04:43
Pseudocode for a basic Quicksort implementation
function quicksort(data, first, last){
if(first < last){
mid = partition(data, first, last)
quicksort(data, first, mid-1)
quicksort(data, mid+1, last)
}
}
function partition(data, first, last){
pivot = data[first]