© 2023 Hashnode
#competitive-programming
Hello friends today I have solved the problem of longest common prefix on the leetcode which is based on the topic strings. In this problem as give below we have to solve the longest common prefix between strings that are present in arrays …
Make sure you have a solid understanding of the BFS algorithm before starting with this post by reading: https://blog.garybricks.com/bfs-and-dfs-beginners-overview-in-c The Mario & Luigi Problem Imagi…
The K-Tree Problem A k-Tree is a unique tree structure where each node has exactly k children nodes, extending infinitely. The tree is weighted, such that each of the k edges stemming from a node carr…
//A Heap is a special Tree-based data structure in which the tree is a complete binary tree./// /* C++ Function to sort an array using insertion sort*/ #include <bits/stdc++.h> using namespace std; void insertionSort(int A[], int size) { in…
Hi everyone it's a humble request that we should not fight over this topic ,but I would like to get people and industry experts views on this topic,please feel free to speak on this topic and also pro…
What is competitive programming ? Competitive programming is a mind sport or a type of programming competition where participants solve algorithmic problems within a fixed time frame. It involves the …
In the world of computer science and programming, there are two major paths that individuals can take: development and competitive coding. Both paths have their own set of advantages and disadvantages…
🔗 Problem Link 🌐 Read On Website(Better Experience) 👉 Read On My Website(Best) 👉 Read On Hashnode 👉 Read On Dev.to 📊 Difficulty Level [x] Easy [ ] Medium [ ] Hard [ ] Expert 💥 B…
1. CF Analytics: The CF Analytics Chrome extension provides additional data about a user's problem-solving performance on the Codeforces profile webpage. It presents the information in three types of …
Problem statement: Cats and a mouse. Two cats and a mouse are at various positions on a line. You will be given their starting positions. Your task is to determine which cat will reach the mouse first, assuming the mouse does not move and t…
