The assignment was to write a function that gets two characters arrays - the first is the string and the second is the substring - and removes all appearances of the given substring. Two restrictions: 1. Memory complexity is O(1) (Cannot change to String, cannot allocate memory for another array). 2. Cannot write a character in the same position more than once (naive solution doesn't fit against this limit).
Given two unsorted arrays, return if you can form a pair that equals the target sum
Write the C atoi function
Most questions on the basics of C++ and STL, including namespaces, vectors, etc.
The interviewer has a heavy accent and no technical background.
basic algorithms and data structures
Just asked questions based on my resume and some data base and string manipulation question.
pallindrome question for the technical round
In JavaScript, what does "this" keyword indicate?
Solve three questions that are coding based.
Viewing 1231 - 1240 interview questions