Filter interviews by
Clear (1)
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 was interviewed 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
Amazon Web Services interview questions for designations
Top trending discussions
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
I applied via Walk-in and was interviewed before Sep 2019. There were 3 interview rounds.
I applied via Walk-in and was interviewed in Jan 2020. There were 3 interview rounds.
Basic structure of an HTML page includes doctype declaration, html, head, and body tags.
DOCTYPE declaration specifies the HTML version
HTML tag wraps the entire content of the page
Head tag contains meta information, title, and links to external resources
Body tag contains the visible content of the page
Padding is the space inside an element, while margin is the space outside an element.
Padding is used to create space between an element's content and its border.
Margin is used to create space between an element's border and the adjacent elements.
Padding is affected by the background color of the element, while margin is not.
Padding can be set individually for each side of an element (top, right, bottom, left), while ma...
Box Model is a concept in CSS where every element is treated as a box with content, padding, border, and margin.
Box Model consists of content, padding, border, and margin.
Content is the actual content of the box.
Padding is the space between the content and the border.
Border is the line that goes around the padding and content.
Margin is the space outside the border.
Directives in Angular are markers on DOM elements that tell Angular to attach a specified behavior to that element.
There are three types of directives in Angular: Component, Structural, and Attribute.
Component directives are used to create reusable UI components.
Structural directives are used to change the structure of the DOM.
Attribute directives are used to change the appearance or behavior of an element.
Examples of ...
JIT compiles code at runtime while AOT compiles code before runtime.
JIT stands for Just-In-Time compilation and compiles code at runtime.
AOT stands for Ahead-Of-Time compilation and compiles code before runtime.
JIT is used in Java Virtual Machine (JVM) while AOT is used in languages like C and C++.
JIT can result in slower startup time but faster execution while AOT can result in faster startup time but slower execution...
I applied via Campus Placement and was interviewed in Dec 2020. There were 3 interview rounds.
Fortran is the oldest programming language.
Fortran was developed in the 1950s by IBM.
It stands for Formula Translation.
It was primarily used for scientific and engineering calculations.
Other old programming languages include COBOL and Lisp.
I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.
I was interviewed before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
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.
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
Digital Associate
313
salaries
| ₹0 L/yr - ₹0 L/yr |
Cloud Support Engineer
282
salaries
| ₹0 L/yr - ₹0 L/yr |
Cloud Support Associate
162
salaries
| ₹0 L/yr - ₹0 L/yr |
Cloud Engineer
122
salaries
| ₹0 L/yr - ₹0 L/yr |
Solution Architect
90
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Microsoft Azure
IBM
Oracle