Bruno Faganellofaganello.dev.br·Aug 26, 2024Diferenças entre List, VStack e LazyVStackA primeiro momento você deve pensar que a principal diferença entre eles é que normalmente a List é pouco maleável enquanto o VStack e LazyVStack você tem mais possibilidade de customização. O tópico que eu quero trazer aqui é na verdade o tópico sob...Discuss·89 readsSwift
Malavi Pandemalavibolg.hashnode.dev·Aug 21, 2024Understand the recursion without stackFor get about the recursion for some time. Just we recall how the basic function works. def fun(): return 'Malavi Pande' output = fun() print(output) output : Malavi Pande most of the people say to moving forward with recursion one need to und...Discuss·1 likeRecursion
Soyuliasoyulia.hashnode.dev·Aug 19, 2024[백준] 10828번 - 스택💡문제 분석 요약 -- 문제 -- 입력 : 1 ≤ N ≤ 10,000 push X: 정수 X를 스택에 넣는 연산이다. pop: 스택에서 가장 위에 있는 정수를 빼고, 그 수를 출력한다. 만약 스택에 들어있는 정수가 없는 경우에는 -1을 출력한다. size: 스택에 들어있는 정수의 개수를 출력한다. empty: 스택이 비어있으면 1, 아니면 0을 출력한다. top: 스택의 가장 위에 있는 정수를 출력한다. 만약 스택에 들어있는 정수가 ...Discuss#backjoon
Soyuliasoyulia.hashnode.dev·Aug 19, 2024[자료구조] 스택과 큐목표 : 스택 , 큐 개념과 기본 구현 코드에 대해 알아보자. ✏️스택 스택의 데이터 구조 LIFO(Last In First Out) 원칙 : 스택 내부에 마지막에 들어간 요소가 먼저 제거됨. push : 스택 맨 위에 항목을 올리는 것 pop : 스택의 맨 위에서 항목을 제거하는 것 IsEmpty : 스택이 비어있는지 확인 IsFull : 스택이 가득 찼는지 확인 Peek : 최상위 요소를 제거하지 않고 값을 가져옴 Top =...Discussstack
Chetan Dattachetan77.hashnode.dev·Aug 18, 2024LRU CacheDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache. (link) Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the ke...DiscussLeetcodeLRU Cache
Chetan Dattachetan77.hashnode.dev·Aug 17, 2024239. Sliding Window MaximumProblem You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one posi...DiscussLeetcodesliding window maximum
Chetan Dattachetan77.hashnode.dev·Aug 17, 2024735. Asteroid CollisionProblem We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves...DiscussLeetcodeCollision
Chetan Dattachetan77.hashnode.dev·Aug 15, 202484. Largest Rectangle in HistogramGiven an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram. (link) Example 1: Input: heights = [2,1,5,6,2,3] Output: 10 Explanation: The abov...DiscussLeetcodelargest-rectangle-in-histogram
Aman Bahukhandibahukhandi.hashnode.dev·Aug 12, 2024Introduction to Stack in Data Structures and AlgorithmsIntroduction : A stack is a linear data structure. Any operation on the stack is performed in LIFO (Last In First Out) order. This means the element to enter the container last would be the first one to leave the container. It is imperative that elem...Discussstack
Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 12, 2024Stack in JSIntroduction The stack data structure is a sequential collection of elements that follows the principle of Last In First Out (LIFO). The last element inserted into the stack is first element to be removed. A stack of plates. The last plate placed ...DiscussData Structures and Algorithms in JavaScriptDSA
