Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 17, 2024Day 21: Heaps BasicsHeaps are powerful tree-based data structures designed for efficient priority handling, making them indispensable in optimization problems and real-time systems. Today’s exploration focused on understanding the heap property, implementing heaps using...10 likesWeek 3DSA
Tapan Rachchhtapanrachchh.hashnode.dev·Dec 15, 20241792. Maximum Average Pass Ratioclass Solution: def maxAverageRatio(self, classes: List[List[int]], extraStudents: int) -> float: def calcGain(studs, total): return -1 * ((studs + 1) / (total + 1) - studs / total) ratios = [(calcGain(x[0], x[1]), ...Python
Canercanerozdemir.hashnode.dev·Dec 7, 2024C# Özelinde Bellek Yönetimi: Stack ve Heap BellekleriYazılım Mühendisliği’ni en çok meşgul eden konulardan birisi, direkt ya da dolaylı olarak, bellek yönetimi olmuştur. Çünkü yazılım mühendisliğinin en büyük odak noktalarından birisi, yazılan kodların mümkün olduğu kadar optimize ve verimli çalışması ...394 readsC#
Luc Caocaoluc.hashnode.dev·Nov 17, 20249 Things I Regret Not Knowing About Running Java JAR Applications1. Basic Command for Running a JAR File The simplest way to run a JAR file is by using the java -jar command: java -jar myapp.jar This command instructs the Java Virtual Machine (JVM) to execute the JAR file specified (in this case, myapp.jar). 2.Ru...jar file
Dhruvan Naidudhruvan.hashnode.dev·Nov 7, 2024Understanding Memory Allocation in JavaScript: A Comprehensive GuideMemory allocation in JavaScript is a critical aspect of how the language operates under the hood. JavaScript's memory management system involves allocating memory for variables, objects, and functions, and subsequently releasing memory when it is no ...memory-management-in-js
Siddhartha Soxyprogrammer.com·Oct 26, 2024Exploring Memory Management: A .NET Developer's Insights into GolangIntroduction Over a decade ago, as I explored the intricacies of .NET memory allocation, it struck me as intuitive and elegant. The CLR efficiently manages the Managed Heap as a contiguous slice of memory, optimizing garbage collection—a brilliant co...225 readsBackendescape analysis
Alexander Koloboviamaleko.hashnode.dev·Sep 29, 2024Algorithms in Everyday TasksOriginally published on TechBullion. I often hear from front-end developers, that the ability to solve algorithmic problems, which are frequently assessed in interviews, is completely unnecessary for regular developers. They believe the same applies ...55 readstypedarray
Chetan Dattachetan77.hashnode.dev·Sep 18, 2024Heap ImplementationBrief What is heap? A heap is a complete binary tree that follows the heap order property. What is Complete Binary Tree (CBT)? A complete binary tree is a binary tree in which every level is completely filled except for the last level. Nodes are ...Leetcodeheapify
Chetan Dattachetan77.hashnode.dev·Sep 7, 2024Kth Largest Element in an ArrayProblem Given an integer array nums and an integer k, return the k<sup>th</sup> largest element in the array. Note that it is the k<sup>th</sup> largest element in the sorted order, not the kth distinct element. Can you solve it without sorting? (lin...Leetcodekth-largest-element-in-an-array
Saurav Maheshwarixauravww.hashnode.dev·Sep 5, 2024Top Techniques to Identify the K-th Largest ElementGiven an integer array nums and an integer k, return the k-th largest element in the array. Note that it is the k-th largest element in the sorted order, not the k-th distinct element. Example 1: Input: nums = [3,2,1,5,6,4], k = 2 Output: 5 Example ...Data Structures and AlgorithmsDSA
