Strategic Anaylst

filter-iconFilter interviews by

Strategic Anaylst Interview Questions and Answers

Updated 7 Aug 2015

Q1. What is the probability of a 8 bit string to have no more than 2 consecutive 1's. This might seem like a probability question :p. But it is actually dynamic programming.

Ans.

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

Q2. Given a list of numbers give an algorithm that to find 2 numbers that add up to 600. He asked me to improve the complexity with every attempt I made finally got it down to complexity of O(N)

Ans.

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.

Q3. Which one is greater, (Pie power e ) or (e power pie) ?

Ans.

e^π is greater than π^e.

  • e^π ≈ 23.14

  • π^e ≈ 22.46

  • e^π > π^e

Q4. Given a fair coin , find the expected number of trails for 4 consecutive heads

Ans.

Expected number of trials for 4 consecutive heads with a fair coin.

  • The probability of getting 4 consecutive heads is 1/2^4 = 1/16

  • The expected number of trials for 4 consecutive heads is 1/p = 16

  • This is because the expected value of a geometric distribution with probability p is 1/p

  • Therefore, the expected number of flips for 4 consecutive heads is 16

Are these interview questions helpful?

Q5. Given a graph, find whether there is a 3 cycle in the graph in an efficient manner

Ans.

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

Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Interview experiences of popular companies

3.5
 • 376 Interviews
3.0
 • 34 Interviews
View all

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary

Recently Viewed
SALARIES
Indus Towers
INTERVIEWS
Bharti Infratel
No Interviews
INTERVIEWS
Viom Networks
No Interviews
INTERVIEWS
Shriram Group
No Interviews
LIST OF COMPANIES
Indus Towers
Overview
DESIGNATION
DESIGNATION
DESIGNATION
SALARIES
Goldman Sachs
COMPANY BENEFITS
Sub-K IMPACT Solutions
No Benefits
Strategic Anaylst Interview Questions
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter