• 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

Given Set of words or A String find whether chain is possible from these words or not

August 25, 2014 by Dhaval Dave

You are given N strings or N words. You have to find whether a chain can be formed with all the strings given namely n ?
Chain : A chain can be formed between 2 strings if last character of the 1st string matches with the first character of the second string.
Example : cat ,eng, galactic, tree
These words Create chain as  …  TREE,ENG,GALACTIC,CAT or CAT, TREE, ENG, GALACTIC
Try to think as its simple solution.

Logic 1)
Brute Force Approach : With each word from input string and try to create chain.
example 
Input : English, Yellow , Maths , Chemistry , Water , Horse
Take word  “English” which ends with “H” Find another word which starts with H.
Like wise continue and if you can’t find chain containing all words return “failure”
else return “true”
Logic 2) 
Create Two array for Input words
Arr1 = Contains only first character of all words
Arr2 = Contains only last character of all words
Now check if all occurrence of Arr1 are part of Arr2 or not.
If they are then they create Chain  else not.
Example 1) 
For Input English, Yellow , Maths , Chamistry , Water , Horse
Arr1 = { e , y , m , c , w , h}
Arr2 = { h , w , s , y , r , e }
Example 2)
For Input cat ,engg, galactic, tree
Arr1 = { c , e , g , t }
Arr2 = { t , g , c , e }
Example 3) : 
For Input : Apple, elephant, truck.
Also creates Chain and not ring.
Arr1 = { a , e , t }
Arr2 = { e,  t , k }
Modification : 
Only One character from Arr1 and one from Arr2 can be considered if only if they both are not from one word.
means here apart from  ‘a’ of Arr1 and ‘k’ of Arr2 we can eliminate for occurrence count if they both are not from one word.
say words are ark, elephant, tree will also create same Arr1 and Arr2 as above Example3) but as “ark” contains both starting and ending character which doesn’t meet. This Words cant create chain.
Code  :
 Its Very Simple code Please try at your own.
Thanks Dhaval for suggesting this Approach and  article.

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft 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

Introduction To Number Theory ( Part 1 )

Find if two rectangles overlap

Find the element that appears once others appears thrice

Maximum sum contiguous subarray of an Array

Spanning Tree

Maximum difference between two elements s.t larger element appears after the smaller number

Possible sizes of bus to carry n groups of friends

Find min element in Sorted Rotated Array (With Duplicates)

Get Minimum element in O(1) from input numbers or Stack

Find Nearest Minimum number in left side in O(n)

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

Reversal of LinkedList

Cisco Hiring Event 21st – 22nd Feb 2015

Print all nodes that are at distance k from a leaf node

Trapping Rain Water

Apriori algorithm C Code Data Mining

Connect n ropes with minimum cost

Calculate price of parking from parking start end time prices

SAP Off Campus Hiring_ March 2015 Verbal Skills

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Trie Dictionary

Sequence Finder Dynamic Programming

FizzBuzz Solution C C++

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Print vertical sum of all the axis in the given binary tree

Knight Tour Problem (Graph – Breadth First Search)

Advanced SQL Injection

Find Pythagorean Triplets in an array in O(N)

HackeEarth Flipkart’s Drone

flattens 2 D linked list to a single sorted link list

Copyright © 2025 · Genesis Framework · WordPress · Log in