i
SAP
Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
It was easy. Only basic questions were asked.
Developed a web-based inventory management system for a retail company
Used HTML, CSS, and JavaScript for front-end development
Utilized PHP and MySQL for back-end development
Implemented features such as product tracking, order processing, and reporting
Collaborated with team members to ensure project completion within deadline
Improving a website involves optimizing performance, enhancing user experience, and updating content regularly.
Optimize website speed by compressing images and minifying code
Enhance user experience by improving navigation and adding interactive features
Update content regularly to keep information fresh and relevant
I applied via Referral and was interviewed in Jul 2023. There were 4 interview rounds.
Platform - Hackerrank
time- 90 minutes
2 dsa questions
output- got link for technical interview same day
Longest common subsequence is the longest sequence of characters that appear in the same order in both strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences.
Iterate through the strings and fill the array based on the characters' matches.
Trace back the array to find the actual longest common subsequence.
I appeared for an interview in Apr 2022.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 questions with Easy to Medium level of difficulty
You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.
Calculate total area covered by two overlapping rectangles on a 2-D plane.
Calculate the area of each rectangle separately using the given coordinates.
Find the overlapping region by determining the intersection of the two rectangles.
Calculate the area of the overlapping region by multiplying its width and height.
Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov...
Given an array ARR
consisting of N
integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...
Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.
Continue this process until the two pointers meet in the middle of the array.
The resulting array will ha...
Round duration - 70 minutes
Round difficulty - Medium
Standard DS/Algo round with 2 questions
Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...
Return the middle node of a singly linked list, considering odd and even number of nodes.
Traverse the linked list with two pointers, one moving at twice the speed of the other
When the faster pointer reaches the end, the slower pointer will be at the middle node
Handle cases for odd and even number of nodes separately
Return null if the list is empty
Given a positive integer N
, your task is to return all the prime numbers less than or equal to N
.
1) A prime number is a number that has only two factors:...
Return all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime using a helper function.
A number is prime if it is not divisible by any number from 2 to its square root.
Store and return the prime numbers in an array in increasing order.
Round duration - 30 minutes
Round difficulty - Easy
This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.
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 : Resume should be informative but not more than two pages
Tip 2 : Provide the links of all your achievements, projects and certificates in your resume
Top trending discussions
posted on 8 Jan 2021
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Web service flow is the sequence of steps involved in the communication between a client and a server over the internet.
Web service flow involves a client sending a request to a server
The server processes the request and sends a response back to the client
The response can be in various formats such as XML, JSON, or plain text
Web service flow can be synchronous or asynchronous
Examples of web services include RESTful API...
To check ports in Solaris or Linux machine, use the netstat command.
Open the terminal and type 'netstat -an' to display all open ports.
Use 'netstat -an | grep
To check listening ports, use 'netstat -an | grep LISTEN'.
For Solaris, use 'netstat -an | grep .
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.
List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.
Sorted in Hashed Set means that the elements are stored in a sorted order based on ...
I applied via Naukri.com and was interviewed in Jul 2020. There was 1 interview round.
based on 2 interview experiences
Difficulty level
Duration
based on 11 reviews
Rating in categories
Software Developer
1.3k
salaries
| ₹13.7 L/yr - ₹28.5 L/yr |
Developer Associate
1k
salaries
| ₹10.8 L/yr - ₹18.5 L/yr |
Developer
900
salaries
| ₹15.9 L/yr - ₹28 L/yr |
Senior Developer
580
salaries
| ₹25.5 L/yr - ₹45 L/yr |
Business Process Consultant
493
salaries
| ₹16.9 L/yr - ₹35 L/yr |
Oracle
SAS
Zoho
IBM