Salesforce is a cloud-based software company that provides customer relationship management (CRM) solutions to businesses of all sizes. The company was founded in 1999 by Marc Benioff, Parker Harris, Dave Moellenhoff, and Frank Dominguez, with a vision to transform the way companies interact with their customers. Salesforce has since grown into a global enterprise, with over 150,000 customers and more than 50,000 employees worldwide.
Salesforce offers a range of cloud-based products, including sales automation, marketing automation, customer service, and analytics. Its flagship product, Sales Cloud, enables companies to manage their sales process, from lead generation to deal closing. Another popular product is Service Cloud, which allows businesses to deliver personalized customer service across multiple channels.
Salesforce is committed to corporate social responsibility and is known for its 1-1-1 model, where the company donates 1% of its product, equity, and employee time to philanthropic causes. This approach has led to Salesforce being recognized as a leader in the tech industry for its social and environmental impact.
Preparing for the Salesforce placement exam can be a challenging task, but with the right guidance, resources, and practice, you can increase your chances of success. Here are some best practices and advice for cracking the Salesforce placement exam:
First and foremost, it is essential to understand the exam pattern and syllabus thoroughly. The Salesforce placement exam typically includes multiple-choice questions, and the topics covered include data management, security, automation, customization, and integration. Reviewing the syllabus and exam pattern will give you a clear idea of what to expect and help you prepare accordingly.
One of the best ways to prepare for the Salesforce placement exam is to practice with sample questions and mock tests. There are several resources available online that provide practice questions and mock tests, which can help you assess your knowledge and identify areas where you need to focus more.
It is also crucial to have a strong understanding of the Salesforce platform and its products, including Sales Cloud, Service Cloud, Marketing Cloud, and others. Salesforce offers several free online courses, including the Trailhead program, which can help you gain the necessary knowledge and skills to excel in the placement exam.
When it comes to cracking the interview, it is essential to demonstrate your problem-solving abilities and communication skills. Be prepared to answer questions related to your technical expertise, experience working on Salesforce projects, and your ability to work in a team.
Here you will get all the information related to the placement exam conducted by Salesforce.
Working for Salesforce offers a multitude of benefits that go beyond just a work experience. The company has consistently been recognized as one of the best places to work, and for good reason. Here are some of the top benefits of working for Salesforce:
Overall, working for Salesforce provides employees with a challenging and rewarding experience, with opportunities for personal and professional growth, generous benefits, and a commitment to social responsibility.
Applicants must have a Bachelor's degree in Engineering (B.E./B. Tech) in Computer Science, Electrical, Electronics or an equivalent discipline with specialization in Computer Science. Additionally, only those students who have graduated in the year 2023 will be considered for this opportunity.
Candidates should have a minimum of 70% or a 7.0 CGPA and above in their undergraduate program to be eligible to apply for this position. This requirement is to ensure that applicants have a strong academic foundation and are well-equipped to handle the challenges of the position.
Candidates who meet the above qualifications and are interested in pursuing a career in this field are encouraged to apply. This opportunity offers a chance to work in a dynamic and challenging environment with opportunities for growth and development.
Applicants must prepare the following topics and any additional topics mentioned in the examination notification.
Object-Oriented Programming and Design
Java, C++, or Python
Working Knowledge of Web Technologies
Database management systems
Strong Knowledge of Java, JavaScript, and Associated Frameworks
Strong Data Structure, OOPs, and Algorithmic Skills
#Win over the Demon
You enter an abandoned castle in search of treasure and as you are in the chamber of treasure a demon appears with it's children and wants to play a game with you. You are given N cards and demon has M children. Each of the N cards has an integer written on it. Now demon asks you to close your eyes and choose a subset of them. It then sums the number written on chosen cards, takes its absolute value and give you those many chocolates.
You are free to leave the abandoned castle with treasure if you can share the chocolates equally to each child else you will be killed. As a first step to calculate the probability of winning , you would like to know the number of different subsets which make you win.
Please note each card is unique and there can be multiple cards with the same integer value on them.
#Input
```sh
First line of input contains integer N and next N lines are numbers on cards. Next line of input contains an integer Q which denotes the number of queries to be answered, and next Q lines are numbers of chilren for each query.
```
#Output (Q lines)
```sh
For each query output the required Answer modulo 10^9+9 in a new line.
```
#Constraints
```
1 <=N <= 100000
1 <=Q<=10
1 <= M<= 100
-1e9 <= Integer in card <= 1e9
```
#Win over the Demon
You enter an abandoned castle in search of treasure and as you are in the chamber of treasure a demon appears with it's children and wants to play a game with you. You are given N cards and demon has M children. Each of the N cards has an integer written on it. Now demon asks you to close your eyes and choose a subset of them. It then sums the number written on chosen cards, takes its absolute value and give you those many chocolates.
You are free to leave the abandoned castle with treasure if you can share the chocolates equally to each child else you will be killed. As a first step to calculate the probability of winning , you would like to know the number of different subsets which make you win.
Please note each card is unique and there can be multiple cards with the same integer value on them.
#Input
```sh
First line of input contains integer N and next N lines are numbers on cards. Next line of input contains an integer Q which denotes the number of queries to be answered, and next Q lines are numbers of chilren for each query.
```
#Output (Q lines)
```sh
For each query output the required Answer modulo 10^9+9 in a new line.
```
#Constraints
```
1 <=N <= 100000
1 <=Q<=10
1 <= M<= 100
-1e9 <= Integer in card <= 1e9
```
Edyst's training style completely resonated with me. I approached programming as more than a subject. Thanks to Edyst team for the guidance!
I started practising on Edyst platform since my 3rd year of college focused on placements & always liked the way they helped us when we were stuck at a particular problem.
Thank you, Edyst for all the assistance and amazing support!
When I joined the Edyst courses I received personalized mentoring on how to crack coding rounds of different companies. Through a combination of coding skills and great projects, I received multiple offers above 6+ lakhs per annum. Finally I joined for 8+ Lakhs package. Thanks for all the support, from Edyst Team.
Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.
#Win over the Demon
You enter an abandoned castle in search of treasure and as you are in the chamber of treasure a demon appears with it's children and wants to play a game with you. You are given N cards and demon has M children. Each of the N cards has an integer written on it. Now demon asks you to close your eyes and choose a subset of them. It then sums the number written on chosen cards, takes its absolute value and give you those many chocolates.
You are free to leave the abandoned castle with treasure if you can share the chocolates equally to each child else you will be killed. As a first step to calculate the probability of winning , you would like to know the number of different subsets which make you win.
Please note each card is unique and there can be multiple cards with the same integer value on them.
#Input
```sh
First line of input contains integer N and next N lines are numbers on cards. Next line of input contains an integer Q which denotes the number of queries to be answered, and next Q lines are numbers of chilren for each query.
```
#Output (Q lines)
```sh
For each query output the required Answer modulo 10^9+9 in a new line.
```
#Constraints
```
1 <=N <= 100000
1 <=Q<=10
1 <= M<= 100
-1e9 <= Integer in card <= 1e9
```