Filter interviews by
I appeared for an interview in Sep 2024.
C sharp.Net
SQL server database
Java
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
Focus on graph questions and os internals
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Merge sort divides the array into two halves, sorts each half, and then merges them back together in sorted order.
It has a time complexity of O(n log n) in the worst case scenario.
Merge sort is stable and can be used for sorting linked lists as well.
Example: Given array [38, 27, 43, ...
Not that much difficult
Data structure
I appeared for an interview in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Easy
First round is Online Test (no negative marking). It was held on campus itself in assigned labs. The test is divided into four main sections:
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Parse the input to create the binary tree using level order traversal
Use a queue to perform level order traversal of the binary tree
Print the node values in level order traversal
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words.
Reverse the order of the words in the resulting array.
Join the reversed words with a single space to form the final reversed string.
Round duration - 60 Minutes
Round difficulty - Easy
Technical round:asked general questions about networking, os and troubleshooting.
There were three rounds of interviews, all knockout rounds and were held on the same day. It will be a very long day for you, so I suggest you to be prepared.
This interview is based completely on Networking concepts. They expect you to answer in complete depth and be as detailed as possible. It is very normal for interviewer to keep typing on laptop to record your answers while you speak, so speak only what you are sure about, but do not be intimidated by it. A few questions that were asked:
Round duration - 60 Minutes
Round difficulty - Easy
This round was based on Operating Systems and troubleshooting. Just like Interview 1, they expect you to answer in depth.
Other important topics for AWS Operating Systems and Troubleshooting interview: OS boot process (Win/Linux); Memory management ;Memory pages; Buffer and Caches, Basic commands; System date/time management, network time protocol; Managing Users and groups; File permissions; Managing softwares – installation, uninstallation, upgrade etc; Managing system services and background processes; Remote management of a system – SSH, RDP etc; Network protocols – FTP, HTTP (web servers), SMTP (mail server); System automation – cron, batch jobs, windows startup tasks
Round duration - 45 Minutes
Round difficulty - Easy
Managerial Round- A senior manager from AWS will be taking this interview. It was very conversational and was based mostly on CV. All questions were asked in a completely non technical perspective, but had to be answered pertaining to previous professional tech experiences (be it academic, or internship related), and not in a generalised form.
Tip 1 : Have an idea about cloud computing and aws services
Tip 2 : learn linux and basic computer networks
Tip 3 : moderate level coding questions need to be practiced
Tip 1 : have some clous based technology included in your resume
Tip 2 : be confident and brush upon your basics in linux,networks and operating systems
Top trending discussions
I applied via Walk-in and was interviewed before Dec 2020. There were 3 interview rounds.
A Fibonacci program generates a sequence where each number is the sum of the two preceding ones, starting from 0 and 1.
The Fibonacci sequence starts with 0 and 1.
Each subsequent number is the sum of the previous two: 0, 1, 1, 2, 3, 5, 8, 13, ...
Common implementations include recursive, iterative, and using dynamic programming.
Example of an iterative approach in Python: ```python def fibonacci(n): a, b = 0, 1 ...
I applied via LinkedIn and was interviewed before Jul 2021. There were 2 interview rounds.
Easy logical questions
basic quant
Easy level coding questions
Counting frequency of alphabets
Multiple dispatch is not a feature of Redux. It can be achieved using middleware or custom logic.
Middleware like redux-thunk or redux-saga can be used to dispatch multiple actions based on a single action.
Custom logic can be implemented in the reducer to handle multiple actions based on a single action type.
For example, a single 'ADD_ITEM' action can trigger multiple actions like 'UPDATE_TOTAL', 'UPDATE_HISTORY', etc.
M...
I applied via Naukri.com and was interviewed before Sep 2019. There were 6 interview rounds.
I applied via Walk-in and was interviewed before Sep 2019. There were 3 interview rounds.
based on 3 interview experiences
Difficulty level
Duration
based on 9 reviews
Rating in categories
Cloud Support Engineer
379
salaries
| ₹18.9 L/yr - ₹30.5 L/yr |
Digital Associate
280
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Cloud Support Associate
187
salaries
| ₹10 L/yr - ₹16 L/yr |
Cloud Engineer
150
salaries
| ₹9.2 L/yr - ₹39 L/yr |
Solution Architect
87
salaries
| ₹40 L/yr - ₹65.4 L/yr |
Amazon
Accenture
Wipro
Cognizant