NEbere

function findNonRepeatingChars(string) {
    const stringArray =  string.split('')
    const nonrecurring = []
    const resultObj = {}

    for(let char of stringArray) {
        if(!resultObj[char]) {
            resultObj[char] = 1;
        } else {
            resultObj[char] += 1;

NEbere

# Python3 solution to https://www.hackerrank.com/challenges/diagonal-difference/problem

# test data
first_array = [11, 2, 4]
second_array = [4, 5, 6]
third_array = [10, 8, -12]
sumArray = []
sumArray.append(first_array)
sumArray.append(second_array)
sumArray.append(third_array)

NEbere

# Python2 solution for codility frog jump question
# https://codility.com/programmers/lessons/3-time_complexity/frog_jmp/

import math

def solution(X, Y, D):
    # write your code in Python 2.7
    source_and_destination_difference = Y - X
    fixed_distance_jump = D
    

NEbere

# 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
    print (array[position:] + array[:position])
    #or return

NEbere

// Codility Bbinary Gap Test

function solution($N) {
    // write your code in PHP5.5
    $binaryNumber =  decbin($N); // binary conversion of number
    $trimmed = trim($binaryNumber, 0); // trim to remove trailing zeros
    $binaryGap =  explode("1",$trimmed); // explode 
    $binaryCount = array_map('strlen', $binaryGap);
    
    return max($binaryCount); // returns the longest binary gap

NEbere

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;

NEbere

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;

NEbere

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");

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