You are given an array of string pairs: (a1, a2), (b1, b2),... Concatenate all the strings such that for every pair (s1, s2), s1 appears *somewhere before* (doesn't have to be immediately before) s2 in the concatenation. If the same string is in multiple pairs it appears in the concatenation only once.
1) What is the difference between unit of work and repository pattern? 2) How does dependency injection work? 3) Where and why the Identity Framework and JWT tokens are used. 4) How to configure development server, production server and test server configuration files in the same project so that the project can run on any server later. 5) What is Docker and why is it needed and how does it work? 6) Why is background service needed and how does it work? 7) What's the difference between a string and a string builder? 8) How does index work in database?
Why you want to leave your current job.
There are two linked lists that have a common node, from which they continue as one. Find the common node
Q1: What do you do in the first interview? Q2: What do you do with the second interview?
Coding Question regarding recursion and DS. OOPS concepts. Java concepts. Database and SQL questions.
general to your skill set, but at the end they will expect you to answer something not in your skill set
tell us about ur project
I asked is there any bond
about education and previous experience
Viewing 681 - 690 interview questions