Skip to content

This codebase is for competitive programming (Problem Solving) exercises with Dart LeetCode and other platforms.

Notifications You must be signed in to change notification settings

AdelDaniel/leetcode-problem-solving-in-dart

Repository files navigation

All Problems

Codewars:

Easy Problems


Leetcode

Easy Problems

Medium Problems

Hard Problems

Topics

  • XOR
  • Binary Search
  • Rotated Sorted Array
  • Palindrome Number
  • Factorial
  • Hash Map (DS)
  • 2 Pointers (Two Pointers)
    • left and right pointers
    • Sliding window
  • Prefix sum &&& Suffix sum
  • Prefix product &&& Suffix product
  • Hash Table (DS)
  • Mark Indices --> By negative value
  • Sliding Window
  • Stack (DS)

Algorithms

  • Greedy Algorithm

Notes:

  • Map In Dart (Hash Map ---- Linked Hash Map ---- Splay Tree Map)

  • Hash Map (Not Ordered) -- Hash Table (Ordered)

  • Hash Table

    A Hash table is defined as a data structure used to insert, look up, and remove key-value pairs quickly. It operates on the hashing concept, where each key is translated by a hash function into a distinct index in an array. The index functions as a storage location for the matching value. In simple words, it maps the keys with the value.

  • Find Sum of 2 Numbers in sorted List

    1. Brute Force (Bad)
    2. Two Pointers
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy