Start your coding interview preparation with easy-level C# problems. This course will help you build a solid foundation by solving common problems like reversing a string, finding the maximum number in a list, and checking for prime numbers. These exercises will enhance your problem-solving skills and boost your confidence for the coding interviews.
Overview
Syllabus
- Unit 1: String Manipulation Fundamentals in C#
- Vowel Positions Finder
- Shift Characters in a String by One
- String Case Transformation Without Built-In Methods
- Replace Character in String Without Built-In Functions
- Swap Adjacent Characters in a String
- Checking for Palindromes Without Built-in Methods in C#
- Unit 2: Basic Array Operations in C# Without Built-in Methods
- Find Minimum Element in an Array Without Built-in Methods
- Counting Even and Odd Integers in an Array
- Counting Minimum Element Occurrences in an Array
- Finding the Second Largest Number Without Built-in Methods
- Unit 3: Standard Math Algorithms in C#
- Perfect Square Detection in C#
- Finding the Next Prime Number in C#
- Prime Factorization in C#
- Check if Two Numbers are Coprime
- Finding the N-th Prime Number using C#
- Unit 4: List Operations Fundamentals in C#
- Finding First Occurrence Index Without Built-in Methods
- Count Unique Elements in a List
- Reverse a List Without Built-in Methods
- Circular List Shifting in C#
- Determining Contiguous Sublist in C#
- Unit 5: Simple Recursion in Practice
- Recursive Sum Calculation
- Generate a List of Integers Using Recursion
- Sum of Digits Raised to Their Positions Using Recursion
- Recursive String Reversal Task
- Fibonacci Sequence Using Recursion in C#