Wissen Technology
Job Title: Analyst

Job Location: Mumbai, Pune, Bangalore

Eligibility: 7 CGPA and above (the company may shortlist)

Eligible streams: COMP/IT/Electronics/Electronics and Telecommunication

Round 1: Coding Round

• 5 MCQ based questions on Space complexity, Time complexity, Basic Algorithm, and Pseudocode

Coding Questions:

• Given M red candies N blue candies and K. Find the total no. of arrangements possible provided that any red or blue candy can be placed only K times next to each other.
• Given a binary string whose subsequence can be turned into a decimal number. Find the maximum prime numbers of the numbers formed Note: Order of string can’t be changed
• Given the array of N numbers and Q queries of type [L, R]. For each query [L, R] count the numbers whose Frequency in the range(inclusive) is equal to 2nd max number in the range. max no. can be the same as 1st max no.

Around 13 Students were shortlisted out of 300 Students after this round
KJSCE, SPIT included.

To crack this round one needs to know Recursion and Dynamic Programming well. My tip is once you figure out its Dynamic Programming question and you are not confident in this topic just code and submit the recursion approach some test cases will be executed, later you can optimize to DP.

Round 2: Technical Interview 1

• Tell me about yourself.

• Concept of oops such as inheritance, polymorphism, abstraction, encapsulation and explain each one.
• What are Stacks and Queues?
• What is LinkedList? Explain the Node Structure (I used Python so Class Node).
• Explain in short what are the various scheduling Algorithms.
• DSA Question of occurrence count in a string.
• Difference between Merge sort and Quicksort.
• Questions on Cryptography (Private and Public Key Architecture, Difference between Cryptography and Hashing) as my project on the resume was on cryptography.

Round 3: Technical Interview 2

• Tell me about yourself.
• Coding question 1: Count occurrence in a string, modification nth occurrence.
• Coding question 2: Write the binary search program of the array.
• What are different types of sorting algorithms?
• Difference between Merge Sort and Quick Sort
• Code Quicksort (I could explain the logic but had some bugs in the code)
• What are threads?
• What if Morgan Stanley or any Other FAANG/MNC visits the campus and you are eligible. Will you go for it? (Just answer this smartly)
• Database Query (Nested) on Join and Select.
• Explain the 3 Tier Architecture and Show the code snippet on the GitHub page of your project where you have implemented this.
• Questions on Cryptography (Private and Public Key Architecture, Difference between Cryptography and Hashing) as my project on the resume was on cryptography.

Round 4: Director Round/Pro-fit Round (This round is with one of the Co-founders)

• Introduce yourself.
• Name of Previous Interviewers (Yeah! And they shared the common first name my friends had so I was lucky to remember them.)
• Questions asked in the previous round. (I played smart here I recalled most of the questions and answered them as well so that I am not asked those again as these questions covered almost everything).
• The trick worked he asked me my favorite subject to which I replied Data Structures and Algorithms with the reason that “There is a pattern to every problem and if you apply that the problem becomes too easy to solve”.
• The interviewer shared his screen, scribbled something on Microsoft paint, created sectors in the Diagram, and filled the sectors using different colors with the help of “Fill Tool”. Once he was sure that I have understood what the fill tool does he asked me to implement this.
  He wanted to know what data structure would be used. [2D array].
  I implemented the BFS algorithm and completed the sudo-code.
  But he wanted the working code. So, while I was doing that, he was asking questions about college, and some general HR-based. As my screen was being shared, he could see my approach to code. (TIP always keep saying softly what this line will do as you code). Once I was done with the code. I told him that I am done but before I finalize, I would want to test it with some edge cases. He was very much Impressed by me testing my code to find bugs and fixing them. Finally, I demonstrated to him the code with a 2D integer array.
  Finally, I had to mail him the code files of all the rounds.
  On asking for feedback, I was told to learn Java in my free time for the reason that it’s used widely in the Indian IT Industry.

Verdict: Selected.

Tip:

• Study core subject (OS, DBMS, OOPS) well. Knowing the concepts is enough.
• Practice all easy and medium-level interview questions from the Leetcode interview section card.
• As all rounds are mostly teach based speak as you code (be in the interviewer’s ears all the time).
• As far as possible explain the concepts in your own words as whatever you say next question is on that word/concept so avoid jargon/concepts you are not confident with.
• Most of the candidates were asked major questions on their resume i.e. Projects and Internships, so DO NOT include projects you don’t know well in your resume as there are high chances you will be asked to open a certain project and explain the working of the complete project or some part of it. Usually, in Machine Learning projects you are asked to explain the Algorithm, So I would suggest if you are not confident in ML do not include that project in the resume.
• Finally, although interviews are 60% luck-based I believe in the quote
  “The harder you work, the luckier you get”. So just be consistent with your preparation and do not compare with your peers. Always ask for feedback at the end of your interview and implement that feedback in your next interview.

Feel free to reach out.
You can connect with me on LinkedIn, follow me on Github. I regularly tweet about Computer Science. So, follow me on Twitter.