I wasn't ready for implementing bite algorithms in Java; I had just prepared for different things.

I think I implemented algorithms in pseudocode well, but of course, it wasn't enough.

I was tested by three managers out of a group of five people total.

This may help others.

Be prepared for BITE algorithms. It's not for string or linked list rearrangements.

Don't be nervous. Good luck!

How to find the first unrepeated character in a string.

Example: Input: "abca" Output: "b"

16-bit number: How to change bits 0 with 1, 2 with 3, etc.

How to discover if a given number is a power of 2.

Binary tree: The left node has the smallest value. Print 5, 10, 20, 25, and then "count of nodes=4".

Write a class that implements a Queue with the ability to set a priority for an item in the Queue.