Index of "Algorithms: Design and Analysis"

Toggle All Sections

From Codility

Course Link: By James Cutajar

1. Binary Gap (Problem of Iterations)
   • Binary Gap (Problem of Iterations)
   • Discussion on "Binary Gap - A problem of iterations"
2. Arrays
   • 2.1: Cyclic rotation (Problem of Arrays)
   • 2.2: Odd occurrences in an array
3. Time Complexity
   • Frog Jump (Level: Easy)
   • Perm Missing Element
   • Tape Equilibrium
     Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|
4. Counting Elements
   • Swap The Elements (A problem on counting elements)
   • Frog River One (A problem of counting elements)
   • Perm Check (A problem of counting elements)
   • Max Counters (a problem on counting elements)
   • Missing Integer: Find the smallest positive integer that does not occur in a given sequence.
5. Prefix Sums
   • Mushroom Picker (A problem on Prefix Sums)
   • Passing Cars (Count the number of passing cars on the road)
   • Div Count (Problem on Prefix Sums)
   • Genomic Range Query: Find the minimal nucleotide from a range of sequence DNA (Medium Complexity)
   • Min Avg Two Slice: Find the minimal average of any slice containing at least two elements. (Complexity: Medium)
6. Sorting
   • Count distinct elements in an array (Complexity: Easy)
   • MaxProductOfThree
     Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).
     Complexity: Easy
   • Triangle formation from three sides (Complexity: Easy)
   • Number of disc intersections (Problem in sorting and searching)
7. Stacks and Queues
   • Brackets (A problem related to Stacks)
   • Voracious Fish (A problem on the concept of Stacks)
   • Manhattan stonewall problem on the concept of Stacks
8. Leader using Boyer-Moore Majority Vote Algo
   • Dominator (a problem on the concept of Leader in Algorithms using Boyer-Moore Majority Vote Algo)
   • EquiLeader (A problem in the concept of Leader in DSA)
9. Maximum Slice Problem (using Kadane's Algo leveraging Dynamic Programming)
   • The Original Maximum Slice Problem
10. Recursion (An Introduction)
    • Permutations of a set of alphabets using JavaScript
    • Combinations of a set of alphabets using JavaScript
    • Bubble Sort (Using Recursion)
    • Building a Tree from a BODMAS Expression
11. Substring in another string (Lesson in Algorithms)

From Hacker Earth

Track: Basic Programming > Input/Output > Basics of Input/Output

Super Easy

1. Discusson about Zoos (Super Easy Problem)
   Track: Basic Programming > Input/Output > Basics of Input/Output
2. Discussion on Split houses (Super Easy Problem)
   Track: Basic Programming > Input/Output > Basics of Input/Output

Easy

1. Discussion about Favourite Singer (Easy Problem)
2. Discussion about Maximum Border (Easy Problem)
3. Discussion on Cost of Balloons (Easy Problem)
4. Discussion on Seven-Segment Display
5. Discussion about 'Ali and Helping innocent people'
6. Discussion About 'Find Product'
7. Discussion on 'Toggle String'
8. Discussion on 'Palindromic Strings'
9. Discussion on 'Count Divisors'

From ChatGPT

Difficulty: 3/10

1. Discussion on "Remove Consecutive Duplicates" Problem
2. Discussion on "Alternating Characters Cleanup - minimum number of deletions required"

Difficulty: 4/10

1. Discussion on "Longest Nice Substring" Problem

Tags: <