i
Autodesk
Filter interviews by
Clear (1)
I have experience managing large-scale IT infrastructure projects for multinational companies.
Managed implementation of new data center for a global tech company
Led migration of legacy systems to cloud-based solutions
Coordinated cross-functional teams to ensure project milestones were met
Top trending discussions
I applied via Approached by Company and was interviewed before Oct 2022. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2023. There was 1 interview round.
Negotiating timelines with product owners or scrum teams in a waterfall model requires clear communication, prioritization, and flexibility.
Communicate openly and regularly with the product owner and scrum team to understand project requirements and constraints.
Prioritize tasks based on importance and impact on project timeline.
Be flexible and willing to adjust timelines based on feedback and changes in project scope.
U...
I have used a variety of tools including project management software, communication tools, and data analysis tools.
Project management software (e.g. Microsoft Project, Asana)
Communication tools (e.g. Slack, Microsoft Teams)
Data analysis tools (e.g. Excel, Tableau)
I manage escalations by addressing the issue promptly, involving key stakeholders, setting clear expectations, and finding a resolution.
Address the issue promptly to prevent it from escalating further
Involve key stakeholders such as team members, clients, and senior management
Set clear expectations and communicate effectively with all parties involved
Find a resolution that satisfies all parties and prevents similar esc
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2020. There were 5 interview rounds.
Single linked list has one pointer while doubly linked list has two. Doubly linked list is preferred for easier traversal in both directions.
Single linked list has only one pointer which points to the next node while doubly linked list has two pointers which point to the next and previous nodes.
Doubly linked list allows for easier traversal in both directions, while single linked list only allows for traversal in one d...
LINUX/UNIX are open-source, command-line based OS while WINDOWS is a proprietary, GUI-based OS.
LINUX/UNIX have a steep learning curve due to command-line interface
WINDOWS is more user-friendly with a graphical user interface (GUI)
LINUX/UNIX are more stable and secure than WINDOWS
LINUX/UNIX are free and open-source while WINDOWS is proprietary and requires a license
LINUX/UNIX are preferred for servers and development wh...
Program to sort an array of strings
Use a sorting algorithm like bubble sort, insertion sort, or quicksort
Compare adjacent elements and swap if necessary
Repeat until the array is sorted
Sorting techniques and their time complexity
Bubble sort - O(n^2)
Selection sort - O(n^2)
Insertion sort - O(n^2)
Merge sort - O(n log n)
Quick sort - O(n log n)
Heap sort - O(n log n)
Radix sort - O(nk)
Most efficient: Quick sort or Merge sort
Efficiency depends on the size of the array and the data distribution
Big data refers to large and complex data sets that cannot be processed using traditional data processing methods.
Big data is characterized by the 3Vs - volume, velocity, and variety.
It requires specialized tools and techniques for processing and analysis.
Examples of big data include social media data, sensor data, and financial market data.
ASP.net is better for enterprise-level applications due to its integration with Windows and Microsoft technologies.
ASP.net has better integration with Windows and Microsoft technologies
ASP.net has better performance and scalability for enterprise-level applications
ASP.net has a larger developer community and more resources available
Java is better for cross-platform development and open-source projects
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Proficient in programming languages such as Java and Python
Strong problem-solving skills and ability to work in a team environment
Passionate about learning new technologies and staying up-to-date with industry tren
I am impressed with the company's innovative approach and would love to be a part of the team.
I have researched the company and am impressed with its achievements
I am excited about the company's focus on innovation and cutting-edge technology
I believe that the company's values align with my own and I would be proud to work here
Yes, can you tell me about the company culture?
Our company values collaboration and innovation
We prioritize work-life balance for our employees
We have a diverse and inclusive workplace culture
I applied via Approached by Company and was interviewed in Aug 2017. There were 5 interview rounds.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
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.
I was interviewed in Jul 2017.
Code to print * in five consecutive lines
Use a loop to iterate five times
Inside the loop, print a string containing a single * character
Code to calculate number of bounces a ball goes through until it comes to rest.
Use a loop to simulate the bounces until the ball stops bouncing
Calculate the height of each bounce using the given formula
Keep track of the number of bounces in a counter variable
The best and less time consuming way to calculate factorial of a number is using iterative approach.
Iteratively multiply the number with all the numbers from 1 to the given number
Start with a result variable initialized to 1
Multiply the result with each number in the range
Return the final result
Code to find factorial using function recursion
Define a function that takes an integer as input
Check if the input is 0 or 1, return 1 in that case
Otherwise, call the function recursively with input-1 and multiply it with the input
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
102
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Adobe
Dassault Systemes
PTC
Siemens