Open In App
Related Articles

Zoho Interview Experience | Set 36 (Software Developer)

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Round 1:There were 10 C programming questions and 15 Aptitude questions. Round 2:  1. Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover the entire text (not partial text). The wildcard pattern can include the characters ‘?’ and ‘*’ ‘?’ – matches any single character ‘*’ – Matches any sequence of characters (including the empty sequence) Example: Text = “baaabab”, Pattern = “*****ba*****ab”, output : true Pattern = “baaa?ab”, output : true Pattern = “ba*a?”, output : true Pattern = “a*ab”, output : false 2. Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details.
Consider the following dictionary 
{ i, like, sam, sung, samsung, mobile, ice, 
  cream, icecream, man, go, mango}

Input:  ilike
Output: Yes 
The string can be segmented as "i like".

Input:  ilikesamsung
Output: Yes
The string can be segmented as "i like samsung" 
or "i like sam sung".<>
3.Print the following pattern
   1  
  3 2
 6 5 4
10 9 8 7
10 9 8 7 
 6 5 4 
  3 2 
   1
4.Given an array as input, The condition is if the number is repeated you must add the number and put the next index value to 0. If the number is 0 print it at the last.
Eg: arr[] = { 0, 2, 2, 2, 0, 6, 6, 0, 8}
Output: 4 2 12 8 0 0 0 0 0 .

Last Updated : 24 Jul, 2019
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads