i
Softobotics Technologies
Filter interviews by
I applied via Job Portal and was interviewed in Oct 2021. There was 1 interview round.
Top trending discussions
posted on 16 Nov 2024
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
2-3 basic dsa questions
posted on 1 Aug 2024
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
It was the ask mostly about DSA
posted on 7 Jun 2024
I was interviewed in May 2022.
Round duration - 120 Minutes
Round difficulty - Easy
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...
Calculate total area covered by a list of rectangles on a plane.
Iterate through each rectangle and calculate its area
Check for overlapping areas between rectangles
Sum up the total area covered by all rectangles
Round duration - 60 Minutes
Round difficulty - Medium
Oops concepts and 1 DSA problem
You are provided with a string, termed as DIGIT_PATTERN
, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...
Identify the first repeating digit in a given string of digits.
Iterate through the string and keep track of seen digits using a set.
Return the first digit that repeats, or -1 if no digit repeats.
Time complexity: O(n), where n is the length of the input string.
Round duration - 60 Minutes
Round difficulty - Medium
Firstly Some general questions and then suddenly a cosing question with modifications
Given an input string STR
, generate and print all possible permutations of the string.
str
All permutations of the input string, each on a new line.
Generate and print all possible permutations of a given input string.
Use recursion to generate all permutations by swapping characters in the string.
Maintain a visited array to keep track of characters already used in a particular permutation.
Print each permutation as it is generated.
Handle duplicate characters by skipping swapping if the character is already in the current position.
Tip 1 : You should be perfect in what you know
Tip 2 : Prepare atleast DSA standard questions very well
Tip 3 : Don't ignore OOPs, they are asked very frequently.
Tip 1 : Add good projects
Tip 2 : Must mention all your coding profiles and github where you worked.
I applied via Campus Placement and was interviewed before Feb 2022. There were 4 interview rounds.
I was interviewed 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 reviews
Rating in categories
Software Developer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Java Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Grey Orange
Omron Automation
Bharati Robotic Systems (India)
Systemantics