- Interview Experiences, Marketing, Odessa, On-Campus

Odessa Interview Experience (On-Campus)

I applied in Odessa through campus in august 2021. The full process took 2 weeks. First Round was 40 MCQs and 2 Coding Questions (Medium) in which out of 380 students, 60 were shortlisted.Round 1: Technical Interview 1IntroductionAsked about my project.Backend Connectivity.JDBC connection.how is the connection done and where is the connection made(which file where etc)Asked about frontend which I mentioned I am learning.What have u made using Html and css and bootstrap?tables in HtmlInput tag etcDid you host your website somewhere?2. DSA: Given a n*n matrix find the sum of its diagonals.Given an array of weights. Find the minimum number of bags required to fill all the weights,The only constraint is, the difference between maximum and minimum weight should not be greater than 4.Concepts: if your ide has thrown compile-time error of a missing bracket. the compiler is checking that it is an error, how does the compiler know, what is its application is.Difference between array and LinkedList.Difference between arraylist/vector and LinkedList. in which scenario you will use what.Linear and non-linear data structure.Difference between stack and queues.BFS and DFS, how are they implemented.Working of BFS and DFS.Sorting Algorithms: Which all sorting you know. (I answered bubble, merge, insertion and quicksort.)Asked what is Selection Sort? (I answered I don’t know about selection, I know Insertion Sort.)Do you know only insertion sort? (I said no sir, I know merge, quick and bubble sort also)Tell me what is approach of Insertion sortWhat are its worst case and best case time complexity?When does the algorithm give worst-case complexity?Any questions u want to askI asked for feedbackHe said me to brush up on my DSA skillsEnded up asking the complexity of my matrix question.Was it was possible to code it using 2 for loops if yes then what will be the complexity.Do you know DBMSAsked about JOINSDifference between INNER JOIN and LEFT JOIN.SQL queries and how good are u at it.Asked a question.Fetch the employee name and manager name, given only employee id, emp name, and manager id in the table.Asked a puzzleAn insect keep eating twice the leaves till day 30Worm and the old tree puzzle (GFG).At last, he said That I was the one who asked questions but he ended up asking a lot of questions. I said That’s okay!Then he again asked if I have any questions for him.And as per feedback. My concepts were good, analyzing and approach are good.Need to brush up on DSA and DBMS queries etc.The interview was more than 1 hour 10 minutes!!Round 2: Technical Interview 2IntroductionDSA QuestionsAs I mentioned in my Resume I have solved 150+ questions he asked what type of question have u done or learned.I answered DSA questions on the array, LinkedList, Stack, Queues, Hashing, and Algorithms like Binary Search.2 sum problem(Leetcode) with a little variation of returning all the possible pairs.As the approach included the sorting of array he asked me which sorting algorithm will you use to sort the array.I said Merge Sort then he asked me to code Merge Sort (only functions, not executable). And then discussed the2 Sum problem and code.Discussion on the project.Do you know DBMS? How good are u at writing queries?Finally asked me to do u have any questions. (I asked him 2 questions, He was impressed).After this, there was supposed to be a 3rd last round or HR round but it did not happen and finally, 15 students were selected including meAttention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon. Google ,  E-Litmus and Microsoft Test Serieses.