Oppo R&D visited DTU campus on 8th August and selected 18 students. There were 1 coding round, followed by 2 technical interview rounds and 1 HR round.
Online Coding Round:Â There were 3 questions of different difficulty level to be solved in 1:30 hour. One of them is easy and 2 of them were of middle level.
- Given an integer N, we have to find the number of possible permutation of N integers ( 1 to N ) modulo 1e9+7 such that relative position of prime numbers remain same. Constraints: 1<=N<=1000000 Example: N = 5 Output: 12 Explanation: possible permutations are - (1, 2, 3, 4, 5), (1, 2, 5, 4, 3), (1, 5, 2, 4, 3), (1, 5, 3, 4, 2), (1, 3, 2, 4, 5), (1, 3, 5, 4, 2), (4, 2, 3, 1, 5), (4, 2, 5, 1, 3), (4, 5, 2, 1, 3), (4, 5, 3, 1, 2), (4, 3, 2, 1, 5), (4, 3, 5, 1, 2)
- Given an array of size N and an integer K, find number of possible subarrays such that sum of there elements is less than or equal to K. Constraints: 1<=N<=10^5 1<=Ai<=10^9 1<=k<=10^18 Example: N= 5, Ar = [2, 3, 1, 5, 6], K=6 Output: 9 Explanation: possible subarrays are - (2), (3) (1), (5), (6), (2, 3), (3, 1), (1, 5), (2, 3, 1)
- Given an array of size N. For all i, j such that 0<=i, j<N, find the sum of all possible Ar[i]/Ar[j]. Constraints: 1<=N<=10^5 1<=Ai<=10^6 Example: N=3, Ar = [2, 4, 5] Output: 8 Explanation: Ar[0]/Ar[0] + Ar[0]/Ar[1] + Ar[0]/Ar[2] = 1 + 0 + 0 = 1 Ar[1]/Ar[0] + Ar[1]/Ar[1] + Ar[1]/Ar[2] = 2 + 1 + 0 = 3 Ar[2]/Ar[0] + Ar[2]/Ar[1] + Ar[2]/Ar[2] = 2 + 1 + 1 = 4 total sum = 1 + 3 + 4 = 8
- Tell me something about yourself. As I proceed and tell them about my project, they start asking question from the project. Since my project was on face recognition, they asked me algorithm I used. Then ask for the pixels of image I captured, size of the image captured etc.
- Discuss about the internship project which I did at Amazon. Ask for the usecase of my project.
- Given the undirected graph, calculate the minimum distance between any 2 node. Ask for the time complexity. Gave my pen and paper and ask me to write the algorithm to find shortest distance between any two node for the directed graph.
- Which is your favourite subject? I said "Data structure and Algorithm", He replied apart from DS and algo. I told him Operating system and DBMS.
- What is critical section ?
- How to solve critical section problem?
- Given a critical section, Â two process can enter in that critical section at the same time. What would be the minimum and maximum value of variable a. Initial value of a is 200. critical section: { read a; a = a + 10; write a; }
- Tell me something about yourself and your family.
- Tell me something about Oppo and why you choose Oppo ?
- Recently, Oppo launch which mobile phone ? I have no idea about the newly launched Oppo mobile, So I directly say I don't Know.
- Do you have any problem in relocation to Hyderabad ?
- What are your strengths and weaknesses ?