First round was online for 75 minutes on hackerrank.
3 sections: Aptitude,Output and 2 coding questions. Coding questions:
- Given a string find alphabetically first and last substrings which start with vowel and end with constant.
Solution: neveropen Link - Given a set of votes.Find the candidate with maximum number of votes.
There were 3 F2F rounds at Adobe Campus for candidates who cleared the online round
1.F2F Interview:
Asked about projects.
- Write a function to generate a string randomly
- OS Concepts in Page Tables and Virtual Memory
Solution: neveropen Link - In a continuous stream of words check if a duplicate word exists or not
The interviewer was very friendly and was giving good directions of help.
It was easy to clear this round 🙂
2.F2F Interview:
- Difference between process and threads
- Write a function to calculate x^n with least complexity
Solution: neveropen Link - Given a stream of words. Write a function to return K maximum frequently occurring words
- Check if one string is a rotation of other
Solution: neveropen Link - What is architecture of AngularJs. I had mentioned angularJs in my resume
- Given an array of pairs (Z,A),(A,F),(G,H),(F,G)
Construct a chained string out the given pairs. Z-A-F-G-H
The interviewer was expecting answers to the point.
I had cleared the 2nd round too.
3.F2F Interview:
- In a DBMS table in Gender Column M and F are exchanged.
Write a query to correct the column values. - Implement queue using two stacks
Solution: neveropen Link - This question appears tough to solve but has very easy logic
Solution: https://www.geeksforgeeks.org/print-all-combinations-of-balanced-parentheses/
I tried my best but could not answer this question.
All the questions can be answered with simple logic and presence of mind.
Complicated solutions leave a negative opinion on the interviewer.
Thank you GeeksForGeeks for providing an amazing platform :). A one stop solution for Geeks!!!!
If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!