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 23 September 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:00 Check sum of Covered and Uncovered nodes of Binary Tree | GeeksforGeeks

  GeeksforGeeks

  2,514 views · 6 October 2017

• 2:03 Lexicographical concatenation of all substrings of a string | GeeksforGeeks

  GeeksforGeeks

  4,129 views · 26 February 2018

• 5:21 Print the nodes at odd levels of a tree | GeeksforGeeks

  GeeksforGeeks

  2,262 views · 10 March 2018

• 4:42 Count number of nodes having more number of children than parents in n-ary tree | GeeksforGeeks

  GeeksforGeeks

  1,877 views · 30 March 2018

• 3:29 Place N^2 numbers in matrix such that every row has an equal sum | GeeksforGeeks

  GeeksforGeeks

  1,155 views · 4 October 2018

• 1:43 Count Words in a string | GeeksforGeeks

  GeeksforGeeks

  3,624 views · 18 October 2018

• 3:52 Reverse first K elements of given linked list | GeeksforGeeks

  GeeksforGeeks

  2,757 views · 12 November 2018