Tip 1 : Understand the concept for any algorithm you are studying, focus on how things are working even in single line of code, if you do that number of questions doesn't matter.
Tip 2 : Don't get confuse while choosing which online platform is good and which one is bad, Every platform has enough resources to crack any interview. Just make sure you completely finish atleast one platform. If you like CP then start practicing on SPOJ/Codeforces/TopCoder/CodeChef.
Tip 1 : Be confident about every single word written in your resume.
Tip 2 : Make sure your resume is of 1 page only.
The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.
Number N may be very large.
1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.
Consider N = 5 and the list ‘binaryNums’= [“0”, “01”, “010”, “100”, “101”]. This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.
Let the size of fishes present in the river from left to right be{ 4, 2, 3, 1, 5 }.
1. As fish 4 is faster and bigger than fish 2, so fish 4 will eat fish 2.
Remaining fishes: { 4, 3, 1, 5 }
2. As fish 3 is faster and bigger than fish 1, so fish 3 will eat fish 1.
Remaining fishes: { 4, 3, 5 }
3. As fish 4 is faster and bigger than fish 3, so fish 4 will eat fish 3.
Remaining fishes: { 4, 5 }
Now fish 5 cannot eat fish 4, as fish 5 is faster than fish 4 and they swim from left to right. Thus, fish 4 will never reach fish 5.
Finally, we are left with only 2 fishes.
Consider If N = 2 , M = 4, Time = [[0, 2], [3, 0]] and Toll = [[0, 10], [ 5, 0]]]
The optimal path to reach node 1 from node 0 is 0 -> 1. The time required in the path is 2, and the minimum toll needed within the given time constraints is 10. Hence the answer is 10.
It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.
Consider lines at an angle of 135 degrees(with respect to standard X- axis) in between nodes. Then, all nodes between two consecutive lines belong to the same diagonal
The diagonal traversal for the above tree is:
0 2 6 1 5 3 4 7
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?