Description of Technical Interview:

Round 1-
The interviewer was very friendly. First, he looked into my resume and asked for a small introduction of my projects, then he asked me to write some tables and their attributes from my DBMS project in the hackerrank code editor.
Then he modified one of the tables and gave a question and told me to write a SQL query. The query was using aggregate function and group by clause. Then he asked me if I knew trees, to which I said yes. Then I was asked to write a pre-order traversal code (using recursion was fine) along with its time and space complexity. Then he asked which tree is best for searching and some indexing in the database question(I answered B tree).
Round 1 was over and he seemed satisfied with all my answers.


Round 2-
He looked into my resume and asked about my DBMS project. Then he moved on to the coding part-
Q1- Given a string, we have to find the first non- repeating character in the string.
Ex- string is "sggssjda" then output will be 'j'
I first told my approach to solve it and then he asked me to write the code and then execute it.
I solved it using hash-map and also given time complexity.
Q2- To find the kth largest element from a given array. For this he said just to write pseudo code. I gave two approaches i.e. using priority queue and using sorting (quick sort) along with their time complexities. But he was asking about a more optimized method which I couldn't but then he said that's okay.
Moving forward, he asked questions from oops part, like encapsulation with real life examples, inheritance with examples. After this, we discussed a lot about method overriding, method overloading, runtime and compile time polymorphism etc.
Then he asked me to define normalisation with any example by writing table names with its attributes in the code editor. Then he asked about the normal form of the given example to which I explained the criteria of all the normal forms and then identified it.
Round 2 was over then and I was asked to wait for round 3