Softwareentwickler C Interview Questions

512,305 softwareentwickler c interview questions shared by candidates

Given an array of character you must delete all the characters that got repeated 3 or more times consecutively and add '0' in the end of the array for every deleted character Example: "aabbbbcdddee" -> "aacee0000000" "22221" ->"00001 " The problem must be solved in: O(1) memory O(n) time And you can't overwrite a cell in the array more than once.
avatar

Software Engineer(Internship)

Interviewed at Bloomberg

4
Aug 22, 2019

Given an array of character you must delete all the characters that got repeated 3 or more times consecutively and add '0' in the end of the array for every deleted character Example: "aabbbbcdddee" -> "aacee0000000" "22221" ->"00001 " The problem must be solved in: O(1) memory O(n) time And you can't overwrite a cell in the array more than once.

You’re given a board game which is a row of squares, each labeled with an integer. This can be represented by a list, e.g. [1, 3, 2, 0, 5, 2, 8, 4, 1] Given a start position on the board, you “win” by landing on a zero, where you move by jumping from square to square either left or right the number of spaces specified on the square you’re currently on. Your task is to implement the function: def can_win(board, pos): returns True if you can win the board from that starting pos, False otherwise
avatar

Software Engineer

Interviewed at Pinterest

3.6
Aug 20, 2015

You’re given a board game which is a row of squares, each labeled with an integer. This can be represented by a list, e.g. [1, 3, 2, 0, 5, 2, 8, 4, 1] Given a start position on the board, you “win” by landing on a zero, where you move by jumping from square to square either left or right the number of spaces specified on the square you’re currently on. Your task is to implement the function: def can_win(board, pos): returns True if you can win the board from that starting pos, False otherwise

given a number as a string write a algorithm to map to its oral description. I.e. "1" -> "11" //this can be thought of as there is one one. "11" -> "21" // there are two ones "21" -> "1211" // there is one two and one one "1211" -> "111221" ect. //there is one one, one two and two ones
avatar

Software Engineer

Interviewed at Dropbox

3.9
Nov 5, 2011

given a number as a string write a algorithm to map to its oral description. I.e. "1" -> "11" //this can be thought of as there is one one. "11" -> "21" // there are two ones "21" -> "1211" // there is one two and one one "1211" -> "111221" ect. //there is one one, one two and two ones

Viewing 541 - 550 interview questions

Glassdoor has 512,305 interview questions and reports from Softwareentwickler c interviews. Prepare for your interview. Get hired. Love your job.