Oracle India Pvt Ltd Interview Experience for Application Engineer (L2)

All the interview processes are virtual because of pandemics.  All the three rounds are on the same day, or its depends on you 
Its a technical discussion not one-way communications, because the interviewer helping me to correct my approach to solve the problem.
Position applied: Senior Software Engineer (Experience 3- 8 years)
Round 1(Technical Round): In the first round asked totally concept-based, data structure and one cake puzzle.

• Tell me about yourself.
• C++ output based questions including the concepts of Inheritance, Virtual function, constructor, and destructor refer to below snippet – total 2 question asked.

C++

#include <iostream>
using namespace std;
int main() {
    int  *ip = NULL;
    cout << "Value of ip is: " << ip; //
    *ip = 10;
    cout << "Value of ip is: " << ip;
    return 0;
}

C++

#include<iostream>
using namespace std;

class Base
{
public:
    Base()
    {
        cout<< " Base Constructor called" <<endl;
    }

    virtual ~Base()
    {
        show();
    }

    virtual void show()
    {
        cout<< "Virtual method called" <<endl;
    }

    void printNow()
    {
        show();
    }
};

class YellowBase : public Base
{
public:
        YellowBase()
        {
            cout<< "Derived class Constructor called" <<endl;
        }

        ~YellowBase()
        {
            show();
        }
        void show()
        {
            cout<< "Derived class Virtual method called" <<endl;
        }
};

int main()
{
    YellowBase d;
    d.printNow();
}

• One linked list question, compare two linked list each node contain the character. Refer below link
• https://www.geeksforgeeks.org/compare-two-strings-represented-as-linked-lists/
• One cake puzzle. Refer below link
• https://www.geeksforgeeks.org/puzzle-3-cuts-cut-round-cake-8-equal-pieces/
• Find the minimum depth of the tree https://www.geeksforgeeks.org/find-minimum-depth-of-a-binary-tree/

You need to write all the code in notepad and share the screen.
After clear first round, they will proceed for the second round on the same day. 

Round 2(Technical Round):

• Again asked tell me about yourself.
• What is copy constructor and assignment operator? with proper example.
• Why copy constructor argument should be const in C++?
• https://www.geeksforgeeks.org/copy-constructor-argument-const/
• Why we need to pass the & operator in copy constructor.
• Efficiently need to implement two stacks in the single array. https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/
• Need to write the code, which is failed at run-time.
• Some real life problem, you need to tell which data structure and traversals will be used. In the below we need to find the size of the folders. Refer below problem.

D1--
       F1--F2--F3
       D1---
             F1--F2--F3
             D1--D2
                     F1
 D2--
        F1--F2--F3
        F4---F5
D3-
      F1--F2

• Scooter puzzle — In which one spare wheel, Each wheel having capacity to travel 5 km. How many distance you will be travel.
  Ans: First Step: Travel 2.5 km then replace the any wheel with spare wheel.
           Second Step: Again Travel 2.5 km, So the capacity of the replaced wheel will be finished.
           Third Step: Now use the wheel which you replace earlier, So total distance you travelled is 7.5 Km.
• And some question related to your projects and past experience.
• Which version control system you are using?
• What is DLL file?
• What is the extension of the binary file? (because in my previous organization project )
• Why you want to join oracle?

You need to write the clean code, on the notepad and share your screen.

Round 3(Managerial Round):

• Give brief introduction yourself ?
• Detail explanation of your projects, and some cross-question related to your projects.
• Why you want to join Oracle ?
• What is your salary expectations? 

Verdict: Selected (After two days they give confirmation)