5 ms·

You’re hired too

• belter 2y ago
  Your technical interview is way too easy....
  • DoctorDabadedoo 2y ago
    Indeed, please write an algorithm to reverse a linked list in O(1).
    • vidarh 2y ago
      Assuming I can choose linked list implementation, that is trivial: It's a doubly linked list where the head contains a pointer to the tail, and a flag that determines which pointer in the nodes is forward and which is backward.
      • belter 2y ago
        It's a trick question. Ask if its on Space or Time complexity ;-)