Scribd
Upload
32 views2 pages

Syllabus of MTE

The document outlines the syllabus for the Advanced Algorithmic Problem Solving course (R1UC601B), detailing various topics to be covered in both lectures and practical sessions. Key topics include prefix sum arrays, equilibrium indices, majority elements, and various algorithms for subarrays and permutations. The syllabus emphasizes both theoretical understanding and practical application of algorithmic concepts.

Uploaded by

Krish Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

Syllabus of MTE

The document outlines the syllabus for the Advanced Algorithmic Problem Solving course (R1UC601B), detailing various topics to be covered in both lectures and practical sessions. Key topics include prefix sum arrays, equilibrium indices, majority elements, and various algorithms for subarrays and permutations. The syllabus emphasizes both theoretical understanding and practical application of algorithmic concepts.

Uploaded by

Krish Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Advanced Algorithmic Problem Solving (R1UC601B)

Syllabus of MTE

SL- Topic for Delivery Theory/


No Practical
Plan
1 Prefix Sum Array: Find the sum of elements in a given range Lecture
[L, R] using a prefix sum array.
2 Equilibrium Index: Find an index in an array such that the sum Lecture
of elements to the left is equal to the sum of elements to the
right.
3 Split Array into Equal Sum Prefix and Suffix: Check if an array Lecture
can be split into two parts such that the sum of the prefix equals
the sum of the suffix.
4 Prefix Sum Array: Find the sum of elements in a given range Practical
[L, R] using a prefix sum array.
Maximum Subarray of Size K: Find the maximum sum of any
subarray of size K.
5 Split Array into Equal Sum Prefix and Suffix: Check if an array Practical
can be split into two parts such that the sum of the prefix equals
the sum of the suffix. Longest Substring Without Repeating
Characters: Find the length of the longest substring without
repeating characters.
6 Find two numbers in a sorted array that add up to a target. Lecture
7 Majority Element: Find the element that appears more than n/2 Lecture
times in an array.
8 Next Permutation: Rearrange numbers into the Lecture
lexicographically next greater permutation.
9 Majority Element: Find the element that appears more than n/2 Practical
times in an array.
Sliding Window Maximum: Find the maximum value in every
window of size K in an array.
10 Next Permutation: Rearrange numbers into the Practical
lexicographically next greater permutation.
Maximum Subarray: Find the contiguous subarray with the
largest sum. (Kadane’s algorithm)
11 Trapping Rainwater: Calculate how much water can be trapped Lecture
between the bars of a histogram.
12 Counting Bits: Count the number of 1s in the binary Lecture
representation of numbers from 0 to n. Power of Two: Check if
a number is a power of two using bit manipulation.
13 Maximum XOR of Two Numbers in an Array: Find the Lecture
maximum XOR of two numbers in an array.
14 Maximum Product Subarray: Find the contiguous subarray with Practical
the largest product. Count Numbers with Unique Digits: Count
all numbers with unique digits for a given number of digits.
15 Trapping Rainwater: Calculate how much water can be trapped Practical
between the bars of a histogram.
16 Longest Palindromic Substring: Find the longest palindromic Lecture
substring in a given string.
17 Longest Common Prefix: Find the longest common prefix Lecture
among a list of strings.

18 Merge two sorted linked lists into one sorted list. Remove N-th Lecture
Node from End of List: Remove the n-th node from the end of a
singly linked list.
19 Palindrome Number: Check if an integer is a palindrome Practical
without converting it to a string.
Longest Common Prefix: Find the longest common prefix
among a list of strings.
20 Intersection of Two Linked Lists: Find the node where two Practical
singly linked lists intersect. Longest Palindromic Substring:
Find the longest palindromic substring in a given string.
21 Implement two stacks in a single array. Next Greater Element: Lecture
Find the next greater element for each element in an array.
22
23 Sliding Window Maximum: Use a deque to find the maximum Lecture
in every sliding window of size k.
24 Find the largest rectangle that can be formed in a histogram. Practical
25
26 Permutations: Generate all permutations of a given array or Lecture
string. Subsets: Generate all subsets of a given array.
27 Combination Sum: Find all unique combinations of numbers Lecture
that sum to a target.
Find the Element with Maximum Frequency: Find the element
that appears most frequently in an array.
28 Median of Two Sorted Arrays: Find the median of two sorted Lecture
arrays. Kth Smallest Element in a Sorted Matrix: Find the k-th
smallest element from the last in a sorted matrix.
29 Permutations: Generate all permutations of a given array or Practical
string. Subsets: Generate all subsets of a given array. Top K
Frequent Elements: Use a priority queue to find the k most
frequent elements.
30 Find the Element with Maximum Frequency: Find the element Practical
that appears most frequently in an array.
Median of Two Sorted Arrays: Find the median of two sorted
arrays using binary search.
31 Two Sum: Find two numbers in an array that add up to a target Lecture
using hashing.
32 Subarray Sum Equals K: Find the number of subarrays with a Lecture
sum equal to k using hashing. Top K Frequent Elements: Find
the k-most frequent elements in an array.

You might also like