Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
I applied via LinkedIn and was interviewed in Oct 2024. There were 3 interview rounds.
Portfolio round - Show case study
I was interviewed in Oct 2016.
I entered into Design through my passion for problem-solving and creativity.
Started designing websites as a hobby
Took design courses in college
Interned at a design agency
Worked on various design projects to build portfolio
I chose UX Design for its blend of creativity, problem-solving, and impact on user experience.
Passion for understanding user behavior and creating intuitive designs
Enjoyment of combining creativity with analytical thinking
Desire to make a tangible impact on improving user experiences
Fascination with the intersection of technology and human psychology
Redesigning a mobile banking app to improve user experience
Conducted user research to identify pain points and user needs
Created wireframes and prototypes to test with users
Iterated design based on user feedback
Collaborated with developers to ensure implementation aligned with design
The basic learnings from the project included the importance of user research, iterative design process, and collaboration with stakeholders.
User research is crucial for understanding user needs and preferences.
Iterative design process helps in refining and improving the design based on user feedback.
Collaboration with stakeholders ensures alignment and buy-in for the design decisions.
For example, conducting usability ...
Overcoming a challenge in a UX design project
Identified a lack of user engagement with a new feature
Conducted user research to understand the root cause
Iterated on the design based on feedback from usability testing
Collaborated with developers to implement changes effectively
Redesigning a mobile banking app to improve user experience and accessibility
Conducted user research to identify pain points and user needs
Created wireframes and prototypes to test new design concepts
Implemented accessibility features such as voice commands and screen reader support
Collaborated with developers to ensure seamless integration of design elements
I led the user research phase, conducted usability testing, and created wireframes for the project.
Led user research to understand user needs and pain points
Conducted usability testing to gather feedback and iterate on designs
Created wireframes to visualize the user interface and interactions
What people are saying about Microsoft Corporation
Assessments that are designed to evaluate a developer's coding skills and aptitude
I applied via Job Portal and was interviewed before May 2023. There were 2 interview rounds.
Designing webpage and putting design elements
General questions around the team building and aptitude for a leadership position i.
Design frameworks are structured approaches used by designers to guide the process of creating user-friendly and visually appealing products.
Design frameworks provide a set of guidelines and principles to follow during the design process.
They help designers organize their thoughts and ideas, ensuring consistency and coherence in the final product.
Examples of design frameworks include Material Design by Google, Atomic D...
Design process is a systematic approach to solving problems and creating solutions through user-centered design.
Research and gather information about the problem and target users
Generate ideas and concepts through brainstorming and sketching
Create prototypes to test and iterate on design solutions
Implement final design based on user feedback and testing
Iterate and improve design based on user feedback
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
My design process involves research, ideation, prototyping, testing, and iteration to create user-centered solutions.
Conduct user research to understand needs and pain points
Brainstorm and ideate potential solutions
Create prototypes to visualize and test ideas
Gather feedback through user testing
Iterate on designs based on feedback and data
I applied via Approached by Company and was interviewed before Mar 2023. There were 3 interview rounds.
Design a user-friendly dashboard for sales and marketing teams to track performance and metrics.
Include key performance indicators (KPIs) such as revenue, leads generated, conversion rates, etc.
Use visualizations like charts and graphs to display data in an easily digestible format.
Allow for customization and filtering options to cater to different user needs.
Incorporate real-time updates and notifications for timely d...
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
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 3 interviews
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
599
salaries
| ₹0 L/yr - ₹0 L/yr |
Support Engineer
552
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Deloitte
TCS