Why Accenture?
Software Developer Interview Questions
550,670 software developer interview questions shared by candidates
Find the median of unsorted array in O(nlog n ) time. You need to know that particular mathematical algorithm, anything slower your answer is rejected.
(Phone screen questions) 1. For a given binary tree, print paths from root to all leaf nodes, one path per line. 2. Given a sequence of positive integers "seq" and an integer "total", return whether a contiguous sequence of "seq" sums up to "total". (Onsite interview questions are covered by NDA therefore can't post, but it can be said that the knowledge of data structures and handling edge cases are important for the coding interviews)
Given a collection of words, return a collection of anagrams found in the given collection
You are given a set of numbers 0 - n. Given a k, print all subsets of size k. Give the time complexity of the algorithm.
calculate x^1/2
Got asked two questions: 1 - Return the length of the longest sequence of increasing numbers in an unsorted array 2 - Print out a Binary Tree level by level
Implement a method called printNonComments() which prints out a extract of text with comments removed. For example, the input: hello /* this is a multi line comment */ all Should produce: hello all You have access to a method called getNextLine() which returns the next line in the input string.
I said suffix tree is the best way to go, so he asked me how will a node of that tree will look like?
Given a binary tree, print the average of each level.
Viewing 841 - 850 interview questions