Skip to contentSkip to footer

Software Engineer 1 Interview Questions

Salaries
Interviews

3,915 software engineer 1 interview questions shared by candidates

Given a string str, find the length of the longest substring without repeating characters. For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, with length 6. For “BBBB” the longest substring is “B”, with length 1. In this exercise, you're going to decompress a compressed string. Your input is a compressed string of the format number[string] and the decompressed output form should be the string written number times. For example: The input 3[abc]4[ab]c Would be output as abcabcabcababababc Other rules Number can have more than one digit. For example, 10[a] is allowed, and just means aaaaaaaaaa One repetition can occur inside another. For example, 2[3[a]b] decompresses into aaabaaab
avatar

SDE 1

Interviewed at TestMu AI

3.7★
Jun 25, 2021

Given a string str, find the length of the longest substring without repeating characters. For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, with length 6. For “BBBB” the longest substring is “B”, with length 1. In this exercise, you're going to decompress a compressed string. Your input is a compressed string of the format number[string] and the decompressed output form should be the string written number times. For example: The input 3[abc]4[ab]c Would be output as abcabcabcababababc Other rules Number can have more than one digit. For example, 10[a] is allowed, and just means aaaaaaaaaa One repetition can occur inside another. For example, 2[3[a]b] decompresses into aaabaaab

Viewing 3911 - 3920 interview questions

Glassdoor has 3,915 interview questions and reports from Software engineer 1 interviews. Prepare for your interview. Get hired. Love your job.