Fortunatly Im Dead

Ah, the mythical "Expert Keyboard" – three buttons that sum up 90% of coding bootcamp graduates' skillset. Why learn algorithms when Stack Overflow exists? The first button even has the Stack Overflow logo, because that's where the copying begins. It's not plagiarism, it's "leveraging existing solutions." The microphone is there so you can dictate which error message to Google next. Who needs computer science degrees when you have Ctrl+C, Ctrl+V, and a reliable internet connection?

Content If you know, you knowle Quora Search Quo Dating and Friendship Gender Friendship Advice Friendship Dating Advice Personal Question like girl A. We are very good friends. A's best friend B likes me. Also, A likes a guy C who is my best bro and C likes another girl D who is in a relationship with another guy. What should we do? " Answer a) Follow - 143 Request 000 90 Answers Priyanka Dhaka, studied at Indian Institute of Technology, Delhi Updated Jul 28, 2014 Originally Answered: I like girl A. We are very good friends, but her best friend B likes me. Also, A likes guy C, who is my best bro. C likes another girl D, who is in a relationship with another guy. What should we do? You can apply Bipartite Matching algorithm of Graph Theory. All you have to do is: 1. Put all girls as vertices (a's) in Part A, and boys as vertices (b's) in Part B. 2. Draw an edge between vertex a to vertex b if a likes b. 3. It will be a bipartite graph (there are no edges within vertices of Part A, and same for Part B) unless your friends are not straight. 4. Then find maximum matching for this bipartite graph. (refer this link Maximum Bipartite Matching - GeeksforGeeks C) 5. You will get maximum matching as output and the matched edges will be the pairs who should be together. 6. You can apply weighted bipartite matching algorithm if you know how much they lovelike each other. In that case, assign weights according to their amount of love. and repeat step 4 and 5. Thanks for asking this question. Finally I have found a real life problem which can be solved by what Prof Panda has been teaching us for 2-3 years. P.S. I can provide you code for both weighted and unweighted maximum bipartite matching which I made for my project. 203.1K views View 13.701 upvotes : View 1 share

Content Zhuowei Zhang zhuowei Never spend 6 minutes doing something by hand when you can spend 6 hours failing to automate it

The eternal developer's dilemma captured in three painful stages of existence: First, we see Assembly code - a nightmare of register manipulation and syscalls just to print "Hello, World!" - with the crushing realization you missed the era when real programmers had to understand how computers actually work. Then there's quantum computing with its shiny gold hardware that looks like it belongs in a sci-fi movie. Too bad you're stuck in the boring classical computing era while the cool kids will someday manipulate qubits in superposition. But fear not! You were born at the perfect time to experience the true pinnacle of software engineering: begging an AI to center a div because CSS is basically dark magic that nobody actually understands. The circle of programming life is complete. We've gone from writing machine code to having machines write our code.

Content BUT WE ONLY DO SO WE CHANGE OUR CLOCKS BY AN HOUR AND EVERYTHING BREAKS THIS ONCE A YEAR RIGHT? RIGHT?

Ah, the mythical "organized development process." While enterprise teams are drowning in Jira tickets, standups, and 27 different Trello boards, these indie devs are out here making masterpieces while asking "Is software the thing with the clicking?" Their Trello account got deactivated from neglect while your team has three people whose entire job is maintaining the sprint backlog. Yet somehow they ship and you're still "refining requirements" for that button color change from last quarter.