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.
SOLID principles
Chat bot app and required to fix some issues in the code.
How Android Works?
Nothing was asked, because it seems like my CV was not even reviewed.
LCA for a non binary tree.
1. reverse a string
Allocating memory, When you run a program which is stored in the stack and which is stored in the heap
simple behavioral questions like tell me about the time where you have to disagree with your colleague ?
Coroutines, Compose, Clean Architecture, Time Complexity of the functions
Viewing 401 - 410 interview questions