Given a collection of n nuts and a collection of n bolts, arranged in an increasing order of size, give an O(n) time algorithm to check if there is a nut and a bolt that have the same size. The sizes of the nuts and bolts are stored in the sorted arrays NUT S[1..n] and BOLT S[1..n], respectively. Your algorithm can stop as soon as it finds a single match (i.e, you do not need to report all matches).

See explaination

Explanation:

Keep two iterators, i (for nuts array) and j (for bolts array).

while(i < n and j < n) {

if nuts[i] == bolts[j] {

We have a case where sizes match, output/return

}

else if nuts[i] < bolts[j] {

this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1

}

else {

this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1

}

}

Since we go to each index in both the array only once, the algorithm take O(n) time.

This is a known bug in earlier versions of the game.

Explanation:

An easy way to solve this that I have seen work before is to completely destroy the 'new' portal that appears in the overworld. Once done, you should be able to enter your portal and exit from the same portal.

To help avoid this, you should also never install a portal in your world in an area that is at all enclosed. The portal system seems to dislike portals appearing in places they should 'not be' based on the initial construction of the world.

Also avoid dying, as it can cause random nether portals to form in parts of your world.