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'
10. Roy and Profile Picture
11. Life, the Universe, and Everything - Easy Problem

Medium

1. • Number of Steps
   • Discussion on: Number of Steps

---

Track: Basic Programming > Implementation > Basics of Implementation

Super Easy

1. Count the number of occurrences of k in S
2. Zoo creatures - The smallest number of creatures so they can grab each other hands
3. A Special Number - Sum of whose digits is divisible by 4
4. Excursion - Calculate the number of rooms you need to book in the hotel

Easy

1. Find Pairs - Ordered Pairs with condition on difference of element and index
2. Find Pairs - Unordered pairs with Bitwise-XOR condition
3. Rook Attack - Find the position where we should place the rook, where Rook has maximum impact
   Case of mistakes and hallucination by GPT 5.2
4. Largest Number - Find out the largest possible number which can be built from N after removing exactly K digits
5. ASME to SAME - Can you convert s into t
6. Cannibal Characters - You want to minimize the length of the string s
7. Lunch Boxes - Determine the maximum number of schools that can get lunch boxes
8. Erasing an array - minimum number of operations to delete the entire array
9. Minimum moves - reach the destination X, Y

Medium

1. Perfect Cube - Find the count of subarrays whose product of elements is a perfect cube
2. Minimum Operations - You need to make all the elements of the array equal to zero
3. BanquetSplit - Problem on Trees and Bipartite Graphs
4. Special matrix - Determine the sum of all the elements of the matrix

Hard

1. Update the array - Count minimum number of operations required such that 2 given conditions are met (Hard)
   ChatGPT 5.2 could not solve this one

---

Track: Basic Programming > Operators > Basics of Operators

Super Easy

1. Going to office - Minimize the Travel Cost

Hard

1. Let Us Understand Computer - Around the Concept of Division
   ChatGPT 5.2 struggled to solve this. Only produced a partially accepted solution.

---

Track: Basic Programming > Bit Manipulation > Basics of Bit Manipulation

Super Easy

1. Parity-Binary Sort

Easy

1. XOR Pairs (Easy Problem on Bit Manipulation)
2. Range Queries - print the number of integers in the given range which satisfy the above condition
3. Hamming Sort - Sorting based on count of differing bits in the binary representations of two integers

Medium

1. Costliest Data Plan (Medium Complexity Problem on Bit Manipulation)
   ChatGPT 5.3 did not give a very comprehensible / easy to understand answer. So, I had to take help from DeepSeek.
2. Help Alice to find the Parity
   Let X be the number we get by xoring all numbers in the range [L,R] (including L and R). What will be the parity on X?

---

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

Concept-wise

• Problems on Two-Pointer Approach
  • Discussion on 'Palindromic Strings'
    From HackerEarth
  • Sorting Binary Array (0s and 1s Only)
    Inspired from a problem on HackerEarth

Tags: << /span>