You're converting a string (s1) into another (s2) by changing the characters in s1. You can do add/delete/replace the characters of s1 to get s2. The cost of any of those operation for a character is 1. Find the minimum cost to convert s1 into s2. Write program and test cases for the same. For example: Convert "Hi" into "Hey". This would require minimum two cost. 1. Replace 'i' with 'e' in s1 2. Add 'y' to s1. Now we've s2.
Convert a number to a roman number
Remove repeated characters from a string
how to determine if 2 linked lists are merged at a common node in O(n) time
What do you do when there is no Answer?
Find the number of '0' bits in an integer.
The on-site interview consisted of five technical questions; code was required for four of the five: 1. Write a small parser for strings that determines whether a string is a sequence of space-separated words 2. Write an API for working with a specific type of document 3. Given an undirected cyclic graph, find all paths from A to B without cycles 4. The delivery of the fourth question was very confusing - basically they wanted me to implement a stack as a means of counting parentheses 5. Given a function prototype and a return value, hypothesize regarding 'what happened' The on-campus interview was a single technical question; the interviewer was extremely bored: A. I've forgotten this question; it was a relatively trivial string analysis problem
You have 2 linked lists, return a list with the intersection. For example: Input: L1 = { 1,2,5,10} L2 = {9,4,5,10,15} return {5,10}
Hardest challenge faced?
Too nervous to get a solution quickly and bug free.
Viewing 2171 - 2180 interview questions