This course focuses on classic coding questions commonly asked in technical interviews. You will practice implementing algorithms for problems such as searching in a matrix, rotating an array, and finding the longest common prefix. Master these algorithms to strengthen your coding skills and excel in technical interviews.
Overview
Syllabus
- Unit 1: Simple Matrix Practice in C#
- Toeplitz Matrix Validation
- Count Integers Less Than Target in a Sorted Matrix
- Find Minimum and Maximum on the Secondary Diagonal of a Matrix
- Find Row Containing Target in Sorted Matrix
- Unit 2: Advanced Array Manipulation Techniques in C#
- Reverse an Array In-Place Without Using Built-in Methods
- Anti-Clockwise Array Rotation in C#
- Shuffle Elements to the End
- Reverse Array In Groups
- Rearrange Array by Moving Middle Half to Front
- Unit 3: Introduction to String Manipulation in C#
- Common Character Sequence Extraction in Strings
- Longest Common Suffix in C#
- Detecting Repeated Substring in a String
- Finding the Largest Common Prefix in Strings
- Efficient Longest Common Prefix Search in C#
- Find the Most Common Substring in a Given String
- Unit 4: Advanced List Manipulation in C#
- Merge Two Sorted Lists
- Merge Two Sorted Lists in Descending Order with Unique Elements
- Remove Common Elements from Two Sorted Lists
- Merge Multiple Sorted Lists into a Single Sorted List
- Unit 5: Simple Sorting Algorithms in C#
- Selection Sort Implementation
- Insertion Sort Algorithm
- QuickSort Implementation in C#
- Implementing Merge Sort Algorithm in C#