Coding Interview Resources

From NovaOrdis Knowledge Base
Revision as of 20:40, 12 November 2021 by Ovidiu (talk | contribs) (→‎Overview)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Internal

Overview

  • Can this be turned into a graph problem? Can it be turned into a tree problem?
  • Java API call to get a String of certain length made of spaces.
  • Arrays have .length, Strings have length()
  • Lists have size()
  • Map:
    • containsKey(T key)
    • get(T key)
    • Set<T> s = m.keySet()
    • Collection<T> c = m.values()
  • Digit character (‘0’ – ‘9’) to its int value (int)c – 48 (‘0’ is 48, ‘9’ is 57, ‘A’ is 65)
  • LinkedList API (add(), iterate)
  • List<Key>[] a; a = new List<Key>[10];
  • The mathematics of a modulo of a negative number.
  • Graph adjacency list representation.
  • min(int a, int b, int c):
private static int min(int a, int b, int c) {
  int min = a;
  if (b < a) {
    min = b;
  }
  if (c < min) {
    min = c;
  }
  return min;
}