## Cisco Interview Experience | Set 8 (On-Campus)

Hello everyone! Cisco came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews on the basis… Read More »

## Cisco Interview | Set 7(On-Campus)

Status: Full Time job + 6 month internship offered. It was a 4 round interview. The first round was a written round with 50 questions(20… Read More »

## Cisco Interview | Set 6

https://www.geeksforgeeks.org/ has a major role coming out to placement preparation if you want yourself to be placed in the reputed companies one thing that i will… Read More »

## Cisco Interview | Set 5

Interview consists of one written and two technical rounds followed by HR round. Written Test : Total 50 questions Aptitude : 20 Technical : 30… Read More »

## Cisco Interview | Set 4

Cisco Interview Process: Round 1: 50 MCQs Duration: 1 hr 20 – Math Aptitude. 30 – Technical Technical part included questions from Computer organization, Some… Read More »

## Cisco Interview | Set 3

I recently got interviewed for a position in Cisco. The organization came to our college for on-campus recruitment. First round: The first round had 30… Read More »

## Cisco Interview | Set 2

I recently got interviewed for a position in Cisco. The organization came to our college as part of their University recruitment program. The following is… Read More »

## Cisco Interview | Set 1

The interview process consisted of 4 rounds. Round 1: APTITUDE + C + ELECTRONICS MCQs (No negative marking) The aptitude questions had a good mix… Read More »

## Insertion Sort

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. Algorithm // Sort an arr[] of size… Read More »

## Dijkstra’s shortest path algorithm | Greedy Algo-7

Given a graph and a source vertex in the graph, find shortest paths from source to all vertices in the given graph. Dijkstra’s algorithm is… Read More »

## Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5

We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree. The… Read More »

## Sorted Array to Balanced BST

Given a sorted array. Write a function that creates a Balanced Binary Search Tree using array elements. Examples: Input: Array {1, 2, 3} Output: A… Read More »

## Reverse words in a given string

Example: Let the input string be “i like this program very much”. The function should change the string to “much very program this like i”… Read More »

## Level Order Tree Traversal

Level order traversal of a tree is breadth first traversal for the tree. Level order traversal of the above tree is 1 2 3 4… Read More »

## Count set bits in an integer

Write an efficient program to count number of 1s in binary representation of an integer. Examples : Input : n = 6 Output : 2… Read More »