Sr. Software Engineer
Sr. Software Engineer
Work from Home
Good campus.
Scope to learn new things.
Missing hike cycle. It is luck that you get a good hike. Like you should get good work, you should do a good job, and then that year's hike cycle should be there. Else, your work will not be counted for the next hike cycle.
Due to missing hike cycles, most of the people who stay for a longer time are paid very less.
Manager's pets get high priority.
Workload. Managers expect their peers to work on weekends.
Was this helpful?
Cisco Interview Questions
Cisco Interview Experiences
Senior Software Engineer
Online HackerRank 3 rounds of F2F interviews Networking, OS, Algo, C code, Data Structures: * Reverse a linked list * Binary search tree * Binary tree * Bit magic * Add 2 numbers in linked list * Reverse a string How does TCPdump work? How does p
Senior Software Engineer
Most interviews happen on the same day. If an initial interview isn't very positive, they still conduct the other interviews and make a decision after the HM (Hiring Manager) round. This approach is neither entirely good nor bad.
Senior Software Engineer
The overall code is good. c struct Node { int data; struct Node* next; }; /* Function to get the middle of the linked list */ void printMiddle(struct Node *head) { struct Node *slow_ptr = head; struct Node *fast_ptr = head; if
Senior Software Engineer
Bengaluru, Karnataka, IndiaSeptember 30, 2024Online HackerRank 3 rounds of F2F interviews Networking, OS, Algo, C code, Data Structures: * Reverse a linked list * Binary search tree * Binary tree * Bit magic * Add 2 numbers in linked list * Reverse a string How does TCPdump work? How does p
Senior Software Engineer
Bengaluru, Karnataka, IndiaApril 1, 2023Most interviews happen on the same day. If an initial interview isn't very positive, they still conduct the other interviews and make a decision after the HM (Hiring Manager) round. This approach is neither entirely good nor bad.
Senior Software Engineer
Bengaluru, Karnataka, IndiaJanuary 1, 2019The overall code is good. c struct Node { int data; struct Node* next; }; /* Function to get the middle of the linked list */ void printMiddle(struct Node *head) { struct Node *slow_ptr = head; struct Node *fast_ptr = head; if
