Hexagonal Grid Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Hexagonal Grid
  5. Discussions

Hexagonal Grid

  • gajendra_dagur8
     + 1 comment

    No DP, No recursion, O(n) solution

    static boolean solve(int s, int e) {
    int c = 0;
    for (int i = s; i < e; i++) {
      if ((a[i] == 1 && b[i] == 1) || (i - 1 >= 0 && a[i] == 1 && b[i - 1] == 1)) {
        if (c % 2 != 0)
          return false;
        else
          c = 0;
      }
      if (a[i] != 1)
        c++;
      if (b[i] != 1)
        c++;

    }
    if (c % 2 != 0)
      return false;
    else
      return true;
  }