Filter interviews by
Clear (1)
Print a matrix in spiral order using clean and efficient code
Create four variables to keep track of the boundaries of the matrix
Use a while loop to iterate through the matrix in a spiral order
Print each element as you iterate through the matrix
Update the boundaries of the matrix after each iteration
I was interviewed in Oct 2017.
Top trending discussions
I applied via LinkedIn and was interviewed in Sep 2023. There were 3 interview rounds.
1. Search in a row and column wise sorted matrix
Localstorage stores data with no expiration date, while session storage stores data for one session only.
Localstorage data persists even after the browser is closed, while session storage data is cleared when the session ends.
Localstorage has a larger storage capacity compared to session storage.
Localstorage data is accessible across different tabs and windows of the same browser, while session storage data is limited ...
posted on 24 Jul 2023
I applied via Walk-in and was interviewed before Jul 2022. There were 4 interview rounds.
Mostly Arithmetic questions, few logical reasoning questions
Simple coding questions like Fibonacci series, string coding questions etc
Reverse the elements in the array of strings
Iterate through the array and swap the elements from start to end
Use two pointers, one at the start and one at the end, and swap the elements until they meet
Use a temporary variable to store the element being swapped
posted on 8 Mar 2024
Coding Test involved some MCQ and a question
DSA questions were there and behavioural
I applied via Referral and was interviewed before Jan 2024. There was 1 interview round.
I was fine with a lot of dsa
I applied via Referral and was interviewed before Nov 2022. There were 2 interview rounds.
The question asks to merge two sorted arrays and delete a node in a linked list.
To merge two sorted arrays, we can use a two-pointer approach.
To delete a node in a linked list, we need to update the pointers of the previous and next nodes.
Example: Merge [1, 3, 5] and [2, 4, 6] to get [1, 2, 3, 4, 5, 6].
Example: Delete node with value 3 from linked list [1, 2, 3, 4, 5] to get [1, 2, 4, 5].
Check if a string is a palindrome using recursion.
Use recursion to compare the first and last characters of the string.
If they are equal, recursively check the substring without the first and last characters.
Continue this process until the string is empty or only has one character.
If all comparisons are equal, the string is a palindrome.
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes
Find the length of the longest substring with distinct characters in a given string.
Use a sliding window approach to keep track of the current substring.
Maintain a set to store the distinct characters in the current substring.
Update the maximum length of the substring whenever a longer substring is found.
The maximum sum of a subarray is to be found.
Use Kadane's algorithm to find the maximum sum of a subarray.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
Return maxSum as the maximum sum of a subarray.
Some of the top questions asked at the Power2sme Software Developer interview -
based on 5 reviews
Rating in categories
Key Account Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Inside Sales Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Indiamart Intermesh
TradeIndia (Infocom Network Private Limited)
Udaan
Moglix