arr = [c,c,b,d,d,a,a,c,b,b,b,c,d,a] Given an array of characters, find the min length sub array within this array which has all the unique elements present in the array. unique = [c,b,d,a] worst = [c,a,a,a,a,d,d,d,b] //in this case the complete array becomes the min lenght sub array.. Write a function which accepts the char array and prints i,j of the sub array
Explaing spring annotations like @Configuation,@Value
Previous experience and some technical questions based on Oops with C++
What was the last things have you achieved on the previous job?
abstract class and abstract methods ,interface, class diagram, about project, mvc pattren, sql calls,
Destin patterns java microservices
Questions on various Design patterns asked
HashMap ConcurrentHashMap Sorting
What is the most difficult task made by you?
data structures & Alrorithm, design pattern and implementation, advance topics in your programming language
Viewing 6871 - 6880 interview questions