Nitishkumarnitishkumar07.hashnode.dev·Jan 18, 2024DAY 3 #coding challengeProblem Statement (Water the plants : Medium) A gallery with plants is divided into n parts, numbered 0, 1, 2, 3, ..., n-1. There are provisions for attaching water sprinklers in every division. A sprinkler with range x at division i can water all di...Discusspodt
Kallol Bairagikallolbairagi.hashnode.dev·Oct 21, 2023#973.K Closest Points to Origin [LeetCode Grind 75 in Java]class Pair implements Comparable<Pair>{ long dist; int i; Pair(long dist , int i){ this.dist = dist; this.i = i; } @Override public int compareTo(Pair other){ //compare based on distance value ...DiscussLeetCode Grind 75 in JavaDSA
Sumit Mazumdarsumitmazumdar.in·Oct 1, 2023Priority Queues Made Easy: Understanding the FundamentalsA priority queue is a type of queue that arranges elements based on their priority values. Elements with higher priority values are typically retrieved before elements with lower priority values. In a priority queue, each element has a priority value...Discusspriority queue
Hemant Besracodeinjava.hashnode.dev·Sep 18, 2023An In-depth Guide to the Queue InterfaceQueue Interface The Queue interface is an integral part of the Java Collections Framework, extending the Collection interface. It serves as a representation of a collection of elements that follow a specific order for processing, adhering to the "fir...Discuss·62 readsCollectionqueue
Ayesha Irshadayeshairshad.hashnode.dev·Aug 15, 2023Heap Sort and Counting Sort: Unveiling Efficient Sorting TechniquesSorting is a fundamental operation in computer science, paving the way for organized data retrieval and analysis. Among the array of sorting algorithms, Heap Sort and Counting Sort stand out for their unique approaches to tackling sorting challenges....Discuss·48 readsSorting Chronicles: Navigating Algorithms Through SeriesHeap sort
Geeky Girlgeekygrl.hashnode.dev·Dec 7, 2022Queue - Data StructureConcept Definition Linear data structure where operations are performed in First In First Out (FIFO) order. FIFO: push_back, pop_front. Time Complexity: Access -> at O(n). Deletion at O(1). Searching -> O(n) Insertion -> O(1) For all implem...Discuss·73 readspriority queue