Solving more arcade the core, challenges and interview problems

Author: formidablae

Arcade/The_Core/01_Intro_Gates/001_Add_Two_Digits/main.cs

@@ -0,0 +1,9 @@
+int addTwoDigits(int n)
+{
+    string myNumb = n.ToString();
+    string firstDigit = myNumb.Substring(0, 1);
+    string secondDigit = myNumb.Substring(1, 1);
+    int fd = Int32.Parse(firstDigit);
+    int sd = Int32.Parse(secondDigit);
+    return fd + sd;
+}

Arcade/The_Core/01_Intro_Gates/002_Largest_Number/main.c

@@ -0,0 +1,10 @@
+int largestNumber(int n)
+{
+    int num = 10;
+    for (int i = 1; i < n; i++)
+    {
+        num = num * 10;
+    }
+    
+    return num - 1;
+}

Arcade/The_Core/01_Intro_Gates/003_Candies/main.rb

@@ -0,0 +1,15 @@
+def candies(n, m)
+    num = 0
+    newNum = 0
+    i = 0
+    while newNum < m do
+        num = newNum
+        newNum = n * i
+        i += 1
+    end
+    if newNum == m
+        return newNum
+    else
+        return num
+    end
+end

Arcade/The_Core/01_Intro_Gates/004_Seats_in_Theater/main.objc

@@ -0,0 +1,4 @@
+int seatsInTheater(int nCols, int nRows, int col, int row)
+{
+   return (nCols - col + 1) * (nRows - row);
+}

Arcade/The_Core/01_Intro_Gates/005_Max_Multiple/main.d

@@ -0,0 +1,6 @@
+int maxMultiple(int divisor, int bound)
+{
+    int n = bound;
+    while (n % divisor != 0) n--;
+    return n;
+}

Arcade/The_Core/01_Intro_Gates/006_Circle_of_Numbers/main.dart

@@ -0,0 +1,5 @@
+int circleOfNumbers(int n, int firstNumber)
+{
+    if (n % 2 != 0) return ((n - 1) / 2 + firstNumber) % n;
+    else return (n / 2 + firstNumber) % n;
+}

Arcade/The_Core/01_Intro_Gates/007_Late_Ride/main.cpp

@@ -0,0 +1,23 @@
+int lateRide(int n)
+{
+    std::string hours = std::to_string(n / 60);
+    std::string minutes = std::to_string(n % 60);
+    
+    int sum = 0;
+    
+    if (hours.length() == 1) sum = sum + std::stoi(hours.substr(0, 1));
+    else
+    {
+        sum = sum + std::stoi(hours.substr(0, 1));
+        sum = sum + std::stoi(hours.substr(1, 1));
+    }
+    
+    if (minutes.length() == 1) sum = sum + std::stoi(minutes.substr(0, 1));
+    else
+    {
+        sum = sum + std::stoi(minutes.substr(0, 1));
+        sum = sum + std::stoi(minutes.substr(1, 1));
+    }
+    
+    return sum;
+}

Arcade/The_Core/01_Intro_Gates/008_Phone_Call/main.java

@@ -0,0 +1,32 @@
+int phoneCall(int min1, int min2_10, int min11, int s)
+{
+    int minutes = 0;
+    if (s < min1)
+    {
+        return 0;
+    }
+    else
+    {
+        minutes++;
+        s = s - min1;
+    }
+    
+    if (s < min2_10)
+    {
+        return minutes;
+    }
+    else if (s >= min2_10 && s <= min2_10 * 9)
+    {
+        minutes = minutes + s / min2_10;
+        s = s - (s / min2_10) * min2_10;
+    }
+    else
+    {
+        minutes = minutes + 9;
+        s = s - 9 * min2_10;
+        
+        minutes = minutes + s / min11;
+        s = s - (s / min11) * min11;
+    }
+    return minutes;
+}

Challenges/isoscelesTriangle/main.java

@@ -0,0 +1,10 @@
+boolean isoscelesTriangle(int[] sides)
+{
+    int a = sides[0];
+    int b = sides[1];
+    int c = sides[2];
+    
+    /*if (a + b <= c || a + c <= b || b + c <= a || a <= 0 || b <= 0 || c <= 0) return false;
+    else */if (a == b || a == c || b == c) return true;
+    else return false;
+}

Interview_Practice/Data_Structures/01_Arrays/01_firstDuplicate/main.py

@@ -0,0 +1,7 @@
+def firstDuplicate(a):
+    aSet = set()
+    for i in a:
+        if i in aSet:
+            return i
+        aSet.add(i)
+    return -1