Software Engineer

There are 'N' fishing spots arranged in a line, numbered 1 to N. Three gates are located at specific spots, and at each gate, a number of fishermen are waiting.

The process of assigning fishermen to spots follows strict rules:

1) You must decide on an order to open the three gates.

2) A gate is opened, and all the fishermen from that gate must occupy the nearest available (unoccupied) fishing spots.

3) Only after all fishermen from the current gate are settled can the next gate in the chosen order be opened.

The distance a fisherman travels is the absolute difference between their gate's position and their assigned fishing spot's position. Your task is to find an optimal order for opening the gates that minimizes the total distance traveled by all fishermen combined.

You are given an array 'arr' consisting of 'n' integers which denote the position of a stall.

You are also given an integer 'k' which denotes the number of aggressive cows.

You are given the task of assigning stalls to 'k' cows such that the minimum distance between any two of them is the maximum possible.

Print the maximum possible minimum distance.

Example:

Input: 'n' = 3, 'k' = 2 and 'arr' = {1, 2, 3}

Output: 2

Explanation: The maximum possible minimum distance will be 2 when 2 cows are placed at positions {1, 3}. Here distance between cows is 2.

You are given a singly linked list that may or may not contain a cycle. You are supposed to return the node where the cycle begins, if a cycle exists, else return 'NULL'.

A cycle occurs when a node's next pointer returns to a previous node in the list.

Example:

In the given linked list, there is a cycle starting at position 0, hence we return 0.

• Deadlocks.
• CPU Scheduling algorithms.
• Paging, Segmentation.
• They asked me to write the semaphore function code.

They asked me 2 puzzles:

• If I have 15 Rs and visit a store where each chocolate costs 1 Rs, and the shopkeeper allows you to exchange 3 wrappers for 1 extra chocolate, what is the maximum number of chocolates you can consume?
• If a man falls into a 100m deep well and climbs 4 meters up but slips 3 meters down each day, how many days would it take for him to get out of the well?