implement BFS. Follow up : without using queue. find max sum in an array with out selecting any adjacent elements. DSA Binary tree preorder traversal find max sum in an array with out selecting any adjacent elements. Combination problem with cards Android questions project questions service vs intent service mvp vs mvvm Dagger 2 layout drawing process design fb like button on client side. Moshi basics how recyclerview works memory leaks
tell me about yourself, explain previous project roles and responsibilities
What is a pointer and a null pointer
2d array, find path between top left corner and right bottom corner.
All based on the initial project worked on. Pros: Presentation oriented, so good implementation and communication is tested Cons: Something that can be read from documentation should not be your question. There is not much digging on writing efficient code.
- One DSA question related to matrix - Craft question: You need to implement it following the SOLID principles and design patterns along with some unit tests. Give a high level design diagram also.
check if the given number is a multiple of 3, check if the strings if rearranged can form a palindrome or not
DSA and HLD were asked. 2 rounds hld one DSA. I performed bas in one HLD interview got rejected.
Diameter of a binary tree
process an image for image processing
Viewing 1081 - 1090 interview questions