For beginners getting a call for an interview is one of the most exciting experience, but these excitements get flushed once you fail in the initial rounds itself.
- Phone call.
- Initial screening.
- Challenges on any coding website like Hackerrank, Hackerearth, Codechef.
- Onsite Interview.
Of these five rounds, the first two are not so hard as you just need to explain the interviewer your interests, your knowledge, and your capabilities.
But the third round is the gate pass for your onsite interview which can be game-changing, as now it is time to prove that you are truly capable of this role.
Yeah bring it on, I am ready!.😎.
This is what newbie feels sometimes, but hold on your are just going to be surprised 🎁.
You need to solve algorithms with all test cases to be cleared to make through this round (Also some other typical question depending upon the role you are interviewing for).
Don't worry Ant-Man is out from the Quantum realm and He is here to help you 🤷♂️.
Note: This list is for beginners only but others can learn from it too.
Number of subarrays with given sum k.
Find the maximum sum of products of two arrays.
Find the correct position to insert an element in the array.
Program to check if a subarray with 0 sum exits or not.
Print all subarrays with a given sum k in an array.
Left circular rotation on an array of integers.
Right circular rotation on an array of integers.
Given an unsorted array of integers find a pair with given sum in it.
Reverse a string using a stack.
Reverse a string using recursion.
Count all substrings having character k.
Minimum characters to delete to make string anagram.
Check if two string are an anagram of each other.
Converting string to jadencase.
Check if a string has duplicate letters.
Find missing alphabets to make a string panagram.
Count number of sub-string occurrence in a string.
Reverse a stack using recursion.
Sort a stack using another stack.
Program to reverse a queue.
Dutch national flag problem.
Program to add two binary numbers.
Swap two numbers without temp variables.
Absolute difference between diagonals of the matrix.
Program to print all the prime numbers from 1 to 100.
Maximum Collatz sequence under 1000000.
Print all the unique 2 digit combinations of given numbers.
Convert Roman numeral to an integer.
Find the largest prime factor.
Program to check the prime number.
Find all the Armstrong number between two numbers.
Difference between the square of the sum of numbers and sum of the square of numbers.
Form the smallest possible number from the given number.
Find the digital root of a given number.
Find the biggest perfect square in an array.
If you feel this is a helpful resource then please share these with others who are actively interviewing.
Also, follow me on Twitter for tips and tricks to solve the coding interviews and more solved examples of Algorithms. I write 2 - 3 post weekly on my blog learnersbucket.com.