Skip to content

Only Code

Eat Code Sleep – repeat

  • Home
  • Arrays
  • Linked Lists
  • Trees
  • Stacks
  • Queues
  • Heaps
  • Graphs
  • Algorithms
    • Sorting
    • Dynamic Programming
    • Divide and Conquer
    • Backtracking & Recursion
    • Greedy approach
    • Breadth First Search (BFS)
    • Depth First Search (DFS)

Only Code

Eat Code Sleep – repeat

Close menu
  • Home
  • Arrays
  • Linked Lists
  • Trees
  • Stacks
  • Queues
  • Heaps
  • Graphs
  • Algorithms
    • Sorting
    • Dynamic Programming
    • Divide and Conquer
    • Backtracking & Recursion
    • Greedy approach
    • Breadth First Search (BFS)
    • Depth First Search (DFS)

Only Code

Eat Code Sleep – repeat

Search Toggle menu

Category: Algorithms

Coin Change II – LeetCode Solution [Medium]

You are given an integer array coins representing coins and an integer amount. Return the number of combinations that make up that amount.

Arrays, Competitive Programming, Dynamic Programming

Coin Change – LeetCode Solution [Medium]

You are given an integer vector coins[n] representing coins of different denominations and an integer amount representing a total amount of money.

Arrays, Competitive Programming, Dynamic Programming

Reservoir Sampling

Reservoir sampling is a category of randomised algorithms for choosing a simple random sample, without replacement, of k items

Algorithms, Interview Questions, Mathematics

Floyd-Warshall Algorithm Implementation | All pairs shortest path

Floyd-Warshall algorithm helps in finding the shortest path between all pairs of vertices in a graph.

Algorithms, Dynamic Programming, Graphs

Binary Search Time Complexity Analysis

Since, at each step the size of the (searchable) array is reduced to half (1/2), we could write the following recurrence relation for the Binary Search Algorithm

Algorithms, Divide and Conquer

Binary Search Explained | LeetCode Solution

Binary Search is a divide and conquer algorithm that finds a particular element within a sorted array or a given integer range.

Algorithms, Competitive Programming, Divide and Conquer

Custom Comparators in C++

Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).

C/C++, Competitive Programming, Sorting

Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question

Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.

Arrays, Greedy approach, Interview Questions

Tower of Hanoi | Recursion using Mathematical Induction

The Tower of Hanoi is a mathematical puzzle (game) consisting of three rods and a number of disks.
The objective of the puzzle is to move all the disks from the first rod (A) to the next rod (B) using the auxiliary rod (C).

Backtracking & Recursion

Lucy and Flowers | HackerRank Solution [Medium]

The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.

Competitive Programming, Dynamic Programming, Mathematics

Posts navigation

1 2 … 6 >
  • Algorithms
  • Arrays
  • Backtracking & Recursion
  • Breadth First Search (BFS)
  • C/C++
  • Competitive Programming
  • Databases
  • Depth First Search (DFS)
  • Divide and Conquer
  • Dynamic Programming
  • Graphs
  • Greedy approach
  • Hashmaps
  • Heaps
  • Interview Questions
  • Java
  • Linked Lists
  • Machine Learning
  • Mathematics
  • Networking
  • Python
  • Queues
  • Sorting
  • Special Data Structures
  • Stacks
  • Trees
  • Web Development
© 2023 Only Code.