# Finance Interview Questions

Finance interview questions shared by candidates

## Top Interview Questions

write a function that returns the first unique element in an array What the type of elements in the array? If character, set up the hash table, and scan the array. the hash table stores the index of each element. If the element appears more than once, update the table as a negetive value. After scanning, find the smallest index value from the hash table, which would be the first uniqure element. The time complex gonna be O(n), where n is the length of array. I wrote a sample program here. (I use map container here to replace hash_map. The doesnot work on my computer) #include "stdafx.h" #include #include using namespace std; static int find_unique_ele(char*,int); int _tmain(int argc, _TCHAR* argv[]) { char test[6] = {'a','b','c','b','c','a'}; int min_index = find_unique_ele(test,6); if (min_index store_table_value; map store_table; while(i ::const_iterator test_it = store_table.find(*test); if(test_it != store_table.end()){ store_table[*test] = -1; } else{ store_table.insert(map::value_type(store_table_value(*test,i))); } i++; test++; } map::const_iterator table_it = store_table.begin(); store_table_value temp_value = *table_it; int min_index = temp_value.second; while(++table_it != store_table.end()){ temp_value = *table_it; if(temp_value.second < min_index || min_index < 0){ min_index = temp_value.second; } } return min_index; } I think in the above solution you have to scan the original array twice making it order (2n) or O(n). The 2nd scan is needed to determine the corresponding entry in the hash table whether it is unique or not. We need this to determine the first unique element in the array. Show more responses |

int i=14; if (i=15) i++; How much is i? |

2 pieces of string of different length and non-uniform width, each take one hour to burn. the remaining length of a burning string doesn't tell you how much longer it burns for. with a lighter measure 45 mins. |

A rabbit wants to climb some stairs and it can do steps of 1 or 2. How many possible paths are there to follow ( e.g 1-1-1... or 2-2-2 ... or 2-1-2-1... etc) |

Would Java Bytecode generated by Java 7 work on a JVM made to function on Java 1.0? |

Most efficient way to find the most frequent number (0-255) in a string of numbers |

Classic one from them: You have an array and you want to find the first non-repeating element. |

template<class T1; class T2; class T3> int Product (T1 a, T2 b, T3 c) { return a * b * c; } What is the error in the sample code above? |

You have a large data file, consisting of ten-digit numbers separated by new-line characters. Write a program in C to sort it, using at most 20MB of memory. Make it efficient. |

how can I count the bit set to 1 in an integer? What if I want to optimize the process to work with several integers? |

**1**–

**10**of

**2,276**Interview Questions

## See Interview Questions for Similar Jobs

- Software Engineer
- Software Developer
- Senior Software Developer
- Senior Software Engineer
- Technology Analyst
- Analyst
- Graduate Software Engineer
- Intern
- Software Development Engineer
- Graduate Software Developer
- Financial Sales and Analytics
- Data Analyst
- Project Manager
- Summer Analyst
- Vice President
- Software Development Engineer II
- Software Engineer III
- Software Development Engineer I