update

RajSDE · RajSDE · commit 266995c45ee8 · 2022-02-23T20:34:32.000+05:30
diff --git a/JavaPractice/IntersectionPointinYShappedLinkedLists/Readme.md b/JavaPractice/IntersectionPointinYShappedLinkedLists/Readme.md
@@ -2,7 +2,7 @@
 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#) 
 
 Example 1:
->**Input**:
+>**Input**:<br>
 >LinkList1 = 3->6->9->common<br>
 >LinkList2 = 10->common<br>
 >common = 15->30->NULL<br>
