Created
April 25, 2017 12:00
-
-
Save abdu95/5ef2deb20015625a114de6b891e01f00 to your computer and use it in GitHub Desktop.
JS Bin // source http://jsbin.com/jinukozixa
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset=utf-8 /> | |
<title>JS Bin</title> | |
</head> | |
<body> | |
<script id="jsbin-javascript"> | |
//Write a JavaScript function that returns a passed string with letters in alphabetical order. Assume punctuation and numbers symbols are not included in the passed string. | |
function alphabet_order(str) | |
{ | |
return str.split('').sort().join(''); | |
} | |
console.log(alphabet_order("webmaster")); | |
function string2upper(stringus){ | |
//return stringus.split('').join(''); | |
stringus2=stringus.toUpperCase(); | |
console.log(stringus2); | |
} | |
string2upper("hey yo nace"); | |
function uppercase(str) | |
{ | |
var array1 = str.split(' '); | |
var newarray1 = []; | |
for(var x = 0; x < array1.length; x++){ | |
newarray1.push(array1[x].charAt(0).toUpperCase()+array1[x].slice(1)); | |
} | |
return newarray1.join(' '); | |
} | |
console.log(uppercase("the quick brown fox")); | |
//Write a JavaScript function that accepts a string as a | |
//parameter and find the longest word within the string. | |
function theLongest(strongus){ | |
var lgth = 0; | |
var longest; | |
var array1 = strongus.split(' '); | |
for(var x = 0; x < array1.length; x++){ | |
if(array1[x].length > lgth){ | |
var lgth = array1[x].length; | |
longest = array1[x]; | |
} | |
} | |
console.log(longest); | |
} | |
theLongest("go too faraway"); | |
function find_longest_word(str) | |
{ | |
var array1 = str.match(/\w[a-z]{0,}/gi); | |
var result = array1[0]; | |
for(var x = 1 ; x < array1.length ; x++) | |
{ | |
if(result.length < array1[x].length) | |
{ | |
result = array1[x]; | |
} | |
} | |
return result; | |
} | |
console.log(find_longest_word('Web Development Tutorial')); | |
</script> | |
<script id="jsbin-source-javascript" type="text/javascript">//Write a JavaScript function that returns a passed string with letters in alphabetical order. Assume punctuation and numbers symbols are not included in the passed string. | |
function alphabet_order(str) | |
{ | |
return str.split('').sort().join(''); | |
} | |
console.log(alphabet_order("webmaster")); | |
function string2upper(stringus){ | |
//return stringus.split('').join(''); | |
stringus2=stringus.toUpperCase(); | |
console.log(stringus2); | |
} | |
string2upper("hey yo nace"); | |
function uppercase(str) | |
{ | |
var array1 = str.split(' '); | |
var newarray1 = []; | |
for(var x = 0; x < array1.length; x++){ | |
newarray1.push(array1[x].charAt(0).toUpperCase()+array1[x].slice(1)); | |
} | |
return newarray1.join(' '); | |
} | |
console.log(uppercase("the quick brown fox")); | |
//Write a JavaScript function that accepts a string as a | |
//parameter and find the longest word within the string. | |
function theLongest(strongus){ | |
var lgth = 0; | |
var longest; | |
var array1 = strongus.split(' '); | |
for(var x = 0; x < array1.length; x++){ | |
if(array1[x].length > lgth){ | |
var lgth = array1[x].length; | |
longest = array1[x]; | |
} | |
} | |
console.log(longest); | |
} | |
theLongest("go too faraway"); | |
function find_longest_word(str) | |
{ | |
var array1 = str.match(/\w[a-z]{0,}/gi); | |
var result = array1[0]; | |
for(var x = 1 ; x < array1.length ; x++) | |
{ | |
if(result.length < array1[x].length) | |
{ | |
result = array1[x]; | |
} | |
} | |
return result; | |
} | |
console.log(find_longest_word('Web Development Tutorial')); | |
</script></body> | |
</html> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//Write a JavaScript function that returns a passed string with letters in alphabetical order. Assume punctuation and numbers symbols are not included in the passed string. | |
function alphabet_order(str) | |
{ | |
return str.split('').sort().join(''); | |
} | |
console.log(alphabet_order("webmaster")); | |
function string2upper(stringus){ | |
//return stringus.split('').join(''); | |
stringus2=stringus.toUpperCase(); | |
console.log(stringus2); | |
} | |
string2upper("hey yo nace"); | |
function uppercase(str) | |
{ | |
var array1 = str.split(' '); | |
var newarray1 = []; | |
for(var x = 0; x < array1.length; x++){ | |
newarray1.push(array1[x].charAt(0).toUpperCase()+array1[x].slice(1)); | |
} | |
return newarray1.join(' '); | |
} | |
console.log(uppercase("the quick brown fox")); | |
//Write a JavaScript function that accepts a string as a | |
//parameter and find the longest word within the string. | |
function theLongest(strongus){ | |
var lgth = 0; | |
var longest; | |
var array1 = strongus.split(' '); | |
for(var x = 0; x < array1.length; x++){ | |
if(array1[x].length > lgth){ | |
var lgth = array1[x].length; | |
longest = array1[x]; | |
} | |
} | |
console.log(longest); | |
} | |
theLongest("go too faraway"); | |
function find_longest_word(str) | |
{ | |
var array1 = str.match(/\w[a-z]{0,}/gi); | |
var result = array1[0]; | |
for(var x = 1 ; x < array1.length ; x++) | |
{ | |
if(result.length < array1[x].length) | |
{ | |
result = array1[x]; | |
} | |
} | |
return result; | |
} | |
console.log(find_longest_word('Web Development Tutorial')); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment