KPMG India Full Stack Developer Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
• Create a frequency map of characters for both strings and compare them.

• Sort both strings and check if they are equal.

• Use a hash table to store character counts and compare the counts for both strings.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was face to face interview round.

Q1. 
Next Greater Number Problem Statement
Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...read more
Ans. 
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
• Iterate from right to left to find the first digit that can be swapped with a larger digit to make the number greater.

• Swap this digit with the smallest digit to its right that is larger than it.

• Sort the digits to the right of the swapped digit in ascending order to get the smallest number greater than ...read more
Answered by AI
Add your answer
Q2. 
Circular Move Problem Statement
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...read more
Ans. 
Determine if a robot's movement path is circular on a 2D grid given a sequence of moves.
• Create a set of directions to keep track of the robot's current direction (north, east, south, west).

• Simulate the robot's movement based on the given sequence of moves (L - turn left, R - turn right, G - move forward).

• Check if the robot returns to the starting position after completing the sequence of moves.

• Example: For 'GLGLGLG', t...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This round is basically on zoom meet . 

Aptitude questions will be medium level.but time matters here.
Solving them within the given timespan is important.

Coding questions will be medium level.practice previous assessment questions helps a lot

Q1. In Techincal they will discuss more on basics only
Add your answer
Q2. From Java what is friend function
Ans. 
Friend function is not a concept in Java.
• Friend function is a concept in C++ where a non-member function can access private and protected members of a class.

• Java does not have the concept of friend function.

• In Java, access to private and protected members of a class is restricted to the class itself and its subclasses.
Answered by AI
Add your answer
Q3. Asked more on Oops concepts
Add your answer