Filter interviews by
Return k most frequent strings from an array of strings
Use a hashmap to store the frequency of each string in the array
Sort the hashmap by frequency in descending order
Return the first k keys from the sorted hashmap
Developed a web-based project management tool for tracking tasks and deadlines.
Used AngularJS for front-end development
Implemented RESTful APIs for backend using Node.js
Utilized MongoDB for database storage
Addressing conflicts with a developer requires communication, understanding, and collaboration to find a resolution.
Initiate a one-on-one conversation to understand their perspective.
Use 'I' statements to express how the conflict affects your work, e.g., 'I feel overwhelmed when deadlines are missed.'
Seek common ground by discussing shared goals and objectives.
Propose solutions collaboratively, such as adjusting t...
A null pointer exception occurs when a program tries to access a memory address that is null or invalid.
Occurs in programming languages like Java when trying to access an object or variable that is null
Can be caused by not properly initializing a variable before using it
Example: int[] arr = null; int x = arr.length; // This will throw a null pointer exception
Apache Cassandra is a persistent in-memory key-value store optimized for write-heavy workloads using SSTables and compaction.
Apache Cassandra is a popular choice for write-heavy workloads due to its distributed architecture and support for SSTables.
SSTables (Sorted String Tables) are used to store data on disk in a sorted manner, allowing for efficient read and write operations.
Compaction in Apache Cassandra helps...
The Word Break III problem involves finding all possible sentences from a string using a given dictionary of words.
Use dynamic programming to build solutions incrementally.
Maintain a list of valid sentences as you explore combinations.
Example: For s = 'leetcode' and dict = ['leet', 'code'], output = ['leet code'].
Consider edge cases like empty strings or dictionaries.
Java is a popular programming language used for developing various applications. Concurrency errors occur when multiple threads access shared resources simultaneously.
Java is a high-level, object-oriented programming language known for its platform independence.
Concurrency errors in Java can be solved using synchronization mechanisms like synchronized blocks, locks, and atomic variables.
Examples of solving concurr...
I applied via LinkedIn and was interviewed in Apr 2024. There were 3 interview rounds.
Technical round- Hackerank Problem
Addressing conflicts with a developer requires communication, understanding, and collaboration to find a resolution.
Initiate a one-on-one conversation to understand their perspective.
Use 'I' statements to express how the conflict affects your work, e.g., 'I feel overwhelmed when deadlines are missed.'
Seek common ground by discussing shared goals and objectives.
Propose solutions collaboratively, such as adjusting timeli...
I applied via Referral and was interviewed in Jun 2024. There were 2 interview rounds.
Two medium level question in 75 minutes
Return k most frequent strings from an array of strings
Use a hashmap to store the frequency of each string in the array
Sort the hashmap by frequency in descending order
Return the first k keys from the sorted hashmap
Java is a popular programming language used for developing various applications. Concurrency errors occur when multiple threads access shared resources simultaneously.
Java is a high-level, object-oriented programming language known for its platform independence.
Concurrency errors in Java can be solved using synchronization mechanisms like synchronized blocks, locks, and atomic variables.
Examples of solving concurrency ...
A null pointer exception occurs when a program tries to access a memory address that is null or invalid.
Occurs in programming languages like Java when trying to access an object or variable that is null
Can be caused by not properly initializing a variable before using it
Example: int[] arr = null; int x = arr.length; // This will throw a null pointer exception
Medium leet code data structures and algorithms
The Word Break III problem involves finding all possible sentences from a string using a given dictionary of words.
Use dynamic programming to build solutions incrementally.
Maintain a list of valid sentences as you explore combinations.
Example: For s = 'leetcode' and dict = ['leet', 'code'], output = ['leet code'].
Consider edge cases like empty strings or dictionaries.
Apache Cassandra is a persistent in-memory key-value store optimized for write-heavy workloads using SSTables and compaction.
Apache Cassandra is a popular choice for write-heavy workloads due to its distributed architecture and support for SSTables.
SSTables (Sorted String Tables) are used to store data on disk in a sorted manner, allowing for efficient read and write operations.
Compaction in Apache Cassandra helps to m...
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
2 DSA questions were asked. they were of easy-medium difficulty.
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
Developed a web-based project management tool for tracking tasks and deadlines.
Used AngularJS for front-end development
Implemented RESTful APIs for backend using Node.js
Utilized MongoDB for database storage
I applied via LinkedIn and was interviewed in Nov 2023. There were 6 interview rounds.
Round 1 was hackerrank test which had 2 questions.
Round 2 was onsite code pair round where in we have to solve 2 questions on dsa
This was similar to 2nd round
Top trending discussions
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
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.
Some of the top questions asked at the Salesforce Mts Software Engineer interview -
based on 9 interview experiences
Difficulty level
Duration
based on 11 reviews
Rating in categories
Hyderabad / Secunderabad,
Bangalore / Bengaluru
9-14 Yrs
Not Disclosed
Technical Support Engineer
958
salaries
| ₹14.3 L/yr - ₹26 L/yr |
Technical Consultant
430
salaries
| ₹17.6 L/yr - ₹29.8 L/yr |
Member Technical Staff
348
salaries
| ₹31.5 L/yr - ₹57.3 L/yr |
Senior Technical Consultant
338
salaries
| ₹26.9 L/yr - ₹46.2 L/yr |
Senior Member of Technical Staff
317
salaries
| ₹48 L/yr - ₹87.3 L/yr |
SAP
Zoho
Oracle
Adobe