100 Coding Questions
100 Coding Questions
1. Palindrome Check
2. Fibonacci Series
3. Array Rota0on
4. Prime Number Check
5. Binary to Decimal Conversion
6. Reverse a String
7. Matrix Mul0plica0on
8. Armstrong Number Check
9. Bubble Sort
10. Factorial Calcula0on
11. Check for Anagrams
12. Largest Element in an Array
13. String Permuta0ons
14. Count Occurrences of a Character in a String
15. Find the Missing Number in an Array
16. Check if Two Strings are Anagrams
17. Reverse a Sentence
18. Remove Duplicates from an Array
19. Check if a String is a Pangram
20. Merge Two Sorted Arrays
21. Find the Second Largest Element in an Array
22. Check if a String is a Palindrome Permuta0on
23. Remove Duplicate Characters from a String
24. Find the Maximum Subarray Sum
25. Check if a Number is a Perfect Square
26. Reverse a Linked List
27. Find the Common Elements in Two Arrays
28. Find the Longest Palindromic Substring
29. Count the Number of Words in a String
30. Check if a Number is a Prime Palindrome
31. Implement a Stack using an Array
32. Find the Median of Two Sorted Arrays
33. Check if a String is a Valid Parentheses Expression
34. Implement a Queue using Linked List
35. Count the Number of Vowels in a String
36. Find the Smallest Missing Posi0ve Integer in an Array
37. Implement a Binary Search Tree
38. Check if a Number is a Perfect Number
39. Find the Kth Smallest Element in an Array
40. Reverse a Doubly Linked List
41. Implement a Priority Queue using a Min-Heap
42. Check if a String is an Isogram
43. Calculate the Power of a Number
44. Implement Depth First Search (DFS)
45. Find the Longest Common Subsequence
46. Convert a Decimal Number to Binary
47. Implement Breadth First Search (BFS)
48. Calculate the GCD (Greatest Common Divisor) of Two Numbers
49. Find the Intersec0on of Two Linked Lists
50. Check if a Number is a Strong Number
51. Convert a Decimal Number to Roman Numeral
52. Find the Nth Fibonacci Number
53. Check if a Number is a Perfect Square using Binary Search
54. Implement a Hash Table
55. Find the Minimum Element in a Rotated Sorted Array
56. Check if a String is a Valid Palindrome
57. Calculate the LCM (Least Common Mul0ple) of Two Numbers
58. Find the Longest Increasing Subsequence
59. Check if a Binary Tree is a Binary Search Tree
60. Sort an Array of 0s, 1s, and 2s (Dutch Na0onal Flag Problem)
61. Implement an AVL Tree
62. Find the Maximum Depth of a Binary Tree
63. Check if a Number is a Happy Number
64. Calculate the Factorial of a Number using Recursion
65. Find the Maximum Product Subarray
66. Check if a Linked List is a Palindrome
67. Implement a Graph using Adjacency List
68. Find the Majority Element in an Array
69. Check if a Number is a Harshad Number
70. Implement Quick Sort
71. Find the Nth Node from the End of a Linked List
72. Check if a Number is a Strong Harshad Number
73. Calculate the Number of Ways to Reach a Staircase
74. Implement Merge Sort
75. Find the Longest Palindromic Subsequence
76. Check if a Number is an Automorphic Number
77. Implement a Circular Queue
78. Find the Maximum Profit by Buying and Selling Stocks
79. Check if a String is a Valid Shuffle of Two Strings
80. Calculate the Sum of Digits using Recursion
81. Implement Dijkstra's Algorithm
82. Find the Next Permuta0on of a Number
83. Check if a Sudoku Board is Valid
84. Calculate the Square Root of a Number using Binary Search
85. Implement a Trie (Prefix Tree)
86. Find the Smallest Subarray with a Given Sum
87. Check if a Number is a Duck Number
88. Implement a Red-Black Tree
89. Find the Intersec0on Point of Two Linked Lists
90. Check if a Number is a Pronic Number
91. Calculate the Area of a Polygon
92. Implement a Stack using Linked List
93. Find the Longest Common Prefix of an Array of Strings
94. Check if a Number is a Palindrome Number
95. Calculate the Sum of Digits of a Number without Recursion
96. Implement a Queue using an Array
97. Find the Maximum XOR Subarray
98. Check if a Number is a Disarium Number
99. Calculate the Area of a Circle
100. Implement an LRU Cache