Travelling salesman problem. 😂😂

Interviewer: How will you solve the travelling salesman problem?

Me: *explains the solution on whiteboard*

Interviewer: It is slow. Can you do it in linear time at least?

Me: It is NP hard so it is not possible. For a restricted case, it may be possible

Interviewer: You are stupid. Do not apply again.

Algorithms real life implementation

On the way to your college canteen? -> A* search

Waiting in line in the canteen? -> Queue

Notice that girl standing in front? -> Linear search

Searching for her dad in the phone book? -> Binary search

Stupid! Google it! -> Trie

Search for her on Facebook! -> Depth-first search

Found her! Friend request? Accepted! Send a Hi! -> Graph

Writing her a secret love letter? -> Caesar cipher

Uploading your first date pic on fb? -> Image compression algorithms

Looking through her Whatsapp messages? -> KMP algorithm

She found out and had your first fight? -> Start over with some gifts! Backtracking

Got her list of items to buy? -> Array

Too many items! Low on cash, maybe? -> Priority queue

Making her play treasure hunt for her gifts? -> Linked list

Wait! Go back! Is that a ring? -> Stack

Girl’s family not agreeing to your proposal? -> Divide and conquer

Got married? Congrats! Going for your honeymoon? -> Travelling salesman problem

Your mom packing luggage for you? -> 0/1 Knapsack problem

She packed your favorite pickles? -> Hash table

Driving to the airport? -> Breadth-first search

The best solution to Travelling Salesman Problem is to use ebay.

When the PMO tells you to: "Aye, what's up with that delivery program you started yesterday? Is it done? I already promised some licenses for next Moday (morning ofc)"

You stupid illiterate baboon, be gratious I even picked up this NP hard task, it's like solving the Travelling Salesman problem, not easy!
Fucking PMO

Teacher: always try of doing a dry run for minimising the error in your code
Me:ok let's try 10 cities for the travelling salesman problem