i
Wissen
Technology
Filter interviews by
Use sorting or heap data structure to find k largest elements in an array of strings.
Sort the array in descending order and return the first k elements.
Use a max heap data structure to efficiently find the k largest elements.
Examples: ['apple', 'banana', 'orange', 'kiwi'], k=2 -> ['orange', 'kiwi']
Remove duplicates from array of strings
Create a Set to store unique strings
Iterate through the array and add each string to the Set
Convert the Set back to an array to get the unique strings
Find the maximum sum of a subarray of size k in an array of integers.
Use a sliding window approach to keep track of the sum of the current subarray.
Slide the window by adding the next element and subtracting the previous element.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Optimizing prime number algorithms is crucial for efficient computation in software development.
Optimizing prime number algorithms can improve the performance of applications that rely on prime numbers, such as cryptography or number theory.
Efficient algorithms like the Sieve of Eratosthenes can significantly reduce the time complexity of finding prime numbers.
Using techniques like memoization or dynamic programmi...
A program to find the next palindrome number after a given number.
Convert the given number to a string to easily manipulate individual digits.
Increment the number by 1 and check if it is a palindrome.
If not a palindrome, repeat the process until a palindrome is found.
Anagrams in a given word
Create a function to find all possible anagrams of a given word
Use a hash table to store the frequency of each character in the word
Generate all possible permutations of the characters and check if they exist in the hash table
The question is about finding anagrams in a given string.
An anagram is a word or phrase formed by rearranging the letters of another word or phrase.
To find anagrams in a string, we can use a hashmap to store the frequency of characters in each word.
We can iterate through the string and for each substring of length equal to the length of the target word, check if it is an anagram.
If the frequency of characters in t...
A javascript function to find the maximum and minimum occurrence of a letter in a string.
Create an object to store the count of each letter in the string
Loop through the string and update the count in the object
Find the maximum and minimum count in the object and return the corresponding letters
This function converts a mixed-case string into a properly formatted lowercase string with the first letter capitalized.
Use the `toLowerCase()` method to convert the entire string to lowercase.
Split the string into words using the `split(' ')` method.
Capitalize the first letter of each word using `charAt(0).toUpperCase()`.
Join the words back together with a space using `join(' ')`.
Example: sanitizeString('HoW arE ...
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings.
Stop when a character doesn't match or reach the end of any string.
Return the prefix found so far.
I appeared for an interview in Nov 2024.
Coding test was easy. They asked LC easy anyone with fair understanding of programming can easily solve it.
Hackearth online coding test for 1 hour
Use sorting or heap data structure to find k largest elements in an array of strings.
Sort the array in descending order and return the first k elements.
Use a max heap data structure to efficiently find the k largest elements.
Examples: ['apple', 'banana', 'orange', 'kiwi'], k=2 -> ['orange', 'kiwi']
Remove duplicates from array of strings
Create a Set to store unique strings
Iterate through the array and add each string to the Set
Convert the Set back to an array to get the unique strings
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Paper pen coding test
Find the maximum sum of a subarray of size k in an array of integers.
Use a sliding window approach to keep track of the sum of the current subarray.
Slide the window by adding the next element and subtracting the previous element.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings.
Stop when a character doesn't match or reach the end of any string.
Return the prefix found so far.
1st Round was Written Coding test Q> Next Palindrome, Q> ATM machine design Q> SQl query Q> Elephant and banana Prime number Story base question
A program to find the next palindrome number after a given number.
Convert the given number to a string to easily manipulate individual digits.
Increment the number by 1 and check if it is a palindrome.
If not a palindrome, repeat the process until a palindrome is found.
Optimizing prime number algorithms is crucial for efficient computation in software development.
Optimizing prime number algorithms can improve the performance of applications that rely on prime numbers, such as cryptography or number theory.
Efficient algorithms like the Sieve of Eratosthenes can significantly reduce the time complexity of finding prime numbers.
Using techniques like memoization or dynamic programming ca...
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
3 coding questions, very basic
I applied via Campus Placement and was interviewed in Oct 2023. There were 3 interview rounds.
There were 3 dsa questions
1. Find repeated element in the array
Anagrams in a given word
Create a function to find all possible anagrams of a given word
Use a hash table to store the frequency of each character in the word
Generate all possible permutations of the characters and check if they exist in the hash table
I applied via Campus Placement and was interviewed in Jun 2023. There were 6 interview rounds.
Two coding questions. Easy
Offline pen paper coding test
Group discussion on the topic Future of electric vehicles
The question is about finding anagrams in a given string.
An anagram is a word or phrase formed by rearranging the letters of another word or phrase.
To find anagrams in a string, we can use a hashmap to store the frequency of characters in each word.
We can iterate through the string and for each substring of length equal to the length of the target word, check if it is an anagram.
If the frequency of characters in the su...
It was a written test. There were 6 coding questions. All were medium to difficult questions. One of those was a Database schema-related question.
I appeared for an interview in Nov 2022.
Top trending discussions
Some of the top questions asked at the Wissen Technology interview for freshers -
The duration of Wissen Technology interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 11 interview experiences
Difficulty level
Duration
based on 478 reviews
Rating in categories
Software Engineer
841
salaries
| ₹9.3 L/yr - ₹20 L/yr |
Senior Software Engineer
736
salaries
| ₹16.1 L/yr - ₹31 L/yr |
Principal Engineer
335
salaries
| ₹25 L/yr - ₹45 L/yr |
Software Developer
161
salaries
| ₹11.2 L/yr - ₹21 L/yr |
Associate Software Engineer
155
salaries
| ₹9 L/yr - ₹15 L/yr |
Wissen Infotech
ITC Infotech
CMS IT Services
KocharTech