TNP Consultants Salesforce Developer Trainee Interview Questions and Answers

This is a case study round, you would be given 3 question out of which you will need to solve any 2.
Two question are algoritm based around designing datastructure and matrix problem
One question will be based om designing Database for a given requirement.

Q1. This is a follow up round after case study,where the interviewer will ask you about perfomance and scalability of questions is case study round. There might be few addition question on improving the soluti...read more
Add your answer

Q1. This is a behaviour round where interviewer will see your fitiness for team. It basically has scenario based question . This is also elimination round
Add your answer

It was moderate one

Hard one

Round duration - 90 Minutes
Round difficulty - Medium

This round happened on the same day as JAM in the afternoon time. A slot of 20 minutes with respective timing was already sent to the selected students. Interview can’t be generalize as anything can happen over there and hence this was exclusively my experience. 
To have a quick judgement about the person, I believe nothing is better than throwing before him/her some puzzles (mathematical/ analytical/ programming problems) and see the approach. I received back-to-back 4 problems after a quick and brief introduction. The coding problems I got were way too easy (just basics: searching & mathematical). The harder part of this round was the puzzles (tricky, mathematical, related to probability). At last, I was asked a question on DBMS and the interviewer asked if I know JAVA.

Q1. 
Search an Element in a Sorted Array
Given a sorted array 'A' of 'N' integers, determine whether a number 'X' exists within this array for a series of queries. For each query, print 1 if 'X' exists in the ...read more
Ans. 
Search for a number in a sorted array and determine its existence for multiple queries.
• Use binary search algorithm to efficiently search for each query integer in the sorted array.

• For each query integer 'X', check if it exists in the array 'A' and output 1 if found, 0 otherwise.

• Ensure the array 'A' is sorted in non-decreasing order to apply binary search effectively.
Answered by AI
Add your answer

Hackerrank online assessment

Case study with a little bit of math for scenario based questions

2 questions of coding with a live interviewer

Behavioral and coding with a senior engineer

Q1. How do you handle conflicts
Ans. 
I handle conflicts by actively listening, seeking common ground, and finding mutually beneficial solutions.
• Actively listen to all parties involved to understand their perspectives

• Seek common ground and areas of agreement to build upon

• Find mutually beneficial solutions that address the concerns of all parties

• Communicate openly and transparently to resolve conflicts effectively
Answered by AI
Add your answer
Q2. What was the most challenging problem you had to solve so far
Ans. 
Developing a real-time data synchronization system across multiple servers
• Designing a scalable architecture to handle high volume of data

• Implementing efficient algorithms for data synchronization

• Handling conflicts and ensuring data consistency

• Testing the system under various load conditions
Answered by AI
Add your answer