• 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

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

Python Dictionaries

Handle duplicates in Binary Search Tree

Walmart Labs Interview Experience

Closed Parentheses checker

K’th Largest Element in BST when modification to BST is not allowed

Reliance Jio Software Developer Interview Experience

Mirror of Tree

Find if two rectangles overlap

Practo Hiring Experience

Printing Longest Common Subsequence

Check if an array has duplicate numbers in O(n) time and O(1) space

Find position of the only set bit

Count number of ways to reach a given score in a game

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

Coin Collection Dynamic Programming

Client Server C program

Singly linked list

Printing each word reverse in string

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

simple sql injection

Fibonacci Hashing & Fastest Hashtable

Minimum insertions to form a palindrome

Skiing on Mountains Matrix

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

Maximum path sum between two leaves

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

Serialise Deserialise N-ary Tree

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

DFS (Depth First Search)

Copyright © 2026 · Genesis Framework · WordPress · Log in