Solving Questions in Multiple Languages

This repository showcases solutions to a variety of coding questions across multiple programming languages. Whether you're a beginner looking to learn new languages or an experienced developer seeking different approaches to problem-solving, this collection is for you!

Features

Diverse Languages: Solutions are provided in several popular programming languages, including Python, Java, C++, JavaScript, and more. Variety of Questions: From algorithmic challenges to data structures and basic programming tasks, explore a wide range of questions. Clear Documentation: Each solution includes explanations and comments to help you understand the logic behind the code.

Basic Questions (1-25)

1. Check if a number is even or odd.
2. Find the largest of three numbers.
3. Return the factorial of a number.
4. Reverse a string.
5. Check if a string is a palindrome.
6. Sum all elements in an array.
7. Calculate the nth Fibonacci number.
8. Return the sum of digits of a number.
9. Determine if a number is prime.
10. Sort an array of numbers in ascending order.
11. Convert Celsius to Fahrenheit and vice versa.
12. Generate a multiplication table for a given number.
13. Count the number of vowels in a string.
14. Find the maximum and minimum numbers in an array.
15. Merge two sorted arrays into one sorted array.
16. Remove duplicates from an array.
17. Check if two strings are anagrams.
18. Count the number of occurrences of a character in a string.
19. Find the longest word in a string.
20. Capitalize the first letter of every word in a string.
21. Rotate an array by k positions.
22. Check if a number is a power of two.
23. Find the GCD (Greatest Common Divisor) of two numbers.
24. Convert a binary number to decimal.
25. Check if a given year is a leap year.

Intermediate Questions (26-50)

26. Flatten a nested array.
27. Find the intersection of two arrays.
28. Check if a string has balanced parentheses.
29. Calculate the square root of a number without built-in methods.
30. Find the most frequent element in an array.
31. Find the longest common prefix among an array of strings.
32. Remove all falsy values from an array.
33. Return the number of occurrences of each element in an array.
34. Return the nth largest element in an array.
35. Generate all possible permutations of a string.
36. Implement the Sieve of Eratosthenes for prime numbers.
37. Check if a string contains only unique characters.
38. Implement binary search on a sorted array.
39. Generate Pascal's triangle.
40. Convert a Roman numeral to an integer.
41. Find the longest substring without repeating characters.
42. Merge intervals.
43. Implement the Tower of Hanoi problem.
44. Calculate the number of trailing zeros in the factorial of a number.
45. Check if a number is an Armstrong number.
46. Generate all combinations of well-formed parentheses.
47. Perform matrix multiplication.
48. Find the first non-repeating character in a string.
49. Find the smallest missing positive integer in an array.
50. Find all prime factors of a number.

Advanced Questions (51-75)

51. Solve the N-Queens problem.
52. Find the median of two sorted arrays.
53. Implement a linked list in TypeScript.
54. Find the shortest path in a maze (BFS).
55. Solve the 0/1 Knapsack problem using dynamic programming.
56. Perform depth-first search (DFS) on a graph.
57. Implement a priority queue.
58. Solve the traveling salesman problem using dynamic programming.
59. Serialize and deserialize a binary tree.
60. Find the kth smallest element in a binary search tree.
61. Solve the coin change problem using dynamic programming.
62. Implement merge sort.
63. Implement quicksort in TypeScript.
64. Detect a cycle in a graph.
65. Find the maximum subarray sum using Kadane’s algorithm.
66. Find all possible subsets of an array (power set).
67. Determine if a given Sudoku board is valid.
68. Perform in-order traversal of a binary tree without recursion.
69. Implement a trie (prefix tree) for word search.
70. Perform matrix rotation by 90 degrees.
71. Solve the word break problem using dynamic programming.
72. Find the longest palindromic substring.
73. Check if two binary trees are the same.
74. Solve the minimum edit distance (Levenshtein distance) problem.
75. Solve the regular expression matching problem.

Expert Questions (76-100)

76. Solve the integer partition problem.
77. Solve the sliding window maximum problem.
78. Build a heap from an array.
79. Solve the maximum flow problem using the Ford-Fulkerson algorithm.
80. Implement Dijkstra's algorithm for shortest paths in a graph.
81. Find the articulation points in a graph.
82. Implement the Bellman-Ford algorithm to detect negative weight cycles.
83. Perform topological sort on a directed acyclic graph.
84. Find the diameter of a binary tree.
85. Solve the regular expression wildcard matching problem.
86. Solve the word ladder problem using BFS.
87. Solve the maximum bipartite matching problem.
88. Solve the edit distance problem with memoization.
89. Solve the subset sum problem.
90. Find the longest increasing subsequence.
91. Solve the job scheduling problem.
92. Perform breadth-first search on a binary tree.
93. Solve the Boolean parenthesization problem.
94. Find bridges in a graph.
95. Solve the Hamiltonian path problem.
96. Find the longest path in a directed acyclic graph.
97. Solve the egg drop problem using dynamic programming.
98. Perform randomized quicksort.
99. Solve the painter’s partition problem.
100. Solve the longest common subsequence problem.