I recently took the time to do a Cisco (company name) To be honest, this test can be completely regarded as a "welfare bureau". The whole set of three questions, the difficulty is not high, the question type is relatively conventional, there are not too many tricky points. The overall experience in the process of answering questions is very smooth, there will be no lag or tangled for too long. Compared to the OA of other big companies that often burn the brain, Cisco's game is really a rare "whoring game". If you usually have brushed some of the classic LeetCode questions, basically closed eyes can pass the test smoothly.
Cisco Online Assessment workflows
Cisco's OA format is very traditional, with no fancy add-ons:
Number of questions: 3 algorithmic questions
Time: 90 minutes total (plenty of time)
programming language: common languages are supported (I use C++ and have a smooth experience)
matrix: Online IDE, it's kind of smooth compared to some laggy platforms
The overall atmosphere is friendly, unlike some companies OA up on time constraints + big data case, Cisco's rhythm is very "considerate".
Cisco oa questions (review of questions)
Problem 1: Binary Linked List to Decimal
Problem Statement
A binary number is represented as a singly linked list, where each node contains either 0 or 1.
Given the head of the linked list, convert the binary number into its decimal representation.
Example
binary -> 0 -> 0 -> 1 -> 0 -> 0 -> 1 -> 1 -> null
This corresponds to 010011₂ = 19₁₀.
Input
- The first line: an integer
list_size, the number of nodes in the list. - The second line.
list_sizespace-separated integers (0 or 1), representing the data in each node.
Output
- Print the decimal equivalent of the binary number.
Solution Explanation
- Traverse the linked list while treating it as a binary number.
- Start with
decimal = 0. - For each node, shift
decimalleft by one (multiply by 2) and add the node's value.
This simulates binary conversion efficiently in O(N) time and O(1) extra space.
Problem 2: Expand String with Patterns
Problem Statement
You are given a string S. The string may contain substrings grouped inside parentheses () which form patterns.
Each pattern is followed by an integer inside curly braces {} which indicates the repeat count.
Rules
- A pattern
(Pi){Ni}should be expanded as the substringPirepeatedNiTimes. - For this version, consider simple (non-nested) patterns.
Input
- A single string
inputStr.
Output
- Print the expanded string.
Example
Input:
(ab){3}
Output:
ababab
Solution Explanation
- Scan the string and detect any pattern enclosed in
(). - Read the substring inside parentheses.
- Extract the integer inside
{}. - Repeat the substring accordingly.
This works straightforwardly with O(L × K) time (where L is input length and K is repeat count).
Problem 3: Expand String with Nested Patterns
Problem Statement
This is an advanced version of Problem 2, where patterns can be nested.
Example
(ef((ab){2}cd){2}){2}
Rules
- Each pattern
(Pi){Ni}expands toPirepeatedNiTimes. - If patterns are nested, expand the inner ones first.
Input
- A single string
inputStr.
Output
- Print the fully expanded string.
Solution Explanation
- Use a stack-based parsing approach:
- Traverse the string character by character.
- Push characters to a stack until you hit a
). - When
)is found, pop until matching(to extract the pattern. - Immediately after, read the repeat count inside
{}. - Expand the substring and push the result back onto the stack.
- Continue until the full string is processed.
- Join stack contents for the final answer.
This ensures even nested patterns expand correctly.
Comparison with other big factories
Compare to Amazon OAAmazon has simulation + debugging + math logic, which is mentally stressful. cisco has all regular questions, which is a lot easier.
Compare to Google/Meta OA: Google/Meta is on the hard/medium side, Cisco is easy-medium, not a dimension at all.
Comparison with financial OACisco doesn't go that way at all.
Cisco OA is considered to be the gentlest of the big plants.
Summary & Helpful Tips
Cisco OA overall really is a "friendly bureau", brush through the basic questions of the students are basically able to pass steadily. But then again, the large factory recruitment process is long, and the back of the interview link is often the real test.
If you are worried that you may be careless and fail in OA, or your mind is blank when you encounter high-pressure questions and answers in interviews, and you need tips on how to think on the spot or voice assistance, we are here to help! Programhelp can help you get it done: OA without traces of online writing, VO assistance, and even the whole interview service ...... Whether it is a "welfare OA" such as Cisco, or high-pressure interviews such as Amazon/Google, we have a mature program to help you from OA to VO all the way to a solid opportunity. We have a mature program to help you from OA to VO all the way to get the opportunity.
Don't tough it out alone in an interview, it's much easier on the mind to have a backup plan in place.
