Write perfect code to generate all possible permutations of a string w/o repetitions and only using constant memory.
Swe Intern Interview Questions
4,825 swe intern interview questions shared by candidates
public interface TwoSum { /** * Stores @param input in an internal data structure. */ public void store(int input); /** * Returns true if there is any pair of numbers in the internal data structure which * have sum @param test, and false otherwise. * For example, if the numbers 1, -2, 3, and 6 had been stored, * the method should return true for 4, -1, and 9, but false for 10, 5, and 0 */ public boolean test(int test); }
Given two strings of roman numerals, multiply their values. A roman numeral is valid if it conforms to all of a series of rules. (I don't remember them but that's not necessarily the purpose of the question).
Write a method to determine if 2 strings are anagrams.
typically questions consist of book defination of class and object, polymorphism , over riding etc
What's the most fun project you have made?
write a function to find 2nd highest value in an array. Basic questions on STL library , some baisc regrex questions , difference between left join right join ( only basic stuff). I guess w3school tutorial is fine incase if you want to refresh . simple sql query using joins.
Given a sorted array, what is the best way to search whether a value exists in array
Was asked simple questions like reversing an array in place and given two sorted arrays, merge them in the first array so that they are sorted.
They will ask simple quetsions like "if you have 5000 html pages how would you find particular value
Viewing 1 - 10 interview questions