SDE - 2

You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.

Note:

The given linked lists may or may not be null.

For example:

If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL

The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

All basics and fundamental kinds of questions from Android like launch modes, activity and fragment life cycle, ViewModel life cycle, types of layouts, etc.

Advance android concepts like room, coroutines, data bindings, binding adapters, live data, life cycle observers, and scopes.
ViewModel working in depth.

Kotlin basic concepts like null safety, Elvis operator, etc.
Kotlin scope functions, extension functions, lambda functions, higher-order functions.
Kotlin flow.

I had to describe and explain two to three projects that I have done in the previous companies

Tell me about yourself.

Why do you want to join us?

What are expectations from this company?