Given an unweighted directed graph, how would you find the shortest path from s to t? Print out all vertices along the shortest path. Assume no two vertices have the same value.
Programmer Analyst Ii Interview Questions
716,160 programmer analyst ii interview questions shared by candidates
Questions from the resume and tons of questions related to programming.
Q: Why do you want to work in our company?
Diff b/w var1 == var2 and var1.equals(var2) Which method needs to be implemented along with equals()?
Can a batch be called from the execute method of another batch apex?
Same as others mentioned on glassdoor. 3 hour round is pawn only chess. 6 hour on-site has pair programming, leetcode and small one hour projects
a line of code has one logical bug in it, find the bug.
What are your 3 strengths and 3 weaknesses?
Given two words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself. * * Example: * given "foo", "app"; returns true * we can map 'f' -> 'a' and 'o' -> 'p' * * given "foo", "boa"; returns false * we can map 'f' -> 'b', 'o' -> 'o', we can't map 'o' -> 'a' * * given "bar", "foo"; returns false * we can't map both 'a' and 'r' to 'o' * * given "turtle", "tletur"; returns true * we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' ->'r' * * given "ab", "ca"; returns true * we can map 'a' -> 'c', 'b' -> 'a' */
Implement double pow(double a, int b) without using any already built-in functions (aka, don't use an already defined pow function).
Viewing 1191 - 1200 interview questions