JobsJob TrackerJob alerts

Azuga Telematics · 11 questions

All 11Coding 10Low-Level Design 1
  • Nth node from end of linked listCoding
  • Boundary Traversal of binary treeCoding
  • Add two numbers represented by linked listsCoding
  • Find the length of largest subarray with 0 sumCoding
  • 0-1 Knapsack ProblemCoding
  • Find element repeating odd times in arrayCoding
  • Inorder traversal of treeCoding
  • Arrange numbers to form the biggest numberCoding
  • Java inheritance and static membersLow-Level Design
  • Print nodes in top view of binary treeCoding
  • Intersection point of two infinitely long linked listsCoding
← Azuga Telematics questions
  1. Interview questions
  2. Azuga Telematics
  3. Intersection point of two infinitely long linked lists
Coding

Intersection point of two infinitely long linked lists

Filed under Azuga Telematics

The question

Find the intersection point of two linked lists given that the lists are infinitely long, without using O(n) space and without modifying the lists.

No write-up yet. Related questions below have one.

Related Azuga Telematics questions

  • Find the length of largest subarray with 0 sum
  • Find element repeating odd times in array
  • Inorder traversal of tree
← Print nodes in top view of binary tree

Collected from public candidate posts and coding forums. Updated Nov 2026.