hirecept

Cisco: Software Engineer

Cisco's fresher process in India is described as an online assessment, one or two technical interviews, a managerial discussion and an HR round, with the technical and managerial steps combined in some drives. Sources disagree on the assessment (a 90-minute proctored test, a 60-minute 50-MCQ test, or MCQs with two DSA problems), roles differ in their steps, and pay figures are aggregator estimates. Verify on Cisco's official pages.

27 questions · 4 rounds · updated Nov 2026

How the interview works

  1. Online assessment: Technical MCQs and DSA problems; the length differs by source.
  2. Technical interviews: DSA, core CS, resume and basic networking.
  3. Managerial and HR: Teamwork and fit.

Sample questions

  • 01

    What happens when you type a URL like www.example.com into a browser and press Enter?

    MediumComputer networks

    Model answer

    What the interviewer checks

    A clear end-to-end sequence. This is a favourite because it covers DNS, TCP, TLS, HTTP and rendering in one question.

    How to answer

    1. The browser parses the URL and checks its caches (browser, OS, hosts file) for the IP. 2. DNS resolution: the resolver asks a root server, then the .com TLD server, then the domain's authoritative server, and gets an IP such as 93.184.216.34. The result is cached for its TTL. 3. TCP connection to port 443: three-way handshake. 4. TLS handshake: the server presents its certificate, the browser verifies it against trusted CAs, and both agree on session keys. 5. The browser sends `GET / HTTP/1.1` with headers such as Host and cookies. 6. The server (often behind a load balancer and CDN) processes it and returns a status (200), headers and HTML. 7. The browser parses HTML into the DOM and CSS into the CSSOM, fetches scripts, images and stylesheets (more requests), runs JavaScript, builds the render tree, lays it out and paints. Say you can go deeper into any step. That signals depth without rambling.

  • 02

    What does this print? int a[] = {10, 20, 30, 40}; int *p = a; p = p + 2; printf("%d %d", *p, *(p - 1));

    HardOutput prediction (C)

  • 03

    Find the length of the longest substring without repeating characters. Example: "abcabcbb" → 3 ("abc"), "pwwkew" → 3

    MediumSliding window

    Approach and solution

    Approach

    Sliding window with the last index of each character. When a character repeats inside the window, move the left edge to one past its previous index. Never move left backwards, hence the max().

    def longest_unique(s: str) -> int:
        last, left, best = {}, 0, 0
        for right, c in enumerate(s):
            if c in last and last[c] >= left:
                left = last[c] + 1
            last[c] = right
            best = max(best, right - left + 1)
        return best
    
    assert longest_unique("abcabcbb") == 3
    assert longest_unique("pwwkew") == 3
    assert longest_unique("abba") == 2

    Complexity: O(n) time, O(k) space for the alphabet.

    Likely follow-ups

    • Return the substring itself: keep the left index of the best window as well as its length.

24 more questions, members only

  • Online assessment8
  • Networking fundamentals5
  • Technical interviews10
  • Managerial and HR4

Members also get how to answer each question and a preparation plan for this company.

See plans from ₹399

Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.