Tekizma Interview Question: Longest substring without repeating characters | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Tekizma

Tekizma Java Backend Developer/Engineer interview

Tekizma Interview Question

Java Backend Developer/Engineer Interview

Longest substring without repeating characters

Interview Answer

Anonymous

Oct 24, 2024

Used hashset and sliding window technique

Related searches: Tekizma reviews | Tekizma jobs | Tekizma salaries | Tekizma benefits

Tekizma interviews