Skip to main content

Check If a Word Occurs As a Prefix of Any Word in a Sentence

 Given a sentence that consists of some words separated by a single space, and a searchWord.

You have to check if searchWord is a prefix of any word in sentence.

Return the index of the word in the sentence where searchWord is the prefix of this word.

If search word is the prefix of more than word, return the index of first word. If there is no such word return -1.

Ex:-

Input:  sentence= "I love burger" 

searchWord = "burg"

Output:  2

Ex:-

Input:  sentence= "I am tired" 

searchWord = "you"

Output:   -1

Java


 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
public class MyClass {
    public static void main(String args[]) {
      String sentence = "this problem is an easy problem";
      String searchWord = "pro";
      System.out.println(findIndex(sentence, searchWord));
    }
    public static int findIndex(String sentence, String searchWord){
        String[] arr = sentence.split(" ");
        int len = searchWord.length();
        for(int i=0; i<arr.length; i++){
            if(arr[i].length() >= len){
                if(arr[i].substring(0,len).equals(searchWord))
                    return i;
            }
        }
        return -1;
    }
 }

Python

def findIndex(sentence, searchWord):
    arr = sentence.split(" ")
    l = len(searchWord)
    for i in range(0,len(arr)):
        if len(arr[i]) >= l:
            if arr[i][:l] == searchWord:
                return i
    return -1    

sentence = "this problem is an easy problem"
searchWord = "pro"
print(findIndex(sentence, searchWord))

Popular posts from this blog

Check whether a number is Seed of another number

 A number P is said to be the seed of another number Q if multiplying P with its digits equates to Q. Ex:-  123 is seed of 738 as    123 * 1 * 2 * 3 = 738  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 public class Seed{ public static void main (String[] args){ int num1 = 123 , num2 = 738 ; num1 = Math. min (num1,num2); num2 = Math. max (num1,num2); System. out . println (checkSeed(num1, num2)); } public static boolean checkSeed ( int num1, int num2){ int seed = num1; while (num1> 0 ){ seed = seed * (num1% 10 ); num1 = num1 / 10 ; } if (seed==num2) return true ; else return false ; } } Python def checkSeed(num1,num2): seed = num1 while num1 > 0 : seed = seed * (num1 % 10 ) num1 = num1 // 10 if seed == n
Read more

Program to sort the first half of an array in ascending and second half in descending order

Ex:-  [2, 4, 3, 10, 5, 8] [2, 4, 3]  and [10, 5, 8] ====>  [2, 3, 4] ascending                                                              [10, 8, 5] descending [ 2, 3, 4, 10, 8, 5] is the required answer.  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 public class ArraySort{ public static void main (String[] args){ int [] arr = { 2 , 4 , 3 , 10 , 5 , 8 }; //sorting first half in ascending order for ( int i= 0 ; i<(arr. length / 2 ); i++){ for ( int j=i+ 1 ; j<(arr. length / 2 ); j++){ if (arr[i]>arr[j]){ int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } //sorting second half in descending order for ( int i=(arr. length / 2 ); i<arr. length ; i++){ for ( int j=i+ 1 ; j<arr. length ; j++)
Read more

Write a method to move hyphens to the left and characters to the right in a string

 Ex:-     code--heist--   ==>     ----codeheist Note:-  Return null or None if str is empty. Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 public static String moveHyphens (String str) { if (str. length ()== 0 ) return null ; else { String result = "" ; for ( int i= 0 ; i<str. length (); i++){ char ch = str. charAt (i); if (ch== '-' ) result = ch + result; else result += ch; } return result; } } Python def moveHyphens (str): if len(str)== 0 : return None else : result = "" for char in str: if char== '-' : result = char + result; else : result += char return result
Read more