Support Engineer - Intern

You are given a string ‘text’ and a string ‘pattern’, your task is to find all occurrences of pattern in the string ‘text’ and return an array of indexes of all those occurrences. You may assume that the length of ‘text’ is always greater than the length of ‘pattern’.

For example :

Let text = “this is a good place to have a good start”, pattern = “good” so you have to return {10, 31} because at 10 and 31 index pattern is present in the text.

Note :

If there is no such index in the text then just return an array containing -1.

1) What are Infix, prefix, Postfix notations? 
2) Which data structures are used for BFS and DFS of a graph? 
3) How can we replace multiple spaces with a single space?
4) How can we split Java String by newlines?
5) How to validate an email address in JavaScript?
6) OOps concepts all the principal based questions
7) Assignment for MCQ related questions For MYSQL, Data Base related goo through indiaxbix

Let me about your college days & what are the challenge are you facing till dates.