How to Start Competitive Programming?

If you are beginning competitive programming and want complete information upon how to start and how? You are at right place.

Welcome to the league, you are on right path!

Choose a Language

The first step is to choose a programming language. The choice of programming language varies from person to person. The most popular nowadays are –

1. 1. Python

2. 2. C++

3. 3. Java

If you want to learn Data Science or Machine Learning in Future, you can go for Python. If you are looking to build career in Android development, the best choice would be Java. Java is the most demandable language in terms of android or complex softwares development. It would be the best decision to choose Java as your programming language.

C++ is the widely used programming language, it is lighter than Java and the runtime is less. Developers recommend C++ for competitive programming because of its simplicity and inbuilt libraries, simple syntax. It depends upon individual requirements, which language should you choose.

Learn Basics

For learning any programming language, first you need to learn syntax, and fundamentals of the chosen programming language. The websites for learning fundamentals are –

1. W3Schools

2. GeeksForGeeks

3. Programiz

4. FreeCodeCamp

Some YouTube channels for learning are –

1. 1. FreecodeCamp

2. 2. TraversyMedia

3. 3. ProgrammingWithMosh

Choose Platform

Now when you have learned the fundamentals of programming language, its time to get hands dirty with competitive programming, and heart of competitive programming i.e data structures.

Some of the best platforms are-

1. HackerRank

2. HackerEarth

3. LeetCode

Once you are comfortable with coding, join codechef and codeforces, and take part in contests and challenges.

Comments

List of Questions asked by Morgan Stanley

Coding Questions - 1. . Exchange kth node from start and kth node from end of a singly linked list. 2. Given a number, you have to find next greater number which has same set of digits. 3. Given a binary tree, you have to print level order traversal of the tree (left child then right child) but every next level has to be printed in next line. 4. Longest Common Substring 5. Spiral level order traversal 6. Add two linked lists 7. Write a function to find the mirror image of binary tree 8. WAP to find the character which occurred maximum times in the character array 9. Given a 2d matrix find an element in a matrix which is 0 and make the entire row and column to 0 10. Find the minimum element in the rotated array of integers 11. Find highest length substring such that there are equal number of 0’s and 1’sin array of 1’s and 0’s only 12. Given a dictio...

Which is best: LeetCode vs HackerEarth ?

Well, all the platforms almost are same except the interface. That's what I think. To conclude the result, let's compare them through the features they offer. Features of Leetcode - Topic - wise questions Comapny-wise questions Weekly contests Interview Preparation section Discuss section Features of HackerEarth Topic-wise problems Monthly contests Discuss section Hiring Contests Hackathons Earlier, when I started coding in my first year. I was fond of HackerEarth. But when I stoped using hackerearth and shifted to Leetcode, I like it more. It depends upon how much comfortable you are with the interface. But, it can't be denied that Leetcode offer more than HackerEarth. But for the coders who love hackathons, HackerEarth is best for them and for the people looking out for job opportunities. Do share your favorite through comments!

Top Questions asked By Walmart

Discuss in detail what happens when you write a code and compile it. What is multithreading? State any C++ multithreading framework you might have worked with. Explain encapsulation, abstraction, polymorphism. Explain inheritance. What is the Diamond problem? How memory is allocated in C++. What is malloc? Differences from calloc? What is a microprocessor? Explain microservices architecture. Explain normalization and all their forms. Differences between inner and outer joins. DFS vs. BFS What is the heap? Detect a loop in the linked list. If a loop exists, return the start node of the loop. Find the third most frequent element in an array. Finding n next permutations using some specific set of digits given. Find the number of ways of reaching from top left to bottom right of a matrix. Minimum number of jumps to reach end given a number N. print in how many ways it can be represented as N = a+b+c+d , 1< =a< =b< =c< = d; 1<=N< = 5000 given two ...

techSa

Search This Blog