Tip 1 : practise coding a lot
Tip 2 : practise system design interviews
Tip 3 : keep basics of is, networking, cryptography, distributed computing clear
Tip 4 : be stress free during interviews
Tip 1 : keep resume small and filled
Tip 2 : mention all experience related to job, maybe need to change according to different jobs
Tip 3 : extra curricular is mostly not required, but can be used as a filler
Timing : 9AM
Hackerrank test platform
Was needed to solve two problems completely



If the given list is (1 -> -2 -> 0 -> 4) and N=2:

Then the 2nd node from the end is 0.
Iter over list, if n = 1, return element past head, otherwise, iterate untill nth element, remove it and return head of list



Input:
3
3
4 6 8
3
2 5 7
2
1 9
Output:
1 2 4 5 6 7 8 9
Explanation:
First list is: 4 -> 6 -> 8 -> NULL
Second list is: 2 -> 5 -> 7 -> NULL
Third list is: 1 -> 9 -> NULL
The final list would be: 1 -> 2 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> NULL
Create a priority queue of heads of linked list. While there are elements in priority queue. Remove smallest head. Add it to another list. Increase the head. If there are more elements in that list. Add the head back to priority queue.
Timing : 2 PM
It was a technical coding round
Needed to solve 3 problems,
2 on coding
1 on simple design
You are given a multicore server and a distributed queue. You need to fetch elements from queue and store them into db.
Told a solution of running a master thread, which checks the queue and allocats more thread for processing entries.
Tip 1 : ask more questions about the problem
Tip 2 : no solution is best, starting with a simple approach is ok
Tip 3 : cleanly communicate your thinking



The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

First iterate both the lists and find there lengths. Then start at both the heads of list. Move the head of longer list by difference of their lengths. Now move both heads together. As soon as both heads point to same element, we have found the first common element.



Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Create a stack.
Iterate over string.
If it is opening bracket in stack, add to stack
Otherwise
If top symbol in stack matches this bracket, remove it
Otherwise
Invalid = true
If stack is not empty
Invalid = true
What test cases will check for a program which moves files.
Tip 1 : don't stress too much
Tip 2 : keep calm and think about problem
Answer I gave:
1. Checking with a large file
2. Checking moved file for corruption
3. Checking for moved file going disappeared
4. Checking for program stuck
What is the output of i = 100; --(i++)
Answer : 99
Asked about college projects, course taken online and self study. Asked about books read and what am I doing these days. Questions related to courses taken recently. Questions about distributed computing, nosql as such.
Timing : 11PM
Hr behavioural round
Asked questions about past experiences with team mates, why u want to join jio as such.
How will u explain to your grand mother what job do you do.
I answered " i will say i work on computer and do computer job. That will be enough for her". He seemed ok.
Why you want to join jio.
I answered "jio is an Indian company, which brought internet data revolution. I and my family are using jio right now". He seemed happy with we using jio sim.
Explain any bad experience you have working with team.
I explained a college project experience with any negativity. He seemed ok with it.
Are you ok working in team or alone.
I am ok with both. I have done work alone and in team in past.
Explain any last minute hush movement experience.
I told him about our projects and classes are many time last minute hush or sudden. He didn't mind it.
Are you ok to relocate
Yes

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?