Skip to contentSkip to footer

Systems Interview Questions

Salaries
Interviews

52,655 systems interview questions shared by candidates

Sometimes the questions asked in personal interviews may be unusual and comic. But a task given is a task to be achieved. For example my friend was asked to iterate alphabets in reverse order. Z - A Take it seriously and don't insult the HR person by laughing on question
avatar

Assistant Systems Engineer

Interviewed at Tata Consultancy Services

3.5★
Sep 23, 2012

Sometimes the questions asked in personal interviews may be unusual and comic. But a task given is a task to be achieved. For example my friend was asked to iterate alphabets in reverse order. Z - A Take it seriously and don't insult the HR person by laughing on question

1. You have two strings. A test string and a glob Test string can have a & b, any number of times, any location. Glob can have a, b, ? and *, any number of times, any location. E.g. test= {a,b,a,a,a,a,b,b,b,b,b,b} glob = {a,?, *, b} Now, ? means ANY character, single occurrence. So it's either a or b, one time * means ANY OR NO character, any number of occurrences. E.g. the above glob and test actually match. Problem is: write an algorithm to match glob with test. You MAY NOT use regular expressions :D 2. The input is any string of any length of any characters. Write a program to generate ALL unique permutations of those characters. Unique. You may not store in an array or list, due to memory constraints. e.g. for input of abc your program should give 6 permutations but for aba your program should give 3. Hint: make the list alphabetical.
avatar

Systems Developer

Interviewed at Two Sigma

3.9★
Aug 9, 2012

1. You have two strings. A test string and a glob Test string can have a & b, any number of times, any location. Glob can have a, b, ? and *, any number of times, any location. E.g. test= {a,b,a,a,a,a,b,b,b,b,b,b} glob = {a,?, *, b} Now, ? means ANY character, single occurrence. So it's either a or b, one time * means ANY OR NO character, any number of occurrences. E.g. the above glob and test actually match. Problem is: write an algorithm to match glob with test. You MAY NOT use regular expressions :D 2. The input is any string of any length of any characters. Write a program to generate ALL unique permutations of those characters. Unique. You may not store in an array or list, due to memory constraints. e.g. for input of abc your program should give 6 permutations but for aba your program should give 3. Hint: make the list alphabetical.

Viewing 131 - 140 interview questions

Glassdoor has 52,655 interview questions and reports from Systems interviews. Prepare for your interview. Get hired. Love your job.