排序
Graph Algorithm – Topological Sorting
Graph Algorithm - Topological Sorting, Graph Algorithms (8 Part Series) 1 Graph Algorithm - Breadth First Search 2 Graph Algorithm - Depth First Search ... 4 more parts... 3 Graph ...
Buy and Sell Stocks-I and II
Buy and Sell Stocks-I and II,Problem link : https://leetcode.com/problems/best-time-to-buy-and-sell-stock/submissions/ Twitter | LinkedIn This is basic array question helps you to ...
Intersection of Two Arrays – II
Intersection of Two Arrays - II,Leet Code Problem Link: https://leetcode.com/problems/intersection-of-two-arrays-ii/ follow: twitter | LinkedIn Method 1: Two-Pointer Approach with ...
Java HashMaps:5 Important things to getting Started
Java HashMaps:5 Important things to getting Started, What is Hashing and What are Java HashMaps? When to use Java HashMaps? Application of HashMaps in DSA Problems? How to Implemen...
Logic Explained: Meeting Scheduler – Leetcode [Java] using Priority Queue
Logic Explained: Meeting Scheduler - Leetcode [Java] using Priority Queue, Follow Me, Shout Out, or Give Thanks! Please this article. a small thing to keep me motivated =) Twitter:...
Implementing Min Heap in Java
Implementing Min Heap in Java,A Min-Heap is a complete binary tree in which the value in each internal node is smaller than or equal to the values in the children of that node. Map...
Data Structure and Algorithms: Linear Search
Data Structure and Algorithms: Linear Search, What is Searching? In Computer Science, searching is 'the process of finding an item with specified properties from a collection of it...
Add One To a Number
Add One To a Number, PROBLEM STATEMENT Given a non-negative number represented as an array of digits, add 1 to the number ( increment the number represented by the digits ). The di...
452. Minimum Number of Arrows to Burst Balloons, Leetcode Medium
452. Minimum Number of Arrows to Burst Balloons, Leetcode Medium, Problem Statement There are some spherical balloons spread in two-dimensional space. For each balloon, provided in...
Implementing Queue with 2 Stacks
Implementing Queue with 2 Stacks,BEGIN: I'm assuming you are familiar with the vocabulary of Stack PUSH = Add to end POP = Get from end Queue ENQUEUE = Add to end DEQUEUE = Return ...
Listas Encadeadas
Listas Encadeadas,Listas encadeadas ou listas ligadas são estruturas lineares para armazenamento de objetos do mesmo tipo. Esses objetos estão ligados uns nos outros através de ...
Lista ou Array? Qual usar?
Lista ou Array? Qual usar?, Memória Array Lista Quando a gente aprende a programar por conta própria, fora de um ambiente acadêmico, entender como as coisas funcionam por trás ...