Filter interviews by
Top trending discussions
I was interviewed before Oct 2016.
Cloud computing is the delivery of computing services over the internet.
Cloud computing allows users to access and use computing resources on-demand.
Types of cloud computing include public, private, and hybrid clouds.
Public clouds are owned and operated by third-party providers, like Amazon Web Services (AWS) or Microsoft Azure.
Private clouds are dedicated to a single organization and can be located on-premises or host...
I was interviewed in Aug 2024.
Code-with-cisco having coding questions and mcq
Different scheduling algorithms in OS determine how tasks are prioritized and executed.
First-Come, First-Served (FCFS)
Shortest Job Next (SJN)
Round Robin (RR)
Priority Scheduling
Multi-Level Queue Scheduling
Contact dictionary can be implemented using hash table for fast lookups with O(1) time complexity.
Use a hash table to store contacts with keys as names and values as contact information.
Example: { 'John Doe': '555-1234', 'Jane Smith': '555-5678' }
Time complexity for searching, inserting, and deleting contacts is O(1) with a hash table.
Cisco is a multinational technology conglomerate known for networking hardware, software, and services.
Cisco is a leading provider of networking equipment and solutions.
They offer a wide range of products including routers, switches, and security devices.
Cisco also provides software solutions for network management and security.
The company offers services such as consulting, technical support, and training.
Cisco is kno...
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I was interviewed before May 2016.
I was interviewed before Mar 2021.
Round duration - 40 minutes
Round difficulty - Easy
Technical round with questions based on DSA.
Create a program to reverse a given integer N
. The output should be the reversed integer.
If a number has trailing zeros, their reversed version should not inclu...
Reverse a given integer while excluding trailing zeros.
Create a program to reverse the given integer by converting it to a string and then reversing it.
Remove any trailing zeros from the reversed string before converting it back to an integer.
Handle the constraints of the input integer being between 0 and 10^8.
Example: For input 1230, the output should be 321.
You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.
The first line of input contai...
Reverse a given singly linked list by changing the links between nodes.
Iterate through the linked list and reverse the links between nodes.
Use three pointers to keep track of the current, previous, and next nodes.
Update the links while traversing the list to reverse it.
Return the head of the reversed linked list.
new int[5] is C++ specific and initializes the array with default values, while malloc(5 * sizeof(int)) is a C function and does not initialize the array.
new int[5] is C++ specific and calls constructors for each element in the array.
malloc(5 * sizeof(int)) is a C function and does not call constructors, leaving the array uninitialized.
new int[5] returns a pointer to the first element of the array, while malloc(5 * siz...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
To resolve space issue with GET API request, consider pagination, compression, caching, and optimizing query parameters.
Implement pagination to limit the number of results returned in each request.
Use compression techniques like Gzip to reduce the size of the response data.
Implement caching mechanisms to store frequently accessed data and reduce the number of requests.
Optimize query parameters to only request necessary
Technical Support Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Trainer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
TAC Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Professional Services Consultant
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Palo Alto Networks
Check Point Software Technologies
Gen
Cisco