# Practice for Cracking Any Coding Interview

• Difficulty Level : Medium
• Last Updated : 10 Oct, 2022

Coding questions in this article are difficulty wise ordered. The idea of this post is to target two types of people.

1. Competitive Programming Preparation (For Ist and IInd Year Students) : It is recommended to finish all questions from all categories except possibly Linked List, Tree and BST. However at least 10 questions from these categories should also be covered. If you have never done competitive programming before, it is strongly recommended to see How to Begin with Competitive Programming first. If you wish to get yourself prepared with a language first, you may first begin C++ Track or Java Track
2. Interview preparation It is recommended to cover all topics. In every topic, you can start from questions according to your comfort level.

The practice system tells you exactly the test case where your code failed. In case you need more clarity about a question, you may use the expected output button to see output for your given input. You can also view successful submissions of others in case you are stuck. To see solutions of others, please click the “All Submissions” button at the bottom of the problem statement.

## Topics

### Mathematical

1. Print the pattern (You only need to write function here)
2. Print table (This is a full code problem. Please see sample codes here before attempting the problem)
3. Series AP
4. Series GP
5. Closest Number
6. Armstrong Numbers
7. Sum of digits of a number
8. Reverse digits
9. Print the Kth Digit
10. Binary number to decimal number
11. Jumping Numbers
12. GCD of two numbers
13. LCM of two numbers
15. GCD of array
16. Factorial of a number
17. Compute nPr
18. Compute nCr
19. Largest prime factor
20. Perfect Numbers
21. Pair cube count
22. Find Nth root of M
23. Prime Number
24. Sieve of Eratosthenes
25. Sum of all prime numbers between 1 and N.
26. Pairs of prime numbers

Related Learning Resources : Mathematical Algorithms and Number Theory

### Arrays

Related Learning Resources : Array Data Structure

### String

Related Learning Resources : String Data Structure

### Searching

Related Learning Resources : Searching Algorithms

### Sorting

Related Learning Resources : Sorting Algorithms

### Hashing

Related Learning Resources : Hashing Data Structure

### Matrix

Related Learning Resources : Matrix Data Structure

### Recursion

Related Learning Resources : Recursion

### Divide & Conquer

Related Learning Resources : Divide and Conquer Algorithms

Related Learning Resources : Linked List Data Structure

### Stack

Related Learning Resources : Stack Data Structure

### Queue and Dequeue

Related Learning Resources : Queue Data Structure

### Prefix Sum and Sliding Window

Related Learning Resources : Prefix Sum and Sliding Window

### Bit Magic

Related Learning Resources : Bit Magic

### Tree

Related Learning Resources : Tree Data Structure

### Binary Search Tree

Related Learning Resources : Binary Search Tree

### Heap

Related Learning Resources : Heap Data Structure

### Graph

Related Learning Resources : Graph Data Structure

### Greedy Algorithms

Related Learning Resources : Greedy Algorithms

### Dynamic Programming

Related Learning Resources : Dynamic Programming

### Backtracking

Related Learning Resources : Backtracking

### Trie

Related Learning Resources : Trie Data Structure

### Misc Questions to test your overall learning

1. Sudo Placement : For companies like Amazon, Microsoft, Adobe, .., etc
2. Sudo Placement 2 : For companies like TCS, Infosys, Wipro, Cognizant, .. etc
3. Aptitude questions asked in round 1 : Placements Course designed for this purpose.
4. MCQs asked from different computer science subjects : Subject-Wise Quizzes
5. Interview theory and coding questions of all companies : Company wise all practice questions.
6. Interview experiences of all companies : Interview corner.
7. Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
8. Must Do Coding Questions Company-wise

Don’t forget to check out the courses mentioned below: