Cisco Interview Questions

Showing 89 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Cisco. The higher the ranking, the more likely you'll encounter it in a Cisco interview.

Question

Frequency

Difficulty

Collect Coins in a Tree

Imagine a tree where some nodes have coins. You want to collect all the coins, but you can only traverse the tree. Find the minimum number of edges you need to travel to collect all the coins.

If you have a Cisco interview, it's very likely that you will get this question

#1. Collect Coins in a Tree

Imagine a tree where some nodes have coins. You want to collect all the coins, but you can only traverse the tree. Find the minimum number of edges you need to travel to collect all the coins.

This question is very likely to be asked in your Cisco interview

Minimum Time to Collect All Apples in a Tree

Imagine a tree where some nodes have apples. Find the minimum time needed to collect all the apples and return to the root, considering the time to travel each edge.

TreesGraphsRecursion

If you have a Cisco interview, it's very likely that you will get this question

#2. Minimum Time to Collect All Apples in a Tree

Imagine a tree where some nodes have apples. Find the minimum time needed to collect all the apples and return to the root, considering the time to travel each edge.

TreesGraphsRecursion

This question is very likely to be asked in your Cisco interview

Rotate Image

You are given a square matrix representing an image. Rotate the image by 90 degrees clockwise in-place.

If you have a Cisco interview, it's very likely that you will get this question

#3. Rotate Image

You are given a square matrix representing an image. Rotate the image by 90 degrees clockwise in-place.

This question is very likely to be asked in your Cisco interview

Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsDynamic Programming

If you have a Cisco interview, it's very likely that you will get this question

#4. Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsDynamic Programming

This question is very likely to be asked in your Cisco interview

House Robber

You are a robber planning to rob houses along a street. Maximize your loot, but be careful - adjacent houses have connected security systems that will trigger an alarm if you rob them both.

ArraysDynamic Programming

If you have a Cisco interview, it's very likely that you will get this question

#5. House Robber

You are a robber planning to rob houses along a street. Maximize your loot, but be careful - adjacent houses have connected security systems that will trigger an alarm if you rob them both.

ArraysDynamic Programming

This question is very likely to be asked in your Cisco interview

Lucky Numbers in a Matrix

Find the "lucky numbers" in a matrix. A lucky number is the smallest element in its row and the largest in its column.

If you have a Cisco interview, it's very likely that you will get this question

#6. Lucky Numbers in a Matrix

Find the "lucky numbers" in a matrix. A lucky number is the smallest element in its row and the largest in its column.

This question is very likely to be asked in your Cisco interview

Spiral Matrix

Traverse a given matrix in a spiral pattern, returning all elements in the order you visit them. Essentially, walk around the matrix layer by layer, adding elements to a list.

If you have a Cisco interview, it's very likely that you will get this question

#7. Spiral Matrix

Traverse a given matrix in a spiral pattern, returning all elements in the order you visit them. Essentially, walk around the matrix layer by layer, adding elements to a list.

This question is very likely to be asked in your Cisco interview

Fizz Buzz

Write a program that prints numbers from 1 to n, replacing multiples of 3 with "Fizz", multiples of 5 with "Buzz", and multiples of both with "FizzBuzz".

If you have a Cisco interview, it's very likely that you will get this question

#8. Fizz Buzz

Write a program that prints numbers from 1 to n, replacing multiples of 3 with "Fizz", multiples of 5 with "Buzz", and multiples of both with "FizzBuzz".

This question is very likely to be asked in your Cisco interview

LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

If you have a Cisco interview, it's very likely that you will get this question

#9. LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

This question is very likely to be asked in your Cisco interview

Find Third Transaction

You are given a list of stock prices over time. Determine the maximum profit you can make with at most three transactions.

Somewhat likely

If you have a Cisco interview, you might get this question

#10. Find Third Transaction

You are given a list of stock prices over time. Determine the maximum profit you can make with at most three transactions.

This question is somewhat likely to be asked in your Cisco interview

Number of Valid Words in a Sentence

Determine how many words in a given sentence are valid according to a specific set of rules. You'll need to check each word individually against the validity criteria.

Somewhat likely

If you have a Cisco interview, you might get this question

#11. Number of Valid Words in a Sentence

Determine how many words in a given sentence are valid according to a specific set of rules. You'll need to check each word individually against the validity criteria.

This question is somewhat likely to be asked in your Cisco interview

Sum of k-Mirror Numbers

Find the sum of the first n numbers that are palindromic in both base 10 and base k (where k is a given integer). You need to generate and check numbers until you find n k-mirror numbers.

StringsTwo Pointers

Somewhat likely

If you have a Cisco interview, you might get this question

#12. Sum of k-Mirror Numbers

Find the sum of the first n numbers that are palindromic in both base 10 and base k (where k is a given integer). You need to generate and check numbers until you find n k-mirror numbers.

StringsTwo Pointers

This question is somewhat likely to be asked in your Cisco interview

Maximum Difference Between Increasing Elements

Find the maximum difference between two numbers in an array, where the larger number appears after the smaller number. If no such pair exists, return -1.

Somewhat likely

If you have a Cisco interview, you might get this question

#13. Maximum Difference Between Increasing Elements

Find the maximum difference between two numbers in an array, where the larger number appears after the smaller number. If no such pair exists, return -1.

This question is somewhat likely to be asked in your Cisco interview

Find the Largest Area of Square Inside Two Rectangles

You are given the coordinates of two rectangles. Determine the largest possible square that can fit entirely within both rectangles.

Somewhat likely

If you have a Cisco interview, you might get this question

#14. Find the Largest Area of Square Inside Two Rectangles

You are given the coordinates of two rectangles. Determine the largest possible square that can fit entirely within both rectangles.

This question is somewhat likely to be asked in your Cisco interview

Snakes and Ladders

Simulate a game of Snakes and Ladders on a board represented by an array. Find the minimum number of dice rolls to reach the final square, considering snake and ladder shortcuts.

Somewhat likely

If you have a Cisco interview, you might get this question

#15. Snakes and Ladders

Simulate a game of Snakes and Ladders on a board represented by an array. Find the minimum number of dice rolls to reach the final square, considering snake and ladder shortcuts.

This question is somewhat likely to be asked in your Cisco interview

Check if Binary String Has at Most One Segment of Ones

Determine if a binary string contains at most one contiguous block of '1's. The '1's must form a single, uninterrupted sequence.

Somewhat likely

If you have a Cisco interview, you might get this question

#16. Check if Binary String Has at Most One Segment of Ones

Determine if a binary string contains at most one contiguous block of '1's. The '1's must form a single, uninterrupted sequence.

This question is somewhat likely to be asked in your Cisco interview

Maximum Subarray

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

ArraysDynamic Programming

Somewhat likely

If you have a Cisco interview, you might get this question

#17. Maximum Subarray

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

ArraysDynamic Programming

This question is somewhat likely to be asked in your Cisco interview

Number of Equal Count Substrings

Find the number of substrings in a string where each character appears the same number of times. The common count must be a specific given value.

StringsSliding Windows

Somewhat likely

If you have a Cisco interview, you might get this question

#18. Number of Equal Count Substrings

Find the number of substrings in a string where each character appears the same number of times. The common count must be a specific given value.

StringsSliding Windows

This question is somewhat likely to be asked in your Cisco interview

Word Search II

You are given a board of characters and a list of words. Find all the words from the list that can be formed by traversing adjacent cells on the board.

ArraysStringsRecursionGraphs

Somewhat likely

If you have a Cisco interview, you might get this question

#19. Word Search II

You are given a board of characters and a list of words. Find all the words from the list that can be formed by traversing adjacent cells on the board.

ArraysStringsRecursionGraphs

This question is somewhat likely to be asked in your Cisco interview

Minimum Cost to Make Array Equal

You are given an array and need to make all elements equal. Find the minimum cost to achieve this, where the cost depends on how much each element is changed.

ArraysGreedy Algorithms

Somewhat likely

If you have a Cisco interview, you might get this question

#20. Minimum Cost to Make Array Equal

You are given an array and need to make all elements equal. Find the minimum cost to achieve this, where the cost depends on how much each element is changed.

ArraysGreedy Algorithms

This question is somewhat likely to be asked in your Cisco interview

Copyright © Taro