<iframe src="https://www.googletagmanager.com/ns.html?id=GTM-KVGHS6G" height="0" width="0" style="display:none;visibility:hidden"></iframe>

Cisco数据相关面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(10)
SQL(0)
Coding(6)
ML basics(0)
Stats(0)
Product Case(1)
高频题(0)
Other(3)
全部(10)
SQL(0)
Coding(6)
ML basics(0)
Stats(0)
Product Case(1)
高频题(0)
Other(3)
1.a $2B budget for improvements
2.Last Cell in a Matrix Hop Game
3.Maximum Number of Chocolates to Pick from Jars
4.Maximum Difference in a List of Integers
5.Prime or Composite Elements
6.Odd Number of Birthday Celebrations
7.Distinct Pairs Sum to Target
8.Count of Numbers with Digit Sum Equal to Given Value
9.Longest Palindromic Substring
10.Word Search in a Grid
1. a $2B budget for improvements
You are a manager for Whatsapp with a $2B budget for improvements. What do you do? 
2. Last Cell in a Matrix Hop Game
Given an N*M matrix, write an algorithm to find the last cell Lucy would hop onto if she starts from cell (1,1), moves in an anti-clockwise direction, and skips alternate cells. The input will include the dimensions of the matrix followed by the elements in each cell. The output should be the integer representing the last cell Lucy would hop onto.
3. Maximum Number of Chocolates to Pick from Jars
There is a set of jars containing chocolates, some of which may be empty. Write an algorithm to determine the maximum number of chocolates Andrew can pick from the jars, given that he cannot pick from jars next to each other. The input will include the number of jars followed by the number of chocolates in each jar. The output should be the maximum number of chocolates that can be picked without picking from adjacent jars.
4. Maximum Difference in a List of Integers
Given a list of integers, write an algorithm to find the maximum difference between two elements where the larger number appears after the smaller number. The input will be the size of the list followed by the list of integers. The output should be the maximum difference.
5. Prime or Composite Elements
Given a list of integers, write an algorithm to find out if the elements are prime or composite. You are provided with the number of elements in the list and the elements themselves. The output should indicate 'Prime' if an element is a prime number and 'Composite' if it is not.