An applicant forgot he was chewing gum about halfway through the interview. He took the gum out of his mouth and attempted to hand it to me or the other manager while apologizing for forgetting and asking us if we wanted to take the gum from him until the end.
I received this email today. Enjoy :)
Subject: Associate Manager USA
Hello competitor,
We are glad to report you that in our stable company, the vacancy of transaction manager is opened. The world is smashed by a crisis, people lose their workplaces, and many companies are being closed. Our company offers a product in the field of services; therefore the demand on our suggestions remains even in so difficult period for the world economy.
The followings factors are required from you:
- industriousness;
- efficiency;
- to be the habitant of the USA;
- command aspiring to success;
- to have sure vital position;
- to have initial PC skills
- you must be more senior than 21.
NO INVESTMENTS FROM YOU ARE REQUIRED, you will be fully acquainted and trained for discharging of your duties. We need valuable staff. We will teach even a janitor to be a businessman!
Do not lose the chance of fully legal earnings with a dynamically developing company. We will help you to build a career which you always dreamed about. Your chance is waiting for you.
We wait for your resumes to the address [obscured]@gmail.com of our department of personnel.
With kind regards,
-----------------------------------------
I have to say it's quite hilarious with perhaps "We will teach even a janitor to be a businessman" sentence being the only reasonably worded one. I especially like "The world is smashed by a crisis, people lose their workplaces, and many companies are being closed..."
Automated translation still has a long way to go :)
class Program
{
static void Main(string[] args)
{
// create a test list
LinkedList list = new LinkedList();
for (int i = 1; i <= 10; i++)
{
LinkedListNode node = new LinkedListNode();
node.Value = i;
list.AppendLast(node);
}
// print list before reversal
LinkedListNode currentNode;
Console.WriteLine("List before reversal:");
currentNode = list.First;
while (currentNode != null)
{
Console.WriteLine(currentNode.Value);
currentNode = currentNode.Next;
}
Console.WriteLine();
list.Reverse();
// print list after reversal
Console.WriteLine("List after reversal:");
currentNode = list.First;
while (currentNode != null)
{
Console.WriteLine(currentNode.Value);
currentNode = currentNode.Next;
}
Console.WriteLine("Press ENTER to end program");
Console.ReadLine();
}
public class LinkedList
{
public LinkedList()
{
}
private LinkedListNode _firstNode;
/// <summary>
/// Gets the first node in the list.
/// </summary>
public LinkedListNode First
{
get
{
return _firstNode;
}
}
/// <summary>
/// Appends the node at the beginning of the list.
/// </summary>
/// <param name="node">The node to append.</param>
public void AppendFirst(LinkedListNode node)
{
if (_firstNode == null)
_firstNode = node;
else
{
node.Next = _firstNode;
_firstNode = node;
}
}
/// <summary>
/// Appends the node at the end of the list.
/// </summary>
/// <param name="node">The node to append.</param>
public void AppendLast(LinkedListNode node)
{
// if the list is empty, set the first node
// and do nothing
if (_firstNode == null)
_firstNode = node;
else
{
LinkedListNode currentNode = _firstNode;
// get to the last node
while (currentNode.Next != null)
currentNode = currentNode.Next;
// currentNode is now referencing the last node
currentNode.Next = node;
}
}
///
/// Reverses the list so that the last node becomes the first
/// node in the list.
///
public void Reverse()
{
LinkedListNode currentNode = _firstNode,
tempNode = null,
firstNode = null;
// traverse and reverse
while (currentNode != null)
{
tempNode = currentNode.Next;
currentNode.Next = firstNode;
firstNode = currentNode;
currentNode = tempNode;
}
// set the first node
_firstNode = firstNode;
}
}
public class LinkedListNode
{
// Constructor
public LinkedListNode()
{
}
private int _value;
private LinkedListNode _next;
///
/// Value of the node.
///
public int Value
{
get
{
return _value;
}
set
{
_value = value;
}
}
///
/// Pointer to the next node.
///
public LinkedListNode Next
{
get
{
return _next;
}
set
{
_next = value;
}
}
}
}
