Given a string s and two words w1 and w2 that are present in S. The task is to find the minimum distance between w1 and w2. Here, distance is the number of steps or words between the first and the second word. Input : s = “geeks for geeks contribute practice”, w1 = “geeks”, w2 = “practice” Output : 1 There is only one word between the closest occurrences of w1 and w2. Input : s = “the quick the brown quick brown the frog”, w1 = “quick”, w2 = “frog” Output : 2
everything from spring-boot, which was out of the scope
Não houve perguntas, a entrevistadora sumiu
What are beans (java)
build a request rate limit middleware
What are your opinions on psychology and mental health?
Standard technical questions about programming, ruby on rails, problem solving etc.
Basic questions about past projects.
Describe about yourself ,Oops concept, method overloading, method overriding snippet output: fibonacci series important annotation in spring boot - basic queries of mysql : 1. create table 2. insert table architecture of angular @Decorators annotation Explain how you have implement the microservice architecture.
What is Bean, what are the bean scopes and which is the default
Viewing 3911 - 3920 interview questions