Feat: add "Middle of the Linked List" question in Linked List.

[BamaCharanChhandogi]

What would you like to Propose?

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.

Added "Middle of the Linked List" question.

Issue details

### Example of Middle of the Linked List:
Input: head = [1,2,3,4,5,6]
Output: [4,5,6]

Additional Information

No response

[siriak]

It seems that it's already implemented here

Java/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java

Lines 62 to 73 in 1ef5208

	public Node middle() {
	if (head == null) {
	return null;
	}
	Node firstCounter = head;
	Node secondCounter = firstCounter.next;
	while (secondCounter != null && secondCounter.next != null) {
	firstCounter = firstCounter.next;
	secondCounter = secondCounter.next.next;
	}
	return firstCounter;
	}

[BamaCharanChhandogi]

oh! Yes

[BamaCharanChhandogi]

Hi @siriak, I have a question Why Bit manipulation Section is not available in Java repo?

[siriak]

Because no one has implemented anything in this section, so far

[BamaCharanChhandogi]

Can I start a Bit manipulation section?