NEbere

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; 
  

NEbere

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;
  }

NEbere

function factorialize(num) {
		  //check if num == 0
			if (num === 0) {
			return 1;
		  }
		  //else calculate factorial
		  return num * factorialize(num - 1);
		  }
    //calling the function. this will return 120
		factorialize(5);

NEbere

function reverseString(str) {
		  return str.split("").reverse().join("");
		}

		alert(reverseString("hello"));

NEbere

	<?php
	
		function digitSum($n) {
			$array = str_split($n);
			$sum = array_sum($array);
			print $sum;
		}
	//calling the function
	digitSum("123");

NEbere

<?php
function factorial($n) {
			$factorial = 1;
				for($i = $n; $i >= 1; $i--){
					$factorial = $factorial * $i;
					
				}
			echo "Factorial of $n is $factorial";
		}
	  //calling the function

NEbere

$(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;