Coriolis Technologies Coding Questions

Run

#include<bits/stdc++.h>

using namespace std;

unordered_map < int, int >m;
int l, u;
int util (int a, int b)
{
  if (a == b)
    return 0;
  if (m[a])
    return util (a + 1, b);
  return 1 + util (a + 1, b);
}

int func (int b, int prev)
{
  if (b < prev) return min (util (prev, u) + util (l, b) + 1, util (b, prev)); else return min (util (prev, b), util (l, b) + util (prev, u) + 1); } int main () { int flag = 0, ans = 0, prev, prev2; cin >> l >> u;
  int bn, b;
  cin >> bn;
  while (bn--)
    {
      cin >> b;
      m[b]++;
    }
  cin >> bn;
  while (bn--)
    {
      cin >> b;
      if (b > 9 && flag == 0)
	{
	  ans += 2;
	  flag++;
	  prev = b;
	}
      else if (flag == 0)
	{
	  ans += 1;
	  flag++;
	  prev = b;
	}
      else if (prev2 == b)
	{
	  prev2 = prev;
	  prev = b;
	  ans++;
	}
      else
	{
	  ans += min (b > 9 ? 2 : 1, func (prev, b));
	  prev2 = prev;
	  prev = b;
	}
    }

  cout << ans;
}

import java.util.*;
public class Main
{
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
    int l = sc.nextInt ();
    int h = sc.nextInt ();
    int b = sc.nextInt ();
      List < Integer > bl = new ArrayList < >();
    for (int i = 0; i < b; i++)
      {
	bl.add (sc.nextInt ());
      }
    int v = sc.nextInt ();
    List < Integer > vl = new ArrayList < >();
    for (int i = 0; i < v; i++)
      {
	vl.add (sc.nextInt ());
      }
    Set < Integer > sl = new HashSet < >();
    int res = 0;
  for (Integer i:vl)
      {
	if (bl.contains (i))
	  continue;
	sl.add (i);
      }
  for (Integer i:sl)
      {
	String s = i + "";
	res += s.length ();
      }
    System.out.println (res);

  }
}

def prev(now, l, h, blocked):
    if now != l:
        if (now - 1) not in blocked:
            return now - 1
        else:
            return prev(now - 1, l, h, blocked)

    else:
        if h not in blocked:
            return h
        else:
            return prev(h, l, h, blocked)


def next(now, l, h, blocked):
    if now != h:
        if (now + 1) not in blocked:
            return now + 1
        else:
            return next(now + 1, l, h, blocked)

    else:
        if l not in blocked:
            return l
        else:
            return next(l, l, h, blocked)


def digits(n):
    count = 0
    while n > 0:
        n = n // 10
        count += 1

    return count


for i in range(2):
    if i == 0:
        l = int(input())
    else:
        h = int(input())

b = int(input())
blocked = []
for i in range(b):
    blocked.append(int(input()))


back = -1
now = -1
c = int(input())
k = 0
for i in range(c):
    n = int(input())
    n1 = digits(n)
    if now == -1:
        now = n
        k += n1
        continue

    if back == n:
        k += 1
        back, now = now, back
        continue

    pf = 0
    pb = 0
    now1 = now
    prev1 = now
    for j in range(n1):
        if j == (n1 - 1):
            pf = n1
            pb = n1
            break
        else:
            now1 = next(now1, l, h, blocked)
            pf += 1
            prev1 = prev(prev1, l, h, blocked)
            pb += 1
            if now1 == n:
                break
            if prev1 == n:
                break
    k += pf
    back = now
    now = n
print(k)