SDE - 1

This problem is classic problem known as inversion count. I solved this problem using merge sort tree and got full points if we apply brute force on this then we will get time limit exceeded so we have to solve this in O(nlogn) complexity.

This problem in know as kadane's algorithm i solved this one using single for loop and passed successfully all the test cases.

Step 1 : I wrote first merge sort algorithm then i explained the worst case complexity for this one.
Step 2 : Interviewer cross questioned me what is divide and conquer approach.
Step 3 : I gave the definition for divide and conquer method
Step 4 : Then I continued explaining quick sort algorithm
Step 5 : Interviewer asked me about worst case scenario for quick sort then i replied when the array is already sorted he was happy.

Step 1 : I wrote a code for catching divide by zero exception
Step 2 : Then interviewer asked me about use of try catch finally and implement all in your code
Step 3 : Then I applied try first then catch statement for exception and then i wrote finally block .he was satisfied after my approach

Step 1 : I gave definition for access modifiers public private and protected then i used these modifiers in my code that i wrote in C++.
Step 2 : He asked me if we are in same package then can we access using protected or not then i replied yes.
Step 3 : Then interviewer asked me to write code for friend function.
Step 4 : I was not able to write that code then he helped me to write that code.

Tip 1 : Do practice about hash table data structure .
Tip 2 : Read about open addressing and closed addressing
Tip 3 : Learn how to remove collision. what are linear probing and quadratic probing

Tip 1 : Clear your concept in object oriented programming
Tip 2 : Do practice on OOPs concept ( Abstraction,Encapsulation,Inheritance,Polymorphism)
Tip 3 : Practice on concepts like overloading overriding interface packages multi threading

Step 1 : I wrote all condition for deletion in linked list first from the beginning of the linked list then between linked list and then deleting last node for linked list
Step 2 : Interviewer asked about complexity for each of them i replied for all three cases.
Step 3 : Then i explained it using diagram how we are implementing this algo
Step 4 : He found an error in my code when we have only one node
Step 5 : I resolved that one then he was satisfied

Tip 1 : Do clear your concept of basic dbms topics like functional dependency and normal forms
Tip 2 : Do practice on Sql commands
Tip 3 : Read examples on each normal forms

Tip 1 : Do practice on sql commands
Tip 2 : Read about concepts of Sql like primary key candidate key foreign key
Tip 3 : Read concepts like DDL,DML,DCL

Tip 1 : Do atleast two major projects.
Tip 2 : Explain your role in your project what you have done in your project
Tip 3 : Do have good knowledge of technologies and stacks that are using in project.