i
Unicommerce Esolutions
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Feb 2024. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
posted on 18 Mar 2024
posted on 9 Oct 2023
I appeared for an interview in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Hard
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Integer N
Prime numbers printed on separate lines
Generate and print all prime numbers between 2 and N, inclusive.
Iterate from 2 to N and check if each number is prime
A prime number is only divisible by 1 and itself
Print each prime number on a new line
Round duration - 60 Minutes
Round difficulty - Hard
Given two strings 'STR' and 'PTR', identify all starting indices of 'PTR' anagram substrings in 'STR'. Two strings are anagrams if one can be rearranged to form the other.
Implement a function to find all starting indices of anagram substrings of a given string in another string.
Create a frequency map of characters in the 'PTR' string.
Use a sliding window approach to check for anagrams in 'STR'.
Return the starting indices of anagram substrings found.
Example: For input 'BACDGABCD' and 'ABCD', output should be [0, 5].
Round duration - 60 Minutes
Round difficulty - Hard
Common testing questions related to Linux and operating systems
What are the different types of testing that can be performed on a Linux operating system?
How do you test the compatibility of software with different Linux distributions?
Can you explain the process of testing kernel modules in a Linux environment?
What tools and techniques do you use for performance testing on Linux systems?
How do you ensure the security an
Tip 1 : practice coding
Tip 2 : be thorough with your resume
Tip 1 : have good projects
Tip 2 : fulfill the required tech stack
posted on 13 Aug 2024
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Easy
The test had it's webcam on, we were not allowed to go out of the frame.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
The program calculates the Nth Fibonacci number using a recursive formula.
The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.
The program uses a recursive function to calculate the Nth Fibonacci number.
The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
You are provided with an unsorted array/list ARR
of N
integers. Your task is to determine the length of the longest consecutive sequence present in the array...
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
Sort the array to bring consecutive numbers together
Iterate through the sorted array and keep track of the current consecutive sequence length
Update the maximum length if a longer sequence is found
Round duration - 30 minutes
Round difficulty - Medium
The interview was online from home.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
Iterate through the string from the last character to the first character and append each character to a new string.
Alternatively, you can use built-in string reversal functions or methods available in your programming language.
To solve the follow-up question with O(1) space complexity, you can use a tw...
Round duration - 20 minutes
Round difficulty - Easy
This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals .
The interviewer was very understanding and supportive.
Tip 1 : Find a good course, and first clear all your fundamentals and implementation of every data structure. You should be thorough with their time as well as space complexities.
Tip 2 : Upon clearing the fundamentals, select a platform where you have a large no of questions, also whose test cases are good. eg. LeetCode, InterviewBit or Codezen. Go and complete 300-400 questions.
Tip 3 : Also whenever you're not able to solve the problem, check out the editorial and then re-attempt it again. Also, check the discussion if there is some good solution to the same problem.
Tip 4 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 5 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 1 : Resume should contain facts, numbers, and data comparison.
Tip 2 : Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 3 : Technical achievements in the field you're applying to, would be good.
Tip 4 : DO NOT FAKE THINGS, the interviewer is smart enough.
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Consultant
28
salaries
| ₹5 L/yr - ₹12.5 L/yr |
Software Engineer
25
salaries
| ₹10 L/yr - ₹20 L/yr |
Senior Associate
23
salaries
| ₹3 L/yr - ₹7.5 L/yr |
Senior Software Engineer
20
salaries
| ₹15 L/yr - ₹30 L/yr |
Associate Product Manager
15
salaries
| ₹10.9 L/yr - ₹18.8 L/yr |
Delhivery
Ecom Express
Shiprocket Private Limited
Vinculum Solutions