Skip to content

Commit 1d47091

Browse files
committed
update
1 parent db58b65 commit 1d47091

1 file changed

Lines changed: 4 additions & 7 deletions

File tree

  • JavaPractice/IntersectionPointinYShappedLinkedLists

JavaPractice/IntersectionPointinYShappedLinkedLists/Readme.md

Lines changed: 4 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -2,14 +2,11 @@
22
Given two singly linked lists of size N and M, write a program to get the point where two linked lists intersect each other. [🔗Goto](https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1/?page=1&difficulty[]=1&status[]=unsolved&company[]=Amazon&sortBy=submissions#)
33

44
Example 1:
5-
<p>
6-
75
>**Input**:
8-
>LinkList1 = 3->6->9->common
9-
>LinkList2 = 10->common
10-
>common = 15->30->NULL
11-
>**Output**: 15
12-
</p>
6+
>LinkList1 = 3->6->9->common<br>
7+
>LinkList2 = 10->common<br>
8+
>common = 15->30->NULL<br>
9+
>**Output**: 15<br>
1310
1411
<details>
1512
<summary>Full Code</summary>

0 commit comments

Comments
 (0)