MTX interview experience Real time questions & tips from candidates to crack your interview

Salesforce Developer

MTX
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 12 months
Topics: Data Structures, OOPS, DBMS, Algorithms, Operating System
Tip
Tip

Tip 1 : Practice DSA questions with all the approaches.
Tip 2 : Give Mock Interviews for better understanding.
Tip 3 : Master atleast 1 development stack with project like WebD, Android etc.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Give Link of Coding profiles like Leetcode, GFG etc.
Tip 2 : Give Link of projects after uploading to github.

Interview rounds

01
Round
Medium
Online Coding Test
Duration180 Minutes
Interview date22 Dec 2021
Coding problem2

It was in night and the environment was quite good for coding.

1. Longest Common Subsequence

Moderate
39m average time
0/80
Asked in companies
SlicePayPalSAP Labs

Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.

For a string 'str'(per se) of length K, the subsequences are the strings containing characters in the same relative order as they are present in 'str,' but not necessarily contiguous. Subsequences contain all the strings of length varying from 0 to K.

Example :
Subsequences of string "abc" are:  ""(empty string), a, b, c, ab, bc, ac, abc.
Problem approach

I have done this questions earlier so I applied DP and all test cases got passed successfully

Try solving now

2. Convert Bst To The Greater Sum Tree

Moderate
30m average time
70% success
0/80
Asked in companies
AmazonMathworksCultfit

You have been given a Binary Search Tree of integers. You are supposed to convert it to a greater sum tree such that the value of every node in the given BST is replaced with the sum of the values of all the nodes which are greater than the value of the current node in the tree.

A Binary Search Tree is a tree, whose internal nodes each store a value greater than all the values in the node's left subtree and less than those in its right subtree.

Note :

You need to modify the given tree only. You are not allowed to create a new tree.
For example:
For the given binary search tree

Example

11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
Problem approach

We know that right most node in the binary search tree is the biggest node among all node so we will start from there, (reverse inorder traversal).
1. Since we are visiting the nodes in the decreasing order so all we need to care about maintaining the sum of the nodes visited.
2. Updated the node value as sum ( since each node contains sum of nodes greater than that node which means we need to exclude the node value itself).
3. 
Update the sum as sum = sum + temp (for the next node in iteration).

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date14 Jan 2022
Coding problem3

It was completely based on my resume and the interviewer was very helpful.

1. Count Frequency

Easy
15m average time
85% success
0/40
Asked in companies
AmazonSprinklrHewlett Packard Enterprise

You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.

Example :

Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
Problem approach

I have used map to solve this problem in efficient approach

Try solving now

2. DBMS based question

What are ACID Properties?
Explain different types of relationships amongst tables in a DBMS?
Explain different types of keys in a database?

3. Puzzle

3 cuts to cut the round cake into 8 equal pieces

03
Round
Easy
HR Round
Duration20 mins
Interview date20 Jan 2022
Coding problem1

It was around 2 PM and its just a normal talk with HR

1. Basic HR questions

She asked about my normal day routine ?

Any preference for my location?

She asked to tell something about me which is not there in resume?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
Salesforce Developer
4 rounds | 10 problems
Interviewed by MTX
584 views
0 comments
0 upvotes
Salesforce Developer
4 rounds | 12 problems
Interviewed by MTX
522 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes