Pergunta de entrevista da empresa NeoSOFT
L1 INTERVIEW: Introduce yourself? Explain your final year project? How was your planning for final year project? What were its advantages? What are pointers? What are the main OOPS Concepts? Explain them(polymorphism, inheritance, abstraction, encapsulation)? Explain each of them. What is a class and object? What is the difference between them. Write the code or give logic to reverse a string? Write the code to find sum of all digits of a number. (Eg: 5235 = 5+2+3+5 = 15) What is SQL? What are joins? Different types of joins? Explain primary key and foreign key? Did you use github for your project? Explain all github actions in detail? Does github pull copy complete repository or your own repository? What is HTML? What is CSS? Did you use CSS in your HTML file of your project or created new file for it? L2 INTERVIEW: How was your L1 interview? What was your main learning of the interview. What are your hobbies? What is different about you than your other classmates? Why should I hire you? What differentiates you from other interviewers? What is something different that you did in 4 years of college? Asked only 1 DSA Question 1) Find the third largest element? 2) find the i largest element. Where i can be 1st, 2nd, 3rd, 4th etc. Do you have any professional certifications?
Resposta da entrevista
Sigiloso
Solution of DSA 1) Take three variables 1st_largest, 2nd_largest, 3rd_largest. Iterate through the list, if arr[i] > 1st_largest then 3rd_largest = 2nd_largest, 2nd_largest = 1st largest, 1st largest = arr[i]. elseif arr[i] > 2nd_largest then 3rd_largest = 2nd_largest and 2nd_largest = arr[i] else if arr[i] > 3rd_largest then 3_largest = arr[i] n - length of array, i - ith largest element Time complexity: 0(n)(Less) Space complexity: i variables(More) (He didn't like the above solution. ) Search find kth largest element in an array 2nd approach can be first sorting the array and then finding the kth largest element