medium level of interview with dsa questions,oops,databases,3 rounds
Brief Introduction
Given a number print whether a number is prime or not (wrote simple Brute force approach)
Print prime numbers from 1 to n (my approach was taking the time of O(N^2))
explain Encapsulation with a real-life example
Explain the Friend keyword and its uses in oops
Asked about my project Briefly, and explained it well
Asked me about error exceptions explained to him a little bit with no proper idea but he keep on adding hints to it