1.What is latest version of android and whats the new features for developer 2 .Difference bw paracables and serializable 3. what is build.gradle 4.how to switch bw fragment to activity 5. methods of adapter 6. what is request body parameter in network call 7. how we can do migration in room db
why Halliburton?
useless questions, not even 1 technical question for a technical role. 1st time in my carrier i have seen an Interview without even 1 technical question shot out & i'm wondering how i got rejected if there is not even one technical discussion happened . It's a time pass show. I hold another offer with another leading aerospace organization before diving in for boeing interview for the same developer position which means the skills sets remains same. Please think 100 times before applying for boeing position. It's a waste of 1 months Plus to know the status of the selection.I feel bad to be part of this Muppets show.
Interview question was given a grid of 9x9 sudoku with numbers filled in already, you have to check if it's a valid suoku.
Basically the interview questions were data structure. The first one was just a simple data structure question, but the second one was mathematical question. I hadn't expected that kind of questions would be asked, so I got really confused. The questions was to prove that Y is a multiple of six, where there are consecutive three numbers X, Y, Z and X and Z are a prime number. I was totally stuck at the point and couldn't make it.
nothing as such but you need satisfy them for your ability in IT.
You have a chest of 8 drawers. With probability 1/2, you put a letter in one of the drawers. With probability 1/2, you don't put a letter in any drawer. I open the first 7 drawers, all are empty. What is the probability there is a letter in the 8th drawer?
Given a coin with probability x (= U[0, 1] showing head at each flip, what is the probability that you got a second head after getting the first one.
Find the integer pairs in an integer array, so that they sum up to a specific number n.
Design a vector that can grow with the size with time complexity of O(1)
Viewing 431 - 440 interview questions