DSA 1 - The problem asks to determine the final position of a robot after executing a series of "u" (up) and "D" (down) commands. The robot starts at a position, and moves one step up for each "u" command and one step down for each "D" command. The goal is to return "u" if the robot ends up above the starting position, "D" if it ends up below, and an empty string if it ends up at the starting position. DSA 2 / 3 / 4 were releated to graph and array.
- Perguntas bem técnicas de comparação, conhecimento e aplicação - Perguntas sobre momentos diversos da carreira e reações - Perguntas sobre cultura e objetivo
Desarrollo de Software Programación Orientada a Objetos Android Git Metodologias Estructuras de Datos
POO, Multi Threading. Race condition, SOLID, Clean, Android, Java, Kotlin
was a lot about android api, kotlin, android jetpack, dependencies, libraries, SOLID principles, clean code android lifecycle.
How does the Internet work?
Let's imagine a situation where your colleague insists on his solution to a problem, and you insist on yours. How would you act in this situation?
Basic questions related to profile
ListView, REST, Loaders, images loading
Basic OOP, Java, Android concepts Patter Design, Patter Builder, Dependency Injection, Networking Libraries- Retrofit etc. Android Parcelable
Viewing 5861 - 5870 interview questions