Logan, Author at Only Code

Odd Solution | CodeChef

The captain of the ship TITANIC needs to select the crew for the ship. The contestants have to stand in a line. They are given the numbers in the order in which they stand, starting from 1. The captain then removes all the contestants that are standing at an odd position.

Competitive Programming

Count of Maximum Solution

Given an array A of length N, your task is to find the element which repeats in A maximum number of times as well as the corresponding count.

Arrays, Competitive Programming, Hashmaps

Anagram Problem [Hard]

Alansh has several words. For each given word, he wants to find the number of palindromic anagrams of that word.

Competitive Programming, Mathematics

Modular Multiplicative Inverse and Modular Combinatorics (nCr % prime) in C++

In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m.

Competitive Programming, Mathematics

Arranging Cupcakes Solution

On the day of the party, the Chef was over-seeing all the food arrangements as well, ensuring that every item was in its designated position. The host was satisfied with everything except the cupcakes. He noticed they were arranged neatly in the shape of a rectangle. He asks the Chef to make it as square-like as possible.

Competitive Programming, Mathematics

Is Fibo Solution

You are given an integer, N. Write a program to determine if N is an element of the Fibonacci sequence.
The first few elements of the Fibonacci sequence are 0, 1, 1, 2, 3, 5, 8, 13….

Competitive Programming, Mathematics

Stock Buy Sell Maximum Profit Solution

The cost of a stock on each day is given in an array. Each day, you can either buy one share, sell any number of shares that you own, or not make any transaction at all.

Competitive Programming, Interview Questions

Rectangular Game Solution

You are given an infinite 2d grid with the bottom left cell referenced as (1,1). All the cells contain a value of zero initially. Let’s play a game?
The game consists of N steps wherein each step you are given two integers a and b.

Competitive Programming, Mathematics

Hotel Bytelandia Solution

Hotel Bytelandia Solution – A number of guests have made reservations. Each reservation consists of an arrival time, and a departure time

Competitive Programming, Greedy approach

Carvans Solution

You’re given the maximum speed of N cars in the order they entered the long straight segment of the circuit. Each car prefers to move at its maximum speed. If that’s not possible because of the front car being slow, it might have to lower its speed. It still moves at the fastest possible speed while avoiding any collisions.

Competitive Programming, Greedy approach