|
76 | 76 | - [Find an element in a circularly sorted array](#find-an-element-in-a-circularly-sorted-array)
|
77 | 77 | - [Linked List](#linked-list-1)
|
78 | 78 | - [Reverse linked list](#reverse-linked-list)
|
| 79 | + - [Find the merge point of 2 Linked List](#find-the-merge-point-of-2-linked-list) |
79 | 80 | - [References](#references)
|
80 | 81 |
|
81 | 82 | > Coding interview question answers in JavaScript for Facebook, Amazon, Google, Microsoft or any company.
|
82 | 83 | > Find all notes and Coding exercises for this repo [here](http://www.rupeshtiwari.com/coding-examples-interview-coding/)
|
| 84 | +
|
83 | 85 | ## Important thing to remember
|
84 | 86 |
|
85 | 87 | - Remember: Run through `your code` not through the `algorithm` while executing test.
|
@@ -865,11 +867,29 @@ Reverse Linked List simulation:
|
865 | 867 | - [Question](https://codepen.io/roopkt/pen/mdWayxv?editors=0010)
|
866 | 868 | - [Answer](https://codepen.io/roopkt/pen/dyvwPej?editors=0011)
|
867 | 869 |
|
| 870 | +#### Find the merge point of 2 Linked List |
| 871 | + |
| 872 | +[Question](https://codepen.io/roopkt/pen/bGqOygE) |
| 873 | + |
| 874 | +<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="bGqOygE" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="bGqOygE"> |
| 875 | + <span>See the Pen <a href="https://codepen.io/roopkt/pen/bGqOygE"> |
| 876 | + bGqOygE</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>) |
| 877 | + on <a href="https://codepen.io">CodePen</a>.</span> |
| 878 | +</p> |
| 879 | + |
| 880 | +[Answer](https://codepen.io/roopkt/pen/poeqBBb) |
| 881 | + |
| 882 | +<p class="codepen" data-height="265" data-theme-id="dark" data-default-tab="js,result" data-user="roopkt" data-slug-hash="poeqBBb" style="height: 265px; box-sizing: border-box; display: flex; align-items: center; justify-content: center; border: 2px solid; margin: 1em 0; padding: 1em;" data-pen-title="Find merge point of 2 linked list Answer"> |
| 883 | + <span>See the Pen <a href="https://codepen.io/roopkt/pen/poeqBBb"> |
| 884 | + Find merge point of 2 linked list Answer</a> by Rupesh Tiwari (<a href="https://codepen.io/roopkt">@roopkt</a>) |
| 885 | + on <a href="https://codepen.io">CodePen</a>.</span> |
| 886 | +</p> |
| 887 | + |
868 | 888 | ## References
|
869 | 889 |
|
870 | 890 | - http://btholt.github.io/four-semesters-of-cs/
|
871 | 891 | - https://btholt.github.io/four-semesters-of-cs-part-two/
|
872 | 892 | - [Binary Tree Visualization](https://www.cs.usfca.edu/~galles/visualization/BST.html)
|
873 | 893 |
|
874 | 894 | <script async src="https://cpwebassets.codepen.io/assets/embed/ei.js"></script>
|
875 |
| -<script data-ad-client="ca-pub-1700383344966810" async="" src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js" data-checked-head="true"></script> |
| 895 | +<script data-ad-client="ca-pub-1700383344966810" async="" src="https://pagead2.googlesyndication.com/pagead/js/adsbygoogle.js" data-checked-head="true"></script> |
0 commit comments