Michelle Lawson on Instagram: "the p vs np problem is one of the biggest unsolved questions in computer science! 🥲 🦩 a ✨simplified✨overview: p problems: can be solved quickly, meaning there’s an algorithm that can find the solution in polynomial time (e.g., O(n^2), O(n^3)). a classic example is sorting a list with merge sort, which runs in O(n log n) time. np problems: solutions can be verified quickly in polynomial time, but we don’t know if they can be solved quickly too. for example, the tr