• 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

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

August 12, 2014 by Dhaval Dave

Main DNA sequence(a string) is given (let say strDNA) and another string to search for(let say strPAT).
You have to find the minimum length window in strDNA where strPAT is subsequence.


Example :
strDNA = “BANANA”
strPAT = “ANNA”

Here ANNA is sub-sequence of BANANA (click sub-sequence to understand sub-sequence).
Length is 5 ANANA contains ANNA.

There are several ways to check for occurrence of string as subsequence of another string.
Through DP we can find more efficient answer for minimum length.
Considering simple case I have written code to check whether strPAT is subsequence of strDNA or not.

Thanks to Dhaval for suggesting this approach and Article

#include <stdio.h> 
main() { 
    char *x,*y;
    int count=0;
    int f=0;
    char a[]=”anna”;
    char b[]=”banana”;
x=a; y=b;
        while(*y){
           if(*x==*y){
               x++;
               f=1;
           }
           if(f==1)count++;
           *y++;
        }
if (*x!=’’) 
    printf(“n false (%s)n”,x);
else
    printf(“ntrue %dn”,count);

 }

You Can Check code at http://ideone.com/y4P2oI

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, problem Tagged With: Array, 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

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Find min element in Sorted Rotated Array (Without Duplicates)

Implement a generic binary search algorithm for Integer Double String etc

Printing each word reverse in string

Print Power Set of a Set

FizzBuzz Solution C C++

Difference between a LinkedList and a Binary Search Tree BST

Max Sum in circularly situated Values

Closed Parentheses checker

Knight Tour Problem (Graph – Breadth First Search)

Find loop in Singly linked list

BFS (Breath First Search)

Common Ancestor in a Binary Tree or Binary Search Tree

Skiing on Mountains Matrix

DFS (Depth First Search)

Mirror of Tree

Daughter’s Age VeryGood Puzzle

Given a float number convert it into the string WITHOUT using any inbuilt Function

VMWare Openings

Practo Hiring Experience

Find the smallest window in a string containing all characters of another string

Right view of Binary tree

Generate next palindrome number

Find Percentage of Words matching in Two Strings

Find if a binary tree is height balanced ?

Connect n ropes with minimum cost

Find the element that appears once others appears thrice

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Spanning Tree

Copyright © 2023 · Genesis Framework · WordPress · Log in