You are given a string and a number(sub-string length). the string consists of *, -, and + characters, and the string's length will be the multiple of the given number. Write a function to hash the string using the below hashing algorithm:
- Split the given string into multiple sub-strings of a given length starting from left
- Calculate the weight of each sub-string. The number of times a unique sub-string value appears after splitting is defined as the weight of that sub-string
- Sort the unique sub-string values by weight in descending order. If 2 or more sub-strings have the same weight, then sort them by character order: * > - > +
- Create the hash by concatenating the sorted list of unique sub-strings and return the hash.
I applied through a recruiter. I interviewed at Tracxn (Bengaluru) in Mar 2026
Interview
First round will be DSA assessment
Followed there will be 3 technical round which is again DSA
search in matrix for particular word
return longest substring palindrome
check whethere substring exists in an given string
Interview questions [1]
Question 1
search in matrix for particular word
return longest substring palindrome
check whethere substring exists in an given string
Interview process was great, had a friendly environment.
Interviewer was friendly as well.
Went through 2 rounds .
Both the rounds were dsa based.
All the rounds were on the same day iteself
Interview questions [1]
Question 1
Asked few questions on my internships, since it was for a fresher role
and the rest were dsa questions
