In a given array of elements like
[a1, a2, ..., an, b1, b2, ..., bn, <X>1,<X>2, ..., <X>n]
without taking a extra memory swap elements in the array so the outcome will be like
[a1, b1, … <X>1, a2, b2, … <X>2, …, an, bn, …, <X>n] Continue reading
Assume you are given 2 eggs.
You have access to a 100-floors high building
Eggs can break if dropped from the first floor or may not even break if dropped from 100th floor.
Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped from without breaking.
The question is how many drops you need to make. You are allowed to break 2 eggs in the process Continue reading
If you want to check if your linked list is circular you can use Floyd’s Cycle-Finding Algorithm aka Tortoise and the Hare Algorithm.
It’s quite efficient as It has O(n) complexity.
Continue reading
Simple implementation of binary tree in C++ Continue reading
Simple implemetation of 16bit Cyclic Redundancy Check (CRC16) in C++ Continue reading
Simple implementation of Queue with exception handling in C++ using templates Continue reading
Simple implementation of Stack with exception handling in C++ using templates Continue reading
Simple implementation of Two-way linked list in C++ Continue reading
