Abiola-Farounbi

[
    {
        "name": "Nicosia 1",
        "routes":[
        {
            "name":"YDÜ Kampüs Ana Durak"
        },
        {
            "name":"Near East Bank Durağı"
        },

Abiola-Farounbi

function Calculator(str) { 
  var arithmeticOperators = ['+', '-', '/', '*'];
  var replacedStr = str.replace(/(.)\(/g, function (match, g1) {
    if (arithmeticOperators.indexOf(g1) != -1)
      return match;
    else
      return match.replace(g1, g1 + '*');
  });
  return eval(replacedStr);
}

Abiola-Farounbi

# Given an array of binary digits, 0 and 1, sort the array so that all zeros are at one end and all ones are at the other. Which end does not matter. To sort the array, swap any two adjacent elements. Determine the minimum number of swaps to sort the array.

# Example
# arr = [0, 1, 0, 1]
# With 1 move, switching elements 1 and 2 yields [0, 0, 1, 1], a sorted array

# Function Description
# Complete the function minMoves

# minMoves has the following parameter(s):

Abiola-Farounbi

#include <iostream>
#include <cmath>

using namespace std;

// Function Prototype
void FillArray(float ArrayValues[]);
void CalculateMeanandStddev(float ArrayValues[], double *Mean_ptr, double *Stddev);
void PrintResult(float ArrayValues[], double Mean, double Stddev);

Abiola-Farounbi

#include <iostream>
#include <cmath>

using namespace std;


//Function call by reference using pointers
void AskForValues(double *a_ptr, double *b_ptr,double *c_ptr)
{
	 cout << endl << "Enter your values" ;

Abiola-Farounbi

#include <iostream>
using namespace std;

bool isPalindrome(int x) {
    //complete the function
    int n, num, digit, rev = 0;
    bool True = true;
    bool False = false;
    num = x;

Abiola-Farounbi

---
Write a function:

    def solution(A)

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Abiola-Farounbi

// Sololearn problem set for c++
// You are working on a ticketing system. A ticket costs $10.
// The office is running a discount campaign: each group of 5 people is getting a discount, which is determined by the age of the youngest person in the group.
// You need to create a program that takes the ages of all 5 people as input and outputs the total price of the tickets.
// Sample Input: 55 28 15 38 63
// Sample Output: 42.5
// The youngest age is 15, so the group gets a 15% discount from the total price, which is $50 - 15% = $42.5

#include <iostream>
using namespace std;

Abiola-Farounbi

// Apex college needs your help in writing  a logic to shuffle pupils on an assembly line 
// by moving a number of pupils either to the front of the line or to the end of the line.

const shufflePupils = (pupils,val) => {
    
    // Test cases for null and empty array
  if (!pupils || pupils.length == 0) return []
    
//   test case for 0 value  
  if(val == 0) return pupils

Abiola-Farounbi

//Problem Set for #AlgorithmFriday Week5
// A school has two classes A and B, Each class has the ages of its students in a sorted list.
// The school decides to join both classes and needs you to help  them write a function that merges both lists into one
// such that the students' ages still remains sorted in increasing order.

const mergeSortedArray = (classA,classB) => {
    
    // Test cases for null and empty array
    if (!Array.isArray(classA)  || !Array.isArray(classB)  ) return []