How to Code(Python): Coding Practice #1
Channel:
Subscribers:
1,000
Published on ● Video Link: https://www.youtube.com/watch?v=GD3VFkNeWvI
The Efficiency of this Algorithm is O(n) if you find a more efficient method you can comment it below.
Problem: Given a string s and a character c, find the distance for all characters in the string to the character c in the string s. You can assume that the character c will appear at least once in the string.
Links:
Previous:
My Channel: https://goo.gl/IW4SZG
Other Videos By Notch Network
Tags:
minecraft
notch network