Jio SAP Abap Consultant Interview Questions and Answers

Q1. Tell me about yourself
Add your answer

Q1. Explain yourself
Add your answer

Programming easy question to understand your logical thinking.

Q1. What are your salary expectations?
Add your answer
Q2. What is your family background?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer

Q1. Sql related ques mege into, rank,dense rank,queries of joins etc.
Add your answer
Q2. Java 8 related ques optional and stream
Add your answer

Coding round with 3 DSA questions and a few MCQs on aptitude.

Q1. Interviewer asked questions on DSA.
Add your answer

Q1. The interviewer asked general questions on DSA.
Add your answer

Round duration - 90 minutes (60 minutes for coding and 30 minutes for MCQs)
Round difficulty - Medium

The test was conducted in the evening from 7:00 pm to 8:30 pm. Because of the covid situation, the test was online and was given by all the students from their home. 
Login window of 15 minutes was given and all students were supposed to login within initial 15 minutes (between 7:00 and 7:15 pm). The test was conducted on AMCAT and webcam was on during the whole test duration.
There were two sections in the test: 1.) Coding round with 2 coding questions - 60 minutes (2.) MCQ round with 30 MCQs - 30 minutes
120 students appeared for this round and 20 were shortlisted for further process.

Q1. 
Character Frequency Problem Statement
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
Example:
Input:
S : abcdg
Output:
1...read more
Ans. 
Given a string, find the frequency of each character from 'a' to 'z' in the string.
• Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

• Iterate through the string and increment the count of the corresponding character in the array.

• Print the array of frequencies as the output for each test case.
Answered by AI
Add your answer
Q2. 
Longest Common Prefix After Rotation
You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.
Explanation:
Your task is to calcu...read more
Ans. 
Calculate the minimum number of left shift operations needed to achieve the longest common prefix between two strings.
• Apply left shift operations to string B to find the longest common prefix with string A

• Count the number of left shifts needed to achieve the longest common prefix

• Return the minimum number of left shift operations for each test case
Answered by AI
View 1 more answer

Round duration - 50-60 minutes
Round difficulty - Medium

This round started at 11 am and went till 3 pm. 
Out of 120 students that appeared in online coding test, 20 were shortlisted for the first round of interviews.
In this round, everyone was asked some moderate level coding questions. We were supposed to write the code in our IDE, present the screen and show the interviewer the output of our code.
The interview started with the introduction being followed by 2 coding problems.

Q1. 
Longest Subarray with Zero Sum
Ninja enjoys working with numbers, and as a birthday challenge, his friend provides him with an array consisting of both positive and negative integers. Ninja is curious to ...read more
Ans. 
Find the length of the longest subarray with zero sum in an array of integers.
• Iterate through the array and keep track of the running sum using a hashmap.

• If the running sum is seen before, the subarray between the current index and the previous index with the same sum is a subarray with zero sum.

• Update the length of the longest subarray with zero sum as you iterate through the array.

• Example: For arr1 = [1, -1, 3, 2, -2...read more
Answered by AI
View 1 more answer

Round duration - 20 minutes
Round difficulty - Medium

7 students were shortlisted for the HR round. This round started at 7:30 pm and went till 8:30 pm.
Like all the other rounds, this round too was virtual (on google meet). In the beginning, the interviewer introduced himself and then asked questions based on my resume.
All the 7 candidates were selected in the HR round.

Round duration - 60 Minutes
Round difficulty - Medium

Online Technical Interview ( Coding Round) with 2 medium-hard problem

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.
• Iterate through the array to find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the elevation map.
Answered by AI
Add your answer
Q2. 
Longest Consecutive Sequence Problem Statement
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...read more
Ans. 
Find the length of the longest consecutive sequence in an unsorted array of integers.
• Iterate through the array and store each element in a set for constant time lookup.

• For each element, check if it is the start of a sequence by looking for its previous number in the set.

• Update the length of the current consecutive sequence and track the longest sequence found so far.

• Return the length of the longest consecutive sequence...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Online Technical Coding Interview

Q1. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Ans. 
Implement a stack using two queues to store integer values with specified functions.
• Create a stack using two queues internally

• Implement functions for push, pop, top, size, and isEmpty

• Handle edge cases such as empty stack or invalid data

• Ensure the stack functions work correctly and efficiently

• Test the implementation with sample inputs and outputs
Answered by AI
Add your answer
Q2. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
Print the left view of a binary tree, containing nodes visible from the left side.
• Traverse the tree in a level order manner and print the first node at each level.

• Use a queue to keep track of nodes at each level.

• Handle null nodes represented by -1 in the input.
Answered by AI
Add your answer