How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Cisco interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
84 problems · 24 Easy, 47 Medium, 13 Hard · Ranked #26 of 458
24 Easy
29% · avg 23%
47 Medium
56% · avg 59%
13 Hard
15% · avg 18%
Based on 84 reported problems, Cisco interviews are in line with industry averages - 15% Hard vs 18% overall. The majority (56%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Cisco puts unusual emphasis on game-theory (2.4% of problems, 8.2x the industry average), geometry (2.4% of problems, 4.4x the industry average), ordered-set (2.4% of problems, 2.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (58.3%), string (29.8%), dynamic-programming (23.8%), two-pointers (17.9%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Very Likely | two-pointersstringdynamic-programming | Solve |
House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob... | Medium | Very Likely | arraydynamic-programming | Solve |
Predict the Winner You are given an integer array nums. Two players are playing a game with this array: player 1 and player 2. | Medium | Very Likely | arraymathdynamic-programming | Solve |
Lucky Numbers in a Matrix Given an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order. | Easy | Very Likely | arraymatrix | Solve |
Rotate Image You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). | Medium | Very Likely | arraymathmatrix | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Very Likely | arraymatrixsimulation | Solve |
Fizz Buzz Given an integer n, return a string array answer (1-indexed) where: | Easy | Likely | mathstringsimulation | Solve |
Snakes and Ladders You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style starting from the bottom left of the board (i.e. b... | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Number of Valid Words in a Sentence A sentence consists of lowercase letters ('a' to 'z'), digits ('0' to '9'), hyphens ('-'), punctuation marks ('!', '.', and ','), and spaces (' ') only. Each se... | Easy | Likely | string | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Likely | arraysorting | Solve |
Maximum Difference Between Increasing Elements Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 <= i < j < n and... | Easy | Likely | array | Solve |
Find the Largest Area of Square Inside Two Rectangles There exist n rectangles in a 2D plane with edges parallel to the x and y axis. You are given two 2D integer arrays bottomLeft and topRight where bottomLeft[i]... | Medium | Likely | arraymathgeometry | Solve |
Minimum Cost to Make Array Equal You are given two 0-indexed arrays nums and cost consisting each of n positive integers. | Hard | Likely | arraybinary-searchgreedy | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Likely | arraydivide-and-conquerdynamic-programming | Solve |
Check if Binary String Has at Most One Segment of Ones Given a binary string s without leading zeros, return true if s contains at most one contiguous segment of ones. Otherwise, return false. | Easy | Likely | string | Solve |
Word Search II Given an m x n board of characters and a list of strings words, return all words on the board. | Hard | Likely | arraystringbacktracking | Solve |
Sum of k-Mirror Numbers A k-mirror number is a positive integer without leading zeros that reads the same both forward and backward in base-10 as well as in base-k. | Hard | Likely | mathenumeration | Solve |
Implement Router Design a data structure that can efficiently manage data packets in a network router. Each data packet consists of the following attributes: | Medium | Likely | arrayhash-tablebinary-search | Solve |
Happy Number Write an algorithm to determine if a number n is happy. | Easy | Likely | hash-tablemathtwo-pointers | Solve |
Max Points on a Line Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line. | Hard | Likely | arrayhash-tablemath | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Stone Game Alice and Bob play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles... | Medium | Likely | arraymathdynamic-programming | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Cherry Pickup You are given an n x n grid representing a field of cherries, each cell is one of three possible integers. | Hard | Likely | arraydynamic-programmingmatrix | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Merge Sorted Array You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num... | Easy | Sometimes | arraytwo-pointerssorting | Solve |
Decode String Given an encoded string, return its decoded string. | Medium | Sometimes | stringstackrecursion | Solve |
Remove Boxes You are given several boxes with different colors represented by different positive numbers. | Hard | Sometimes | arraydynamic-programmingmemoization | Solve |
Linked List Cycle Given head, the head of a linked list, determine if the linked list has a cycle in it. | Easy | Sometimes | hash-tablelinked-listtwo-pointers | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Sometimes | arraydynamic-programming | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Sometimes | arraytwo-pointerssorting | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Sometimes | arraydepth-first-searchbreadth-first-search | Solve |
Search a 2D Matrix You are given an m x n integer matrix matrix with the following two properties: | Medium | Sometimes | arraybinary-searchmatrix | Solve |
Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. | Medium | Sometimes | hash-tablestringbacktracking | Solve |
Strange Printer There is a strange printer with the following two special properties: | Hard | Sometimes | stringdynamic-programming | Solve |
Move Zeroes Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. | Easy | Sometimes | arraytwo-pointers | Solve |
Reverse Linked List Given the head of a singly linked list, reverse the list, and return the reversed list. | Easy | Sometimes | linked-listrecursion | Solve |
Longest Consecutive Sequence Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. | Medium | Sometimes | arrayhash-tableunion-find | Solve |
Validate IP Address Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type. | Medium | Sometimes | string | Solve |
Add Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing... | Medium | Sometimes | linked-listmathrecursion | Solve |
Remove Duplicates from Sorted Array Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o... | Easy | Sometimes | arraytwo-pointers | Solve |
Valid Palindrome A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa... | Easy | Sometimes | two-pointersstring | Solve |
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Sometimes | arrayhash-tablestring | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Sometimes | linked-listdivide-and-conquerheap-priority-queue | Solve |
Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. | Medium | Sometimes | arraystringbacktracking | Solve |
Insert Delete GetRandom O(1) Implement the RandomizedSet class: | Medium | Sometimes | arrayhash-tablemath | Solve |
Permutation in String Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. | Medium | Sometimes | hash-tabletwo-pointersstring | Solve |
Single Number Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. | Easy | Sometimes | arraybit-manipulation | Solve |
Top K Frequent Elements Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. | Medium | Sometimes | arrayhash-tabledivide-and-conquer | Solve |
Gas Station There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. | Medium | Sometimes | arraygreedy | Solve |
Find Servers That Handled Most Number of Requests You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but ca... | Hard | Sometimes | arrayheap-priority-queuesimulation | Solve |
Expressive Words Sometimes people repeat letters to represent extra feeling. For example: | Medium | Sometimes | arraytwo-pointersstring | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Sometimes | arrayqueuesliding-window | Solve |
Restore IP Addresses A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros. | Medium | Sometimes | stringbacktracking | Solve |
Beautiful Arrangement Suppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i... | Medium | Sometimes | arraydynamic-programmingbacktracking | Solve |
Remove K Digits Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num. | Medium | Sometimes | stringstackgreedy | Solve |
Unique Paths II You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r... | Medium | Sometimes | arraydynamic-programmingmatrix | Solve |
Zigzag Conversion The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better... | Medium | Sometimes | string | Solve |
Largest Rectangle in Histogram Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his... | Hard | Sometimes | arraystackmonotonic-stack | Solve |
Find Minimum in Rotated Sorted Array Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: | Medium | Sometimes | arraybinary-search | Solve |
Permutations Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. | Medium | Sometimes | arraybacktracking | Solve |
Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length... | Medium | Sometimes | arraydynamic-programminggreedy | Solve |
Palindromic Substrings Given a string s, return the number of palindromic substrings in it. | Medium | Sometimes | two-pointersstringdynamic-programming | Solve |
Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner... | Medium | Sometimes | mathdynamic-programmingcombinatorics | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Sometimes | stringdynamic-programming | Solve |
Pascal's Triangle Given an integer numRows, return the first numRows of Pascal's triangle. | Easy | Sometimes | arraydynamic-programming | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Sometimes | arrayprefix-sum | Solve |
Reverse Words in a String Given an input string s, reverse the order of the words. | Medium | Sometimes | two-pointersstring | Solve |
Missing Number Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. | Easy | Sometimes | arrayhash-tablemath | Solve |
Subarray Sum Equals K Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k. | Medium | Sometimes | arrayhash-tableprefix-sum | Solve |
Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. | Easy | Sometimes | mathdynamic-programmingmemoization | Solve |
Number of 1 Bits Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). | Easy | Sometimes | divide-and-conquerbit-manipulation | Solve |
Two Sum IV - Input is a BST Given the root of a binary search tree and an integer k, return true if there exist two elements in the BST such that their sum is equal to k, or false otherwis... | Easy | Sometimes | hash-tabletwo-pointerstree | Solve |
Rising Temperature Table: Weather | Easy | Sometimes | database | Solve |
Longest Palindromic Subsequence Given a string s, find the longest palindromic subsequence's length in s. | Medium | Sometimes | stringdynamic-programming | Solve |
Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. | Medium | Sometimes | stackdesign | Solve |
Count of Integers You are given two numeric strings num1 and num2 and two integers maxsum and minsum. We denote an integer x to be good if: | Hard | Sometimes | mathstringdynamic-programming | Solve |
Design Browser History You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the hist... | Medium | Sometimes | arraylinked-liststack | Solve |
Kth Smallest Element in a BST Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. | Medium | Sometimes | treedepth-first-searchbinary-search-tree | Solve |
Can Place Flowers You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. | Easy | Sometimes | arraygreedy | Solve |
Maximum Product of Two Elements in an Array Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)(nums[j]-1). | Easy | Sometimes | arraysortingheap-priority-queue | Solve |
Compare Version Numbers Given two version strings, version1 and version2, compare them. A version string consists of revisions separated by dots '.'. The value of the revision is its i... | Medium | Sometimes | two-pointersstring | Solve |
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
House Robber
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
Predict the Winner
SolveYou are given an integer array nums. Two players are playing a game with this array: player 1 and player 2.
Lucky Numbers in a Matrix
SolveGiven an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order.
Rotate Image
SolveYou are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Fizz Buzz
SolveGiven an integer n, return a string array answer (1-indexed) where:
Snakes and Ladders
SolveYou are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style starting from the bottom left of the board (i.e. b...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Number of Valid Words in a Sentence
SolveA sentence consists of lowercase letters ('a' to 'z'), digits ('0' to '9'), hyphens ('-'), punctuation marks ('!', '.', and ','), and spaces (' ') only. Each se...
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Maximum Difference Between Increasing Elements
SolveGiven a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 <= i < j < n and...
Find the Largest Area of Square Inside Two Rectangles
SolveThere exist n rectangles in a 2D plane with edges parallel to the x and y axis. You are given two 2D integer arrays bottomLeft and topRight where bottomLeft[i]...
Minimum Cost to Make Array Equal
SolveYou are given two 0-indexed arrays nums and cost consisting each of n positive integers.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Check if Binary String Has at Most One Segment of Ones
SolveGiven a binary string s without leading zeros, return true if s contains at most one contiguous segment of ones. Otherwise, return false.
Word Search II
SolveGiven an m x n board of characters and a list of strings words, return all words on the board.
Sum of k-Mirror Numbers
SolveA k-mirror number is a positive integer without leading zeros that reads the same both forward and backward in base-10 as well as in base-k.
Implement Router
SolveDesign a data structure that can efficiently manage data packets in a network router. Each data packet consists of the following attributes:
Happy Number
SolveWrite an algorithm to determine if a number n is happy.
Max Points on a Line
SolveGiven an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the maximum number of points that lie on the same straight line.
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Stone Game
SolveAlice and Bob play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles...
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Cherry Pickup
SolveYou are given an n x n grid representing a field of cherries, each cell is one of three possible integers.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Merge Sorted Array
SolveYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num...
Decode String
SolveGiven an encoded string, return its decoded string.
Remove Boxes
SolveYou are given several boxes with different colors represented by different positive numbers.
Linked List Cycle
SolveGiven head, the head of a linked list, determine if the linked list has a cycle in it.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Search a 2D Matrix
SolveYou are given an m x n integer matrix matrix with the following two properties:
Letter Combinations of a Phone Number
SolveGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Strange Printer
SolveThere is a strange printer with the following two special properties:
Move Zeroes
SolveGiven an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Reverse Linked List
SolveGiven the head of a singly linked list, reverse the list, and return the reversed list.
Longest Consecutive Sequence
SolveGiven an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
Validate IP Address
SolveGiven a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Add Two Numbers
SolveYou are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...
Remove Duplicates from Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o...
Valid Palindrome
SolveA phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Word Search
SolveGiven an m x n grid of characters board and a string word, return true if word exists in the grid.
Insert Delete GetRandom O(1)
SolveImplement the RandomizedSet class:
Permutation in String
SolveGiven two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
Single Number
SolveGiven a non-empty array of integers nums, every element appears twice except for one. Find that single one.
Top K Frequent Elements
SolveGiven an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
Gas Station
SolveThere are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
Find Servers That Handled Most Number of Requests
SolveYou have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but ca...
Expressive Words
SolveSometimes people repeat letters to represent extra feeling. For example:
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Restore IP Addresses
SolveA valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.
Beautiful Arrangement
SolveSuppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i...
Remove K Digits
SolveGiven string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num.
Unique Paths II
SolveYou are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...
Zigzag Conversion
SolveThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better...
Largest Rectangle in Histogram
SolveGiven an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his...
Find Minimum in Rotated Sorted Array
SolveSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
Permutations
SolveGiven an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Jump Game
SolveYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Palindromic Substrings
SolveGiven a string s, return the number of palindromic substrings in it.
Unique Paths
SolveThere is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner...
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Pascal's Triangle
SolveGiven an integer numRows, return the first numRows of Pascal's triangle.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Reverse Words in a String
SolveGiven an input string s, reverse the order of the words.
Missing Number
SolveGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
Subarray Sum Equals K
SolveGiven an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
Climbing Stairs
SolveYou are climbing a staircase. It takes n steps to reach the top.
Number of 1 Bits
SolveGiven a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight).
Two Sum IV - Input is a BST
SolveGiven the root of a binary search tree and an integer k, return true if there exist two elements in the BST such that their sum is equal to k, or false otherwis...
Longest Palindromic Subsequence
SolveGiven a string s, find the longest palindromic subsequence's length in s.
Min Stack
SolveDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Count of Integers
SolveYou are given two numeric strings num1 and num2 and two integers maxsum and minsum. We denote an integer x to be good if:
Design Browser History
SolveYou have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move forward in the hist...
Kth Smallest Element in a BST
SolveGiven the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree.
Can Place Flowers
SolveYou have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
Maximum Product of Two Elements in an Array
SolveGiven the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)(nums[j]-1).
Compare Version Numbers
SolveGiven two version strings, version1 and version2, compare them. A version string consists of revisions separated by dots '.'. The value of the revision is its i...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Cisco interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Cisco interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Cisco interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Cisco has been reported to ask 84 distinct coding problems. The most common topics are array, string, dynamic-programming. 24 are Easy difficulty, 47 are Medium, and 13 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 84 reported problems, Cisco interviews are in line with industry averages - 15% Hard vs 18% overall. 56% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Cisco coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Cisco interview with AIarrow_forward