Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

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

NotificationsYou must be signed in to change notification settings

AdelDaniel/leetcode-problem-solving-in-dart

Repository files navigation

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

[8]ページ先頭

©2009-2025 Movatter.jp