You have big text and word with length L you should find all words in this text which begin like our word with complexity O(L). for example text "abc abd abb ax aor mxx mx1" word "mx" result "mxx mx1".
Developer Interview Questions
269,303 developer interview questions shared by candidates
Print the series 6,15,35,77....
All the interview questions were asked from the resume...such as If I developed a new language in which no inheritance and encapsulation is not supported then what will the impact on the language?
Check if a string is a palindrome. Questions about optionals. Auto layout
What's the best way to create a multi-threaded process to combine multiple pieces of data into 1 PDF file?
find missing value from n continuos numbers. they say it as algorithm question
Mainky from OOP concepts and python basics.
Write a numeric array where any number devisable by three returns "Pro", divisible by 5 returns "Model", and divisible by three and five returns "ProModel"
How would you call this function: func twoStrings(_ stringOne: String, _ stringTwo: String)
Are you interested?
Viewing 1761 - 1770 interview questions