Cisco Interview Questions — 87 DSA Problems
84 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Cisco LeetCode questions for software engineering interviews.
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Predict the Winner (MEDIUM) — Array, Math, Dynamic Programming, Recursion, Game Theory
- House Robber (MEDIUM) — Array, Dynamic Programming
- Lucky Numbers in a Matrix (EASY) — Array, Matrix
- Rotate Image (MEDIUM) — Array, Math, Matrix
- Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
- Fizz Buzz (EASY) — Math, String, Simulation
- LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
- Snakes and Ladders (MEDIUM) — Array, Breadth-First Search, Matrix
- Number of Valid Words in a Sentence (EASY) — String
- Find Third Transaction (MEDIUM) — Database
- Maximum Difference Between Increasing Elements (EASY) — Array
- Merge Intervals (MEDIUM) — Array, Sorting
- Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
- Implement Router (MEDIUM) — Array, Hash Table, Binary Search, Design, Queue, Ordered Set
- Find the Largest Area of Square Inside Two Rectangles (MEDIUM) — Array, Math, Geometry
- Minimum Cost to Make Array Equal (HARD) — Array, Binary Search, Greedy, Sorting, Prefix Sum
- Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
- Number of Equal Count Substrings (MEDIUM) — Hash Table, String, Sliding Window, Counting
- Sum of k-Mirror Numbers (HARD) — Math, Enumeration
- Check if Binary String Has at Most One Segment of Ones (EASY) — String
- Max Points on a Line (HARD) — Array, Hash Table, Math, Geometry
- Happy Number (EASY) — Hash Table, Math, Two Pointers
- Stone Game (MEDIUM) — Array, Math, Dynamic Programming, Game Theory
- Two Sum (EASY) — Array, Hash Table
- Cherry Pickup (HARD) — Array, Dynamic Programming, Matrix
- Valid Parentheses (EASY) — String, Stack
- Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Linked List Cycle (EASY) — Hash Table, Linked List, Two Pointers
- Decode String (MEDIUM) — String, Stack, Recursion
- Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
- Remove Boxes (HARD) — Array, Dynamic Programming, Memoization
- Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
- Strange Printer (HARD) — String, Dynamic Programming
- Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
- Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
- Move Zeroes (EASY) — Array, Two Pointers
- 3Sum (MEDIUM) — Array, Two Pointers, Sorting
- Reverse Linked List (EASY) — Linked List, Recursion
- Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
- Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
- Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
- Gas Station (MEDIUM) — Array, Greedy
- Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers
- Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
- Valid Palindrome (EASY) — Two Pointers, String
- Permutation in String (MEDIUM) — Hash Table, Two Pointers, String, Sliding Window
- Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
C
Cisco
87 questions tracked84 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 87 of 87 questions
1Two PointersStringDynamic Programming
2ArrayMathDynamic ProgrammingRecursion+1
8Hash TableLinked ListDesignDoubly-Linked List
9ArrayBreadth-First SearchMatrix
11MediumFind Third Transaction
Database
14ArrayDivide and ConquerDynamic Programming
15ArrayHash TableBinary SearchDesign+2
16MediumFind the Largest Area of Square Inside Two Rectangles✓ Our Solution ArrayMathGeometry
17ArrayBinary SearchGreedySorting+1
18ArrayStringBacktrackingTrie+1
19MediumNumber of Equal Count Substrings
Hash TableStringSliding WindowCounting
21EasyCheck if Binary String Has at Most One Segment of Ones✓ Our Solution String
22ArrayHash TableMathGeometry
23Hash TableMathTwo Pointers
24ArrayMathDynamic ProgrammingGame Theory
26ArrayDynamic ProgrammingMatrix
28ArrayTwo PointersDynamic ProgrammingStack+1
29Hash TableStringSliding Window
30Hash TableLinked ListTwo Pointers
33ArrayDynamic ProgrammingMemoization
35StringDynamic Programming
36ArrayHash TableUnion Find
37Hash TableStringBacktracking
41ArrayDepth-First SearchBreadth-First SearchUnion Find+1
43ArrayStringBacktrackingDepth-First Search+1
46MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
48Hash TableTwo PointersStringSliding Window
49Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
50ArrayHash TableStringSorting
52ArrayGreedyHeap (Priority Queue)Ordered Set
53ArrayHash TableMathDesign+1
55ArrayHash TableDivide and ConquerSorting+4
58StringDynamic Programming
59ArrayHash TablePrefix Sum
62TreeDepth-First SearchBinary Search TreeBinary Tree
63ArrayHash TableMathBinary Search+2
65MathDynamic ProgrammingCombinatorics
68ArrayQueueSliding WindowHeap (Priority Queue)+1
70ArrayStackMonotonic Stack
71StringDynamic Programming
76ArrayDynamic ProgrammingGreedy
77MathStringDynamic Programming
78MathDynamic ProgrammingMemoization
79Two PointersStringDynamic Programming
80ArrayLinked ListStackDesign+2
81ArraySortingHeap (Priority Queue)
82ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
83StringStackGreedyMonotonic Stack
85Divide and ConquerBit Manipulation
86ArrayDynamic ProgrammingMatrix
87Hash TableTwo PointersTreeDepth-First Search+3