CareerCup

Implement binary addition of two strings.
For example "101101" and "111101" equal "1101010"
You cannot use any type conversion, operate only with strings.

Views are not lifecycle aware that's true but what more? In modern development there is hardly any difference.

What is a different between view & fragment in modern android development. (Interviewer was not happy with answer related "lifecycle awareness")

You have three Arrays.
A = {2, 5, 3, 2, 8,1}
B = {7, 9, 5, 2, 4, 10, 10}
C = {6, 7, 5, 5, 3, 7}

make an array from this three arrays which elements is present in at least two array.

This question was followed by instead of three arrays. If you have a list of array then what will be the solution? Also what will be the time complexity?

Add two numbers represented as LinkedList (not LeetCode 445 which uses ListNode)
e.g
inputs: '5'->'6'->'3'
'8'->'4'->'2'
output: '1'->'4'->'0'->'5'
method signature:
LinkedList<Integer> sumList(LinkedList<Integer> l1, LinkedList<Integer> l2)

Given a binary tree, where each node represents an integer, find the max value of path sum.

Move[inplace] the non zero elements at the one end(end of array) and return the numbers of non zero elements in output array

Solution : https://www.geeksforgeeks.org/move-zeroes-end-array/

what is UI/Main Thread in android.
when you can use Thread over Service

Why facebook?
What was the biggest technical problem that you solved?
Do you have any apps on google play?
Give me a scenario where the requirements were ambiguous, what did you do?

Design Instagram like app end to end

Given a string "L*&EVe)))l", write a method which will determine if the input is a palindrome. Ignore all special characters. Uppercase/lowercase should be considered as same.

Imagine a room full of people, with only 1 celebrity in the room. Celebrity is defined as a person who does not know anyone, but everyone knows him/her. Write a method who will take array of people and a person as input and return boolean if the person is a celebrity or not.

Suppose there is a map with N bikes on it and now we have N individuals,
Design an algorithm so that everyone can get the bike in the shortest distance

You have a non empty binary array with value 0 and 1. You can flip either 0 or 1 bit of array to make the consecutive element same.You have to return the count of consecutive number with same digit.

Input : [ 1,0,1,0,0,0]
Output : 4
if you flip the value of 1st index to 1, you have 2 consecutive 1 and 2 consecutive 0 so total 4.

input : [0,0,0,0]
output : 3

input : [0]
output 1

there is bug in below code which i couldn't find it.

class Solution {
    int solution(int[] A) {
        int n = A.length;
        int result = 0;
        for (int i = 0; i < n - 1; i++) {
            if (A[i] == A[i + 1])
                result = result + 1;
        }
        int r = 0;
        for (int i = 0; i < n; i++) {
            int count = 0;
            if (i > 0) {
                if (A[i - 1] != A[i])
                    count = count + 1;
                else
                    count = count - 1;
            }
            if (i < n - 1) {
                if (A[i + 1] != A[i])
                    count = count + 1;
                else
                    count = count - 1;
            }
            r = Math.max(r, count);
        }
        return result + r;
    }
}

Given a Map (representing an old phone key number and possible letters present there) and a sequence of keys return all possible combinations of strings that are possible to produce.

Map<String, String[]> map = new HashMap<String, String[]>();
    map.put("1", new String[] { "a", "b", "c" });
    map.put("2", new String[] { "c", "d", "e" });
    map.put("3", new String[] { "f", "g", "h" });

String in = "12";

List<String> mix(String in, Map<String, String[]> map)

The result for "1,2" should be [ac, bc, cc, ad, bd, cd, ae, be, ce]

Given a linked list with next and random pointer, deepcopy the linked list and return new head.

Node {
char val,
Node next,
Node random }

A {
val: ’a’
next: D
random: G}

D {
val: ’d’
next: G
random: A}

G {
val: ’g’
next: null
random: D}


-----------
| |
| V
A -> D -> G -> null

-------------
| |
| V
A' -> D' -> G' -> null

Explain in detail about your favourite android api.

I get a chance to talk to Facebook software engineer during my android engineer interview. He asked me couple of question about native android like diff between views and fragment, mutable and immutable string, diff between string builder and string and a programming question convert int into words.

I got my interview yesterday and the problem they asked me was: Giving a method intToEnglish that receives an int as a parameter, how do you return its representation in english words. The number can be of any size but no more than around 2 billion since the parameter is an int 2ˆ32

Given an Array of N elements and Integer K, write a function that returns true if the sum of any 2 elements of Array is K, false otherwise.

Given the linked list is sorted, implement a method for insert and element in such a way that the list remain sorted.

Implement a linked list and all its basic operations (add, delete, remove and insert)

You are given an integer N. Write a code to calculate 1! - 2! + 3! ... up to N terms.

You are given a function F6() which return 1,2,3,4,5,6 randomly with equal probability. Implement a new function F12() which returns 1 to 12 randomly with equal probability using F6().

Given an arithmetic expression, write a program to find the value of the expression. Only binary operations that are allowed are +,-,*,/. Also assume that all parentheses are well matched.

Note that the use of eval() is forbidden

Input format :There is a single positive integer T on the first line of input . It stands for the number of expressions to follow.
Next T lines followed by expression
Output format : For each expression print the value of expression

3
19 + 12 / 4 - ((4 - 7) * 3 / 1)
1 + (2 - 3) * 4 + 5 - 6 * 8 - (18 * 12 * 13) - (11 / (5 + 2 + 4))
((2 + 4) / 3 - 2 + 1)

Output:
31
-2855
1

Write a method given a string with unbalanced parenthesis, the output should return a string with balanced parenthesis.

Ex: (a(b(c)de should change to (a(b(c)d)e)

Tell me about one Android API that you had difficulty using in a project and how did you resolve that Issue.

Find the uncommon elements from 2 lists.
I/P :
List 1 : 1, 2, 3, 4, 5
List 2 : 3, 4, 5, 6, 7

O/P : 1, 2, 6, 7

I/P :
List 1 : 1, 2, 3, 1, 5
List 2 : 3, 4, 5, 6, 7
O/P : 1, 1, 2, 6, 7

Most probably using space O(n)

Imput Output
81 --> 9^2 --> 1 (as its only 9)
82 --> 9^2 + 1^2 --> 2 (as 9 & 1)
6 ->> 2^2 + 1^2 + 1^2 --> 3 (as 3 elements 9, 1 & 1)

SO how can we solve this question

A museum was represented by a square matrix that was filled with O, G, and W where O represented open space G represented guards, and W represented walls. Write a function that accepts the square matrix and returns another square matrix where all of the O's in the matrix are replaced with the number of how many spaces they are away from a guard, without being able to go through any walls.