Write the algorithm for this: If you have a string aaabbc the output should be a3b2c1, for the string aabcc the output should be a2b1c2 and so on. You should not allocate memory for a new string and you can do this only by reading each character once. Ps: if the result is bigger than the original string (like abc -> a1b1c1) just return null or some message that makes that clear.
implement a function thet gets a string ans prints all string permutetions
how to merge two linked lists without using temp node
using a mac function toLower(char c) to write a toUpper(char c) function, without using any ascii code
given a linked list which has two types of pointers, a normal next pointer which points to next element in the list and random pointer which points to random element in the list. Question was to clone this linked list
Questions included in my description
Medium- easy level coding question. Technical Testing/automation experience related questions
Write a method to reverse the order of words in a string. e.g.: "This is a string" -> "string a is This"
Normal coding pattern question with few validation
What would your 30-60-90 day plan be?
Viewing 431 - 440 interview questions