# Create company_1
company_1 = 'Apple'
print(company_1)
# Create year_1
year_1 = 2017
print(year_1)
# Create revenue_1
revenue_1 = 229.23
print(revenue_1)
Quotes help make search much faster. Example: "Practice Makes Perfect"
Showing posts with label Sample solution. Show all posts
Showing posts with label Sample solution. Show all posts
Thursday, August 29, 2019
Tuesday, May 16, 2017
FreeCodeCamp Wherefore Art Thou Sample Solution
function whatIsInAName(collection, source) {
// What's in a name?
var arr = [];
// Only change code below this line
//return Object.keys(source);
var sourceKeys = Object.keys(source);
var sourceValues = Object.values(source);
for(var i=0; i<collection.length; i++){
var collectionKeys = Object.keys(collection[i]);
var collectionValues = Object.values(collection[i]);
var allKeysTrue = true;
var allValuesTrue = true;
for(var j=0; j<sourceKeys.length; j++){
if(!collectionKeys.toString().includes(sourceKeys[j].toString())){
allKeysTrue = false;
}
if(!collectionValues.toString().includes(sourceValues[j].toString())){
allValuesTrue = false;
}
}
if(allKeysTrue && allValuesTrue){
arr.push(collection[i]);
}
}
// Only change code above this line
return arr;
}
whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" });
FreeCodeCamp Everything Be True Sample Solution
function truthCheck(collection, pre) {
// Is everyone being true?
var test = true;
for(var i=0; i<collection.length; i++){
if(pre in collection[i]){
if(!collection[i][pre]){
test = false;
break;
}
} else {
test = false;
break;
}
}
return test;
}
truthCheck([{"user": "Tinky-Winky", "sex": "male", "age": 0}, {"user": "Dipsy", "sex": "male", "age": 3}, {"user": "Laa-Laa", "sex": "female", "age": 5}, {"user": "Po", "sex": "female", "age": 4}], "age");
Monday, May 15, 2017
FreeCodeCamp Binary Agents Sample Solution
function binaryAgent(str) {
var arr = str.split(" ");
var arr2 = [];
for(var i=0; i<arr.length; i++){
arr2.push(String.fromCharCode(parseInt(arr[i], 2)));
}
return arr2.join("");
}
binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111");
FreeCodeCamp Steamroller Sample Solution
function steamrollArray(arr) {
// I'm a steamroller, baby
var flattened = arr.reduce(
function(a, b) {
return a.concat(Array.isArray(b) ? steamrollArray(b) : b);
},[]);
return flattened;
}
steamrollArray([[["a"]], [["b"]]]);
Saturday, May 13, 2017
FreeCodeCamp Drop It Sample Solution
function dropElements(arr, func) {
// Drop them elements.
for(var i=0; i<arr.length; i++){
if([arr[i]].filter(func)>0){
return arr.slice(i,arr.length);
}
}
return [];
}
dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;});
// Drop them elements.
for(var i=0; i<arr.length; i++){
if([arr[i]].filter(func)>0){
return arr.slice(i,arr.length);
}
}
return [];
}
dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;});
FreeCodeCamp Finders Keepers Sample Solution
function findElement(arr, func) {
var filtered = arr.filter(func);
return filtered[0];
}
findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; });
var filtered = arr.filter(func);
return filtered[0];
}
findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; });
FreeCodeCamp Sum All Primes Sample Solution
function isPrime(value) {
for(var i = 2; i < value; i++) {
if(value % i === 0) {
return false;
}
}
return true;
}
function genPrimeArr(num){
var arr = [];
for(var i=2; i<=num; i++){
if(isPrime(i)){
arr.push(i);
}
}
return arr;
}
function sumArr(arr){
var sum = 0;
for(var i=0; i<arr.length; i++){
sum += arr[i];
}
return sum;
}
function sumPrimes(num) {
return sumArr(genPrimeArr(num));
}
sumPrimes(10);
for(var i = 2; i < value; i++) {
if(value % i === 0) {
return false;
}
}
return true;
}
function genPrimeArr(num){
var arr = [];
for(var i=2; i<=num; i++){
if(isPrime(i)){
arr.push(i);
}
}
return arr;
}
function sumArr(arr){
var sum = 0;
for(var i=0; i<arr.length; i++){
sum += arr[i];
}
return sum;
}
function sumPrimes(num) {
return sumArr(genPrimeArr(num));
}
sumPrimes(10);
FreeCodeCamp Sum All Odd Fibonacci Numbers Sample Solution
function generateFibSeq(num){
var arr=[1,1];
while(num > arr[arr.length-1]){
if(arr[arr.length-1]+arr[arr.length-2] > num){
break;
}
arr.push(arr[arr.length-1]+arr[arr.length-2]);
}
return arr;
}
function sumFibs(num) {
if(num===1){
return 1;
}
var fibArr = generateFibSeq(num);
var sum = 0;
for(var i in fibArr){
if(fibArr[i]%2 !== 0){
sum += fibArr[i];
}
}
return sum;
}
sumFibs(75025);
var arr=[1,1];
while(num > arr[arr.length-1]){
if(arr[arr.length-1]+arr[arr.length-2] > num){
break;
}
arr.push(arr[arr.length-1]+arr[arr.length-2]);
}
return arr;
}
function sumFibs(num) {
if(num===1){
return 1;
}
var fibArr = generateFibSeq(num);
var sum = 0;
for(var i in fibArr){
if(fibArr[i]%2 !== 0){
sum += fibArr[i];
}
}
return sum;
}
sumFibs(75025);
FreeCodeCamp Spinal Tap Case Sample Solution
function spinalCase(str) {
var str2 = str.replace(/([a-z](?=[A-Z]))/g,'$1 ');
var newStr = str2.replace(/\s|\x5F/g,"-");
return newStr.toLowerCase();
}
spinalCase("AllThe-small Things");
var str2 = str.replace(/([a-z](?=[A-Z]))/g,'$1 ');
var newStr = str2.replace(/\s|\x5F/g,"-");
return newStr.toLowerCase();
}
spinalCase("AllThe-small Things");
FreeCodeCamp Convert HTML Entities Sample Solution
function convertHTML(str) {
// :)
var htmlCode = {
"&":"&",
"<":"<",
">":">",
"\"":""",
"'":"'"
};
var arrayStr = str.split('');
for(var i in arrayStr){
for(var j in htmlCode){
if(arrayStr[i] == j){
arrayStr[i] = htmlCode[j];
}
}
}
return arrayStr.join('');
}
convertHTML("Dolce & Gabbana");
// :)
var htmlCode = {
"&":"&",
"<":"<",
">":">",
"\"":""",
"'":"'"
};
var arrayStr = str.split('');
for(var i in arrayStr){
for(var j in htmlCode){
if(arrayStr[i] == j){
arrayStr[i] = htmlCode[j];
}
}
}
return arrayStr.join('');
}
convertHTML("Dolce & Gabbana");
FreeCodeCamp Sorted Union Sample Solution
function uniteUnique(arr) {
var args = Array.prototype.slice.call(arguments);
var newArr = [];
for(var i=0; i<args.length; i++){
for(var j=0; j<args[i].length; j++){
newArr.push(args[i][j]);
}
}
var uniqueArray = newArr.filter(function(item, pos) {
return newArr.indexOf(item) == pos;
});
return uniqueArray;
}
uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);
FreeCodeCamp Missing Letters Sample Solution
function fearNotLetter(str) {
var arr = str.split('');
var codes = [];
for(var i=0; i<arr.length; i++){
codes.push(arr[i].charCodeAt(0));
}
for(var j=0; j<codes.length; j++){
if(codes[j] != codes[0]+j){
return String.fromCharCode(codes[0]+j);
}
}
return undefined;
}
fearNotLetter("abce");
var arr = str.split('');
var codes = [];
for(var i=0; i<arr.length; i++){
codes.push(arr[i].charCodeAt(0));
}
for(var j=0; j<codes.length; j++){
if(codes[j] != codes[0]+j){
return String.fromCharCode(codes[0]+j);
}
}
return undefined;
}
fearNotLetter("abce");
FreeCodeCamp DNA Pairing Sample Solution
function pairElement(str) {
var pairs = {
'G':'C',
'C':'G',
'A':'T',
'T':'A'
};
var arr = str.split("");
var arrPairs = [];
for(var i=0; i<arr.length; i++){
arrPairs.push([arr[i],pairs[arr[i]]]);
}
return arrPairs;
}
pairElement("GCG");
var pairs = {
'G':'C',
'C':'G',
'A':'T',
'T':'A'
};
var arr = str.split("");
var arrPairs = [];
for(var i=0; i<arr.length; i++){
arrPairs.push([arr[i],pairs[arr[i]]]);
}
return arrPairs;
}
pairElement("GCG");
FreeCodeCamp Pig Latin Sample Solution
function vowelCheck(str,index){
if(str[index]=='a' || str[index]=='e' || str[index]=='i' || str[index]=='o' || str[index]=='u'){
return true;
}
}
function translatePigLatin(str) {
//vowel case
str = str.toLowerCase();
var arr = [];
var indexCount = 0;
if(vowelCheck(str,0)){
return str+"way";
} else {
arr.push(str[0]);
indexCount++;
for(var i=1; i<str.length; i++){
if(!vowelCheck(str,i)){
arr.push(str[i]);
indexCount++;
} else {
break;
}
}
return str.substr(indexCount,str.length)+arr.join('')+"ay";
}
return arr;
}
translatePigLatin("consonant");
if(str[index]=='a' || str[index]=='e' || str[index]=='i' || str[index]=='o' || str[index]=='u'){
return true;
}
}
function translatePigLatin(str) {
//vowel case
str = str.toLowerCase();
var arr = [];
var indexCount = 0;
if(vowelCheck(str,0)){
return str+"way";
} else {
arr.push(str[0]);
indexCount++;
for(var i=1; i<str.length; i++){
if(!vowelCheck(str,i)){
arr.push(str[i]);
indexCount++;
} else {
break;
}
}
return str.substr(indexCount,str.length)+arr.join('')+"ay";
}
return arr;
}
translatePigLatin("consonant");
FreeCodeCamp Search and Replace Sample Solution
function myReplace(str, before, after) {
var test = '/'+ before +'/';
//return after;
if(before[0] == before[0].toUpperCase()){
var firstLetter = after.split('').splice(0,1);
var restOfTheWord = after.split('').splice(1,after.length).join('');
after = firstLetter[0].toUpperCase()+restOfTheWord;
}
var newstr = str.split(before).join(after);
return newstr;
}
myReplace("He is Sleeping on the couch", "Sleeping", "sitting");
FreeCodeCamp Roman Numeral Converter Sample Solution
function convertToRoman(num) {
var chart = {
0:'',
1:'I',
2:'II',
3:'III',
4:'IV',
5:'V',
6:'VI',
7:'VII',
8:'VIII',
9:'IX',
10:'X',
20:'XX',
30:'XXX',
40:'XL',
50:'L',
60:'LX',
70:'LXX',
80:'LXXX',
90:'XC',
100:'C',
200:'CC',
300:'CCC',
400:'CD',
500:'D',
600:'DC',
700:'DCC',
800:'DCCC',
900:'CM',
1000:'M',
2000:'MM',
3000:'MMM'
};
var numString = num.toString().split('');
if(numString.length == 1){
return chart[parseInt(numString[0])];
} else if(numString.length == 2){
return chart[parseInt(numString[0])*10]+chart[parseInt(numString[1])];
} else if(numString.length == 3){
return chart[parseInt(numString[0])*100]+
chart[parseInt(numString[1])*10]+
chart[parseInt(numString[2])];
} else if(numString.length == 4){
return chart[parseInt(numString[0])*1000]+
chart[parseInt(numString[1])*100]+
chart[parseInt(numString[2])*10]+
chart[parseInt(numString[3])];
}
}
convertToRoman(2);
var chart = {
0:'',
1:'I',
2:'II',
3:'III',
4:'IV',
5:'V',
6:'VI',
7:'VII',
8:'VIII',
9:'IX',
10:'X',
20:'XX',
30:'XXX',
40:'XL',
50:'L',
60:'LX',
70:'LXX',
80:'LXXX',
90:'XC',
100:'C',
200:'CC',
300:'CCC',
400:'CD',
500:'D',
600:'DC',
700:'DCC',
800:'DCCC',
900:'CM',
1000:'M',
2000:'MM',
3000:'MMM'
};
var numString = num.toString().split('');
if(numString.length == 1){
return chart[parseInt(numString[0])];
} else if(numString.length == 2){
return chart[parseInt(numString[0])*10]+chart[parseInt(numString[1])];
} else if(numString.length == 3){
return chart[parseInt(numString[0])*100]+
chart[parseInt(numString[1])*10]+
chart[parseInt(numString[2])];
} else if(numString.length == 4){
return chart[parseInt(numString[0])*1000]+
chart[parseInt(numString[1])*100]+
chart[parseInt(numString[2])*10]+
chart[parseInt(numString[3])];
}
}
convertToRoman(2);
FreeCodeCamp Diff Two Arrays Sample Solution
function cleanArray(actual) {
var newArray = [];
for (var i = 0; i < actual.length; i++) {
if (actual[i]) {
newArray.push(actual[i]);
}
}
return newArray;
}
function diffArray(arr1, arr2) {
var newArr = [];
// Same, same; but different.
var slicedArr1;
var slicedArr2;
for(var i=0; i<arr1.length; i++){
for(var j=0; j<arr2.length; j++){
if(arr1[i] === arr2[j]){
//arr1.splice(i,1);
delete arr1[i];
//arr2.splice(j,1);
delete arr2[j];
}
}
}
newArr = arr1.concat(arr2);
return cleanArray(newArr);
}
diffArray(["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]);
var newArray = [];
for (var i = 0; i < actual.length; i++) {
if (actual[i]) {
newArray.push(actual[i]);
}
}
return newArray;
}
function diffArray(arr1, arr2) {
var newArr = [];
// Same, same; but different.
var slicedArr1;
var slicedArr2;
for(var i=0; i<arr1.length; i++){
for(var j=0; j<arr2.length; j++){
if(arr1[i] === arr2[j]){
//arr1.splice(i,1);
delete arr1[i];
//arr2.splice(j,1);
delete arr2[j];
}
}
}
newArr = arr1.concat(arr2);
return cleanArray(newArr);
}
diffArray(["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]);
FreeCodeCamp Sum All Numbers In Range Sample Solution
function sumAll(arr) {
var sorted = arr.sort(function(a, b){return a-b});
var sum = 0;
for(var i=sorted[0]; i<=sorted[1]; i++){
sum += i;
}
return sum;
}
sumAll([1, 4]);
var sorted = arr.sort(function(a, b){return a-b});
var sum = 0;
for(var i=sorted[0]; i<=sorted[1]; i++){
sum += i;
}
return sum;
}
sumAll([1, 4]);
FreeCodeCamp Caesars Cipher Sample Solution
function rot13(str) {
var num = [];
for(var i=0; i<str.length; i++){
num.push(str.charCodeAt(i));
}
var num2 = num.map( function(value) {
//A to Z is between 65 and 90 so only convert these values
if(value>=65 && value<=90){
if(value-13 >= 65){
return value - 13;
} else {
return value + 13;
}
} else {
return value;
}
});
var num3 = [];
for(var j=0; j<num2.length; j++){
num3.push(String.fromCharCode(num2[j]));
}
return num3.join('');
}
var num = [];
for(var i=0; i<str.length; i++){
num.push(str.charCodeAt(i));
}
var num2 = num.map( function(value) {
//A to Z is between 65 and 90 so only convert these values
if(value>=65 && value<=90){
if(value-13 >= 65){
return value - 13;
} else {
return value + 13;
}
} else {
return value;
}
});
var num3 = [];
for(var j=0; j<num2.length; j++){
num3.push(String.fromCharCode(num2[j]));
}
return num3.join('');
}
Subscribe to:
Posts (Atom)
This is an example of scrolling text using Javascript.
Popular Posts
-
//Sample Solution const gameState = {} function preload() { this.load.image('codey', 'https://s3.amazonaws.com/codecademy-...
-
//sample solution function guessNumber(number, clue) { // Prompt the user for a number using the string value of clue guess = promp...
-
//sample solution //Here is the original card object var card1 = {"suit":"clubs", "rank": 8}; //Create a...
-
#sample solution def colorful_conditions(): color = "blue" if color == "red": return "firs...
-
function checkAnswerWrongPlace(ans, realanswer){ // This method compares two input strings representing a player's guess ("an...
-
Instruction: Find the id of the flights whose distance is below average for their carrier. Sample Solution: SELECT id FROM flights AS f...
-
# note: The instructions state to use "text.txt" but an error comes up stating that the file does not exist # as a work around, ...
-
# Sample Solution # Import packages import numpy as np import pandas as pd # Read in transactions data transactions = pd.read_csv(...
-
# Sample Solution from song_data import songs import numpy as np q1 = np.quantile(songs, 0.25) #Create the variables q3 and interquarti...
-
/*sample solution for style.css*/ body > p { background: green; } p { background: yellow; }