Strategic Anaylst Interview Questions and Answers

Probability of an 8 bit string with no more than 2 consecutive 1's using dynamic programming.

• Use dynamic programming to calculate the probability of a string with no more than 2 consecutive 1's

• Create a 2D array to store the probabilities of each bit position and number of consecutive 1's

• Use recurrence relation to calculate the probability for each bit position based on the previous bit position

• Sum up the probabilities for all possible combinations of the last bit position and...read more

Algorithm to find 2 numbers that add up to 600 from a list of numbers with O(N) complexity.

• Use a hash table to store the difference between each number and 600.

• Iterate through the list and check if the difference is in the hash table.

• If the difference is in the hash table, return the current number and the difference.

e^π is greater than π^e.

• e^π ≈ 23.14

• π^e ≈ 22.46

• e^π > π^e

Efficiently determine if a given graph contains a 3 cycle.

• Use depth-first search (DFS) to traverse the graph

• For each node, check if there is a path of length 3 that ends at that node

• If such a path exists, return true

• If DFS completes without finding a 3 cycle, return false