Algorithms
Master fundamental and advanced algorithms essential for technical interviews at top companies. This category covers sorting algorithms, search algorithms, graph algorithms, and optimization techniques that form the foundation of computer science problem-solving.
What You’ll Learn:
Sorting algorithms: Quick sort, merge sort, heap sort
Search techniques: Binary search and variations
Graph algorithms: DFS, BFS, Dijkstra’s, topological sort
Optimization: Dynamic programming, greedy algorithms
Time and space complexity analysis
Difficulty Progression: Start with basic sorting and searching, then progress to graph algorithms and dynamic programming.
Interview Frequency: Extremely high – algorithms appear in 80%+ of technical interviews at Google, Amazon, Facebook, Microsoft, and Apple.
Algorithms, Math Problems, String Manipulation
Print String Permutations
How will you print all permutations of characters in a string?
Algorithms, Dynamic Programming, String Manipulation
Longest palindrome in a string
Write a function to find the longest palindrome in a string.
Algorithms, Dynamic Programming, String Manipulation
Find Longest Palindrome In A String
How will you find out the longest palindrome in a given string.
Algorithms, Data Structures
Check if a Linked list is a Palindrome or Not
Write code that will check if a linked list is a palindrome or not.
Algorithms, Arrays, Data Structures
Right Rotate an array by k elements
An array of elements is given arr arr is of length n Right rotate array by k elements Time complexity
Algorithms, Arrays, Brain Teasers, Data Structures, String Manipulation
Reverse a String
A typical programming interview question is “reverse a string, in place”. if you understand pointers, the solution is simple. even
Algorithms, Brain Teasers, Logic Puzzles
Bumblebee
problem: two trains enter a tunnel 200 miles long (yeah, its a big tunnel) travelling at 100 mph at the
Algorithms, Bit Manipulation, Brain Teasers, String Manipulation
int atoi( char* pStr )
Problem: write the definition for this function without using any built-in functions. if pStr is null, return 0. if pStr
Algorithms, Dynamic Programming, Logic Puzzles, String Manipulation
Palindromes
Problem: this year on October 2, 2001, the date in MMDDYYYY format will be a palindrome (same forwards as backwards).10/02/2001when