# Wissen Technologies Interview Experience | Analyst | Set 1

Company Name: Wissen Technologies

Job Role: Analyst

Years of Experience Required: 0

Drive: On Campus

CTC: 8LPA

# Preparation for Wissen Technologies

Topics:  Data Structures and algorithms, Python, DBMS, OS, Computer Networks.

Duration: 4-6 months

Source of Preparation:  Practice on various coding websites like Codechef, Codeforces, Hackerrank, GFG, Leetcode, etc. Computer fundamental subjects from various youtube channels.

Also, Striver’s SDE Sheet is concise and super helpful.

[BONUS]:

# Wissen Technologies Interview Rounds

Round 1: Online Coding Test

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

Problem list :

Problem Statement: 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.

Problem Statement: Given a binary string whose subsequences can be turned into a decimal number. Find the maximum prime numbers of the numbers formed Note: Order of string can’t be changed

Problem Statement: 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 20 Students were shortlisted out of 175 Students after this round.

Round 2: Video Call (Technical Interview 1)

Topics asked: OOPS, Puzzles, Data Structures, SQL, DBMS

Problem list :

1. Concept such as inheritance, polymorphism, abstraction, encapsulation.
2. Puzzle
3. Stack parentheses problem
4. What are the different types of joining in SQL and write a query to JOIN two tables?
5. What are the ACID properties of DBMS?
6. What is a cross join?
7. What is 3 tier architecture?

Round 3: Video Call (Technical Interview 2)

Topics asked: Coding and Data Structures

Problem list :

2. Coding question 1: Second occurrence of ‘A’ in string.
3. Coding question 2: Write binary search program of the array
4. What are different types of sorting algorithms?
5. Difference between Merge Sort and Quick Sort
7. Some questions on pointers (referencing and addressing).

Round 4: HR/Managerial Round/Director Round/Pro-fit Round

Problem list :

1. Introduce yourself.
2. Which was my favorite project I did and what difficulties I faced in making it? After which I was asked to design a schema of a similar project.
3. Finally, some basic HR questions.

Verdict: Selected

Message to Aspiring Students:-

1. Have a stronghold on Data Structures & Algorithms by practicing on different platforms.
2. Take part in contests on Codeforces and Codechef. This will help you to improve your problem solving skills and also help in coming up with solutions quickly.
3. Stay positive and confident