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
$(document).ready(function(){ | |
var sum1= 0, res = 0, totalSum = 0; | |
for (var x = 1; x <= 1000; x++) | |
{ | |
if (x % 3 === 0 || x % 5 === 0) | |
{ | |
k = x * 2; | |
sum1 += k; |
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
<?php | |
function factorial($n) { | |
$factorial = 1; | |
for($i = $n; $i >= 1; $i--){ | |
$factorial = $factorial * $i; | |
} | |
echo "Factorial of $n is $factorial"; | |
} | |
//calling the function |
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
<?php | |
function digitSum($n) { | |
$array = str_split($n); | |
$sum = array_sum($array); | |
print $sum; | |
} | |
//calling the function | |
digitSum("123"); |
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
function reverseString(str) { | |
return str.split("").reverse().join(""); | |
} | |
alert(reverseString("hello")); |
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
function palindrome(str) { | |
var newStr = str.replace(/[^a-zA-Z 0-9]+| /g,'').toLowerCase(); | |
var newStr1 = newStr.split('').reverse().join(''); | |
if(newStr == newStr1){ | |
return true; | |
} | |
else{ | |
return false; | |
} |
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
function findLongestWord(str) { | |
var strArray = str.toUpperCase().split(' ').sort(); | |
var longest = 0; | |
for (var i = 0; i < strArray.length; i++) { | |
if (strArray[i].length > longest) { | |
longest = strArray[i].length; | |
} | |
} | |
return longest; | |
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
function titleCase(str) { | |
var strArray = str.toLowerCase().split(' '); | |
for (var i = 0; i < strArray.length; i++) { | |
strArray[i] = strArray[i][0].toUpperCase() + strArray[i].slice(1); | |
} | |
return strArray.join(' '); | |
} | |
titleCase("I'm a little tea pot"); |
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
function largestOfFour(arr) { | |
var results = []; | |
for (var n in arr) { | |
var largestNumber = 0; | |
for (var sb in arr[n]) { | |
if (arr[n][sb] > largestNumber) { | |
largestNumber = arr[n][sb]; | |
} | |
} | |
results[n] = largestNumber; |
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
function end(str, target) { | |
// "Never give up and good luck will find you." | |
// -- Falcor | |
var tagLen = target.length; | |
var str_len = ((-str.length) + tagLen ); | |
var sub_str = str.substr(-tagLen, tagLen); | |
if(target == sub_str){ | |
return true; |
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
# A left rotation operation on an array of size shifts each of the array's elements 1 unit to the left. | |
# For example, if 2 left rotations are performed on array [1,2,3,4,5], then the array would become [3,4,5,1,2] | |
#Given an array of n integers and a number,d , perform d left rotations on the array. | |
#Then print the updated array as a single line of space-separated integers. | |
def rotate(array, position): | |
print (array[position:] + array[:position]) | |
#or return |
OlderNewer