Recent Changes - Search:

Oktatás

* Programozás 1
  + feladatsor
  + GitHub oldal

* Szkriptnyelvek
  + feladatsor
  + quick link

Teaching

Programming 1 (BI)
  ▸ exercises
  ▸ quick link

teaching assets


Félévek

* 2025/26/2
* archívum


Linkek

* kalendárium
* tételsorok
* jegyzetek
* szakdolgozat / PhD
* ösztöndíjak
* certificates
* C lang.
* C#
* D lang.
* Java
* Nim
* Nim2
  + exercises
* XC=BASIC
* old
  ✦C++, ✦Clojure, ✦Scala


[ edit | logout ]
[ sandbox | passwd ]

Remove duplicates and keep order

Task: remove duplicates from a seq but keep the original order of the unique elements.

remove duplicates, keep the order
def remove_duplicates_keep_order(li):
    seen = set()
    result = []
    for e in li:
        if e not in seen:
            result.append(e)
            seen.add(e)
        #
    #
    return result


li = ["aa", "bbb", "aa", "cc", "bbb", "cc"]

result = remove_duplicates_keep_order(li)

print(result)  # ['aa', 'bbb', 'cc']
import std/sets


proc removeDuplicatesKeepOrder[T](li: seq[T]): seq[T] =
  var seen: HashSet[T]
  for e in li:
    if e notin seen:
      result.add(e)
      seen.incl(e)

let
  li = @["aa", "bbb", "aa", "cc", "bbb", "cc"]
  result = removeDuplicatesKeepOrder(li)

echo result  # @["aa", "bbb", "cc"]
Cloud City

  

Blogjaim, hobbi projektjeim

* The Ubuntu Incident
* Python Adventures
* @GitHub
* heroku
* extra
* haladó Python
* YouTube listák


Debrecen | la France


[ edit ]

Edit - History - Print *** Report - Recent Changes - Search
Page last modified on 2026 May 22, 22:52