Contains all answers for Rajalakshmi college's Digial cafe CS19341-Design and Analysis of Algorithms.
Always try to code on your own and use this for reference purpose only!!!
HAPPY CODING😊

• BASIC

  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5
  • Question 6
  • Question 7
  • Question 8
  • Question 9
  • Question 10

• Basic-01

  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5

• Basic-02

  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5

• Basic-03

  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5

→ Problem 1: Comparing Complexity

→ Problem 2: Finding Complexity using Counter Method

→ Problem 3: Finding Complexity using Counter Method

→ Problem 4: Finding Complexity using Counter Method

→ Problem 5: Finding Complexity using Counter Method

→ Problem 6: Finding Complexity using Counter Method

→ Bubble Sort

→ Add to Array

→ String Matching

→ Print Intersection of 2 sorted arrays

→ Finding Duplicates

→ Pair with Difference

→ Subset Sum Equal

→ Find Words

→ Assignment Problem

→ Greedy-PP1

→ Greedy-PP2

→ Greedy-PP3

→ Greedy-PP4

→ Greedy-PP5

→ Greedy-PP6

→ Number of Zeros in a Given Array

→ Majority Element

→ Finding Floor Value

→ Find An Element in Sorted Matrix

→ Two Elements sum to x

→ Playing with Numbers

→ Longest Common Subsequence

→ Longest non-decreasing Subsequence

→ Playing with chessboard

→ PP-1 Hamiltonian Cycle

→ PP-2 Graph Coloring

→ PP-3 Subset Sum

→ Rabin Karp Algorithm Implementation

→ KMP Algorithm Implementation