Count words whose i-th letter is either (i-1)-th, i-th, or (i+1)-th letter of a word | GeeksforGeeks

1,582 views · Published 14 February 2018 · 3:01 · Indexed 12 November 2026

Channel: GeeksforGeeks · 2018 · Education

Watch on YouTube

Find Complete Code at GeeksforGeeks Article: https://www.geeksforgeeks.org/count-words-whose-th-letter-either-1-th-th-i1-th-letter-given-word/

This video is contributed by Ishmeet Kaur

Please Like, Comment and Share the Video among your friends.

Install our Android App:
https://play.google.com/store/apps/details?id=free.programming.programming&hl=en

Follow us on Facebook:
https://www.facebook.com/GfGVideos/

And Twitter:
https://twitter.com/gfgvideos

Also, Subscribe if you haven't already! :)

More from this channel

• 4:58 Change a Binary Tree so that every node stores sum of all nodes in left subtree | GeeksforGeeks

  GeeksforGeeks

  3,604 views · 3 September 2017

• 10:07 Check if leaf traversal of two Binary Trees is same | GeeksforGeeks

  GeeksforGeeks

  3,296 views · 8 September 2017

• 4:14 Double Tree | GeeksforGeeks

  GeeksforGeeks

  3,569 views · 17 September 2017

• 4:53 Difference between sums of odd level and even level nodes of a Binary Tree | GeeksforGeeks

  GeeksforGeeks

  4,949 views · 18 September 2017

• 6:40 Level order traversal line by line | Set 2 (Using Two Queues) | GeeksforGeeks

  GeeksforGeeks

  2,026 views · 3 October 2017

• 11:04 Iterative method to check if two trees are mirror of each other | GeeksforGeeks

  GeeksforGeeks

  2,730 views · 4 October 2017

• 4:00 Check sum of Covered and Uncovered nodes of Binary Tree | GeeksforGeeks

  GeeksforGeeks

  2,515 views · 6 October 2017

• 1:52 Python Programming Tutorial | Counters in Python - Part 2 | GeeksforGeeks

  GeeksforGeeks

  4,716 views · 7 October 2017