#crackingthecodinginterview #codinginterview #programmingquestions
We tackle a problem from 'Cracking the Coding Interview' book and take a dive into understanding the solutions. Given two strings, are they more than one edit away from being the same? Let's go through the question and see how we can tackle it with different solutions. We will also look at the Big O Notation time complexity for each solution. Explaining this in an interview will let the interviewer understand you have some knowledge of why one solution may or may not be better than another.
0:00 - Introduction
1:02 - Problem Examples
3:15 - Solution #1 Explanation
6:58 - Solution #2 Explanation
13:45 - Big(O) Notation
14:10 - Solution #2 Coded
19:20 - Outro
If you have any questions or need clarification, comment down below and I will respond to you!