Skip to main content

Hard ✔

  1. Reverse LL in group of given size K
    1. 07 April, 2026: 00.19.57 ✔
      • Simulate address and value
      • Reserve modified pointer
  2. Rotate a LL
    1. 27 March, 2026: 00.22.28 ✔
      • Count the number of rotation k properly.
      • Right rotation by k means:
        • The last k nodes come to the front
        • So the new head is at position n - k
      • Left rotation by k means:
        • The first k nodes come to the end
        • So the new head is at position k
  3. Flattening of LL
    • GeeksforGeeks
    • LeetCode
      1. 05 April, 2026: 00.36.47 ✔
        • The problem is loop free.
        • If next pointer is modified anywhere in the code, during restructuring the list, its better to preserve the next node first
        • It's doubly linked list, so handle the prev node as well
  4. Clone a Linked List with random and next pointer
    1. 02 April, 2026: 00.20.44 ❌
      • Failed at implmentation
        • Create new address and map with old one, and replace it.