[GeeksforGeeks] One Edit Distance

In this video, we solve the problem to check if the edit distance between 2 strings is 1. We develop a linear algorithm with O(m+n) time complexity. This is a popular question from Microsoft, Amazon, Salesforce interviews. ========================================== GET MORE EXCLUSIVE INTERVIEW QUESTIONS TO CRACK YOUR INTERVIEWS! Subscribe to “Cracking the FAANG Interviews”: https://www.youtube.com/channel/UCNrJBUctqwkRlL4TArUb-VQ?sub_confirmation=1 Follow us on Facebook: https://www.facebook.com/crackFAANG/ Follow on on Twitter: https://twitter.com/CrackFaang CRACKING THE CODING INTERVIEW BOOK: https://www.amazon.com/gp/product/0984782850/ref=as_li_tl?ie=UTF8&camp=1789&creative=9325&creativeASIN=0984782850&linkCode=as2&tag=crackingfaang-20&linkId=5a26b319c0cabc0587f206dd5f6a0d73 CRACKING THE SYSTEM DESIGN BOOK: https://www.amazon.com/gp/product/B08CMF2CQF/ref=as_li_tl?ie=UTF8&camp=1789&creative=9325&creativeASIN=B08CMF2CQF&linkCode=as2&tag=crackingfaang-20&linkId=197dfe477c5bbb6340a3204fe0705ef5 Apple iPad (Video recorded by): https://www.amazon.com/gp/product/B08J61FCVN/ref=as_li_tl?ie=UTF8&camp=1789&creative=9325&creativeASIN=B08J61FCVN&linkCode=as2&tag=crackingfaang-20&linkId=4fc23c97558d67749847088431b402e5 ========================================== GeeksforGeeks link: https://leetcode.com/problems/edit-distance/ Please like, subscribe and share for more.