Premium Employer

i

This company page is being actively managed by 10405090xyzabc Team. If you also belong to the team, you can get access from here

10405090xyzabc Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

10405090xyzabc SAP SD Consultant Interview Questions and Answers

Updated 18 Feb 2025

10405090xyzabc SAP SD Consultant Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I was interviewed in Jan 2025.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Vshdhd f fhf f fhfbf fff
  • Q2. Dbjdbdbf f djfhf ff
  • Q3. Hshdhff f fbffbffg g

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Assignment 

The assignment was to display a flight list and implement sort and filter functionality.

Round 2 - Coding Test 

Basic of react native concepts and live machine coding round

Interview Preparation Tips

Interview preparation tips for other job seekers - Have patience and be honest
Interview experience
1
Bad
Difficulty level
-
Process Duration
4-6 weeks
Result
-

I applied via Referral

Round 1 - Technical 

(1 Question)

  • Q1. Coding Question and resume based questions

Interview Preparation Tips

Interview preparation tips for other job seekers - They keep rescheduling interviews, and the interviewers do not arrive on time. Occasionally, they do not even join the call. If you do not have the time to conduct interviews, then do not waste the candidate's time. Even the interviewer mentioned that they have a hectic work culture.

I applied via Recruitment Consultant and was interviewed in Nov 2020. There were 6 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Before Going interview, prepare ur self & ur resume. At 90% people are not follow their own resume were they are mention all the stuff like past experience.

Interview Preparation Tips

Interview preparation tips for other job seekers - If you are prepare ur self & prepare cv with respect to ur employer requirement to fulfill then you will be able to dream job.

Most important point is understand ur employer requirement & expectation.

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Rotate Matrix Right K Times

    You are given a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...

  • Ans. 

    Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.

    • Iterate 'K' times to perform right rotation on the matrix

    • Shift each column to the right by one position in each rotation

    • Handle wrapping around the matrix when shifting columns

    • Return the matrix elements row-wise after 'K' rotations

  • Answered by AI
  • Q2. 

    Word Search Problem Statement

    Given a two-dimensional grid of size N x M consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.

    The 'WORD' can b...

  • Ans. 

    Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use recursion to explore all possible paths from a starting cell to form the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of how man

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

  • Q1. 

    Problem Statement: Largest Island

    You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.

    An island consists of a...

  • Ans. 

    Find the maximum area of an island in a grid of 0s and 1s.

    • Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

    • Keep track of the area of each island found and return the maximum area.

    • Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like grid boundaries and already visited cells during DFS.

    • If no island is present, return 0 as the

  • Answered by AI
  • Q2. 

    Pythagorean Triplet Problem

    Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.

    Expl...

  • Ans. 

    Check if there exists a Pythagorean triplet in a given array of integers.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
  • Q3. 

    Top View of Binary Tree Problem Statement

    Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...

  • Ans. 

    Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.

    • Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.

    • Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.

    • Return the values of the topmost nodes in the map as the top view of the Binary Tree.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

  • Q1. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two nodes that are swapped by mistake in the BST.

    • Swap the values of the two identified nodes to restore the BST.

    • Perform an in-order traversal of the BST to verify the correct restoration.

    • Ensure no extra space other than the recursion stack is used for the solution.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.

    • Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure that each operation runs in constant time O(1).

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queri

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, OS, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application resume tips for other job seekers

Tip 1 : Try not to mention those things about which you are not comfortable. 
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - Coding Test 

It was 1 hour long and was asked to pass all the test cases.

Round 2 - Technical 

(1 Question)

  • Q1. System Design with basic of OOP and OS
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Some medium Graph problems from leetcode
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all Resume tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Two medium graph questions from leetcode
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Aug 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Do not use an unprofessional email address such as cool_boy@email.com. It shows a lack of professionalism by the candidate.
View all Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. Operating system questions
Round 3 - Coding Test 

Linked list standard questions

Contribute & help others!
anonymous
You can choose to be anonymous

10405090xyzabc Interview FAQs

How many rounds are there in 10405090xyzabc SAP SD Consultant interview?
10405090xyzabc interview process usually has 1 rounds. The most common rounds in the 10405090xyzabc interview process are One-on-one Round.
What are the top questions asked in 10405090xyzabc SAP SD Consultant interview?

Some of the top questions asked at the 10405090xyzabc SAP SD Consultant interview -

  1. Vshdhd f fhf f fhfbf ...read more
  2. Dbjdbdbf f djfhf...read more
  3. Hshdhff f fbffbff...read more

Recently Viewed

INTERVIEWS

Agilent Technologies

No Interviews

INTERVIEWS

10405090xyzabc

No Interviews

INTERVIEWS

Agilent Technologies

No Interviews

INTERVIEWS

JPMorgan Chase & Co.

No Interviews

INTERVIEWS

Mordor Intelligence

No Interviews

LIST OF COMPANIES

10405090xyzabc

Locations

INTERVIEWS

Aadiswan Info Consultants

No Interviews

INTERVIEWS

Aadiswan Info Consultants

No Interviews

SALARIES

Agilent Technologies

LIST OF COMPANIES

Aadiswan Info Consultants

Locations

Tell us how to improve this page.

10405090xyzabc SAP SD Consultant Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Join 10405090xyzabc A rigorous study based on a sample of more

Interview Questions from Similar Companies

Agrim Interview Questions
3.5
 • 12 Interviews
Vnr Seeds Interview Questions
3.9
 • 12 Interviews
Ananda Dairy Interview Questions
3.9
 • 9 Interviews
Gramophone Interview Questions
4.0
 • 8 Interviews
BIGHAAT AGRO Interview Questions
4.3
 • 6 Interviews
View all
10405090xyzabc SAP SD Consultant Salary
based on 4 salaries
₹6 L/yr - ₹12 L/yr
10% more than the average SAP SD Consultant Salary in India
View more details
Software Developer
9.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
9.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Officer
260 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Softwaretest Engineer
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Test Engineer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare 10405090xyzabc with

Oyo Rooms

3.3
Compare

FabHotels

3.0
Compare

Taco Bell

4.2
Compare

TAJSATS AIR CATERING

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview