• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find Percentage of Words matching in Two Strings

July 28, 2014 by Dhaval Dave

There are two strings s1 and s2. Find the maximum of percentage word matching from s1 to s2 and s2 to s1.
Where, percentage word matching= (Total words matched in s2/total number of words in s1) *100
Working code :
Simple Logic : tokenize One String into words.
Check whether word is part of another string.
PS : coding is tricky here as it consists of Strings and String functions.
First try by your self and then check here for reference.
Thanks to Dhaval for suggesting this approach and Article
#include <stdio.h>
#include <string.h>
 
int wordCount(char s1[]){
int i,wc=1;
 for(i=0;i<=strlen(s1);i++){
    if (s1[i]==’ ‘ ) wc++;
 }
return wc;
}//wordCount
 
int findPercentage(char s1[],char s2[],int n){
 int i=0,j=0,mc=0,wc1,wc2;
 char w1[n],w2[n];
 for(i=0;i<=strlen(s1);i++,j++){
     w1[j]=s1[i];
     if(s1[i]==’ ‘||s1[i]==”){w1[j]=”;j=-1;
        if(strstr(s2,w1))mc++;
     }//if
 }//for
 wc1=wordCount(s1);
 wc2=wordCount(s2);
 printf(“Common words = %d nC1 = %d % nC2 = %d %” ,mc, (mc*100)/wc1,(mc*100)/wc2);
}//findPercentage
 
int main(void) {
int max;
char s1[]=”This is sparta”;
char s2[]=”sparta is a country”;
max=strlen(s1)>strlen(s2)? strlen(s1): strlen(s2);
findPercentage(s1,s2,max);
return 0;
}
Working Code you can find at  : http://ideone.com/e.js/EdL7NH

Similar Articles

Filed Under: Amazon Interview Question, Interview Questions, problem Tagged With: Dynamic Programming, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Urban Ladder Written Test.

Cisco Hiring Event 21st – 22nd Feb 2015

Trie Dictionary

Find the element that appears once others appears thrice

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Implement LRU Cache

Diagonal Traversal of Binary Tree

Singly linked list

C++ OOPs Part2

Closed Parentheses checker

Best Java Book | Top Java Programming Book for Beginners

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Spanning Tree

Naurki.com Security Breach

Length of the longest substring without repeating characters

Maximum size of square sub matrix with all 1’s in a binary matrix

25 horses 5 tracks Find 3 fastest puzzle

Circular Linked List

How strtok() Works

Python List

Difference between a LinkedList and a Binary Search Tree BST

Find next greater number with same set of digits

Generic Object Oriented Stack with Template

Add Sub Multiply very large number stored as string

Advanced SQL Injection

Convert number to words java

Generate next palindrome number

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Check Binary Tree is Binary Search Tree or not

Copyright © 2025 · Genesis Framework · WordPress · Log in