#
strings
Here are 704 public repositories matching this topic...
A mostly reasonable collection of technical software development interview questions solved in Javascript
-
Updated
Sep 30, 2019
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
-
Updated
Oct 19, 2020 - JavaScript
FireEye Labs Obfuscated String Solver - Automatically extract obfuscated strings from malware.
-
Updated
Oct 26, 2020 - Python
String manipulation, leveled up!
-
Updated
Oct 21, 2020 - PHP
Glue strings to data in R. Small, fast, dependency free interpreted string literals.
-
Updated
Oct 13, 2020 - R
Fast and powerful Swift string scanning made simple
-
Updated
Jan 29, 2020 - Swift
An easy way to dynamically replace Strings of your Android App or provide new languages Over-the-air without needed to publish a new release on Google Play.
-
Updated
Feb 1, 2020 - Kotlin
A machine learning tool that ranks strings based on their relevance for malware analysis.
machine-learning
strings
reverse-engineering
learning-to-rank
malware-analysis
fireeye-flare
fireeye-data-science
-
Updated
Oct 17, 2020 - Python
python
search
c-plus-plus
algorithms
graphs
strings
cracking-the-coding-interview
recursion
sorting-algorithms
arrays
dynamic-programming
trees
stacks
queues
-
Updated
Sep 19, 2020 - C++
String manipulation library for Clojure(Script)
-
Updated
Jul 20, 2020 - JavaScript
aolszowka
commented
Mar 21, 2019
It would be useful if this information (boxed in red) were able to be copy and pasted:
4,086,800 strings, 630,116 unique. 468,564,642 total string bytes, of which 342,442,924 (73.1%) are wasted on duplicates (12.6% of 2,708,496,737 managed heap bytes).
For now I am working around
My implementation of 85+ popular data structures and algorithms and interview questions in Python 3 and C++
python
tree
algorithm
linked-list
datastructures
cpp
graph
strings
matrix
mathematics
bit-manipulation
data-structures
arrays
heap
interview-questions
dynamic-programming
min-heap
max-heap
tries
trie-tree
-
Updated
Oct 5, 2020 - Python
A .NET port of java-string-similarity
algorithms
string
dotnet
distance
strings
jaro-winkler
levenshtein-distance
string-metrics
similarity-measures
cosine-similarity
string-distance
damerau-levenshtein
shingles
lcs-distance
winkler
-
Updated
Oct 7, 2020 - C#
Ex 1 - Run timed quizzes via the command line
-
Updated
Oct 23, 2020 - Go
Inline expression interpolation for Rust.
-
Updated
Sep 9, 2020 - Rust
A collection of useful utility functions
hashing
utility
compression
errors
utilities
string
strings
conversion
concurrency
parallel
decompression
hash
parallelism
conversions
string-manipulation
concurrent
conditions
conditional-statements
condition
conditional
-
Updated
Mar 29, 2020 - Go
-
Updated
Sep 11, 2020 - TypeScript
Localization of the application with ability to change language "on the fly" and support for plural form in any language.
notifications
macos
language
ios
localization
tvos
watchos
cocoapods
carthage
strings
pluralization
swift-package-manager
l10n
language-detection
switch
swift-framework
localized
plist
plural-form
plurals
change-language
stringsdict
languages-contained
preferred-language
-
Updated
Jul 20, 2020 - Swift
Our open source benchmarks and code samples
-
Updated
Oct 26, 2020 - C
elf-strings will programmatically read an ELF binary's string sections within a given binary. This is meant to be much like the strings UNIX utility, however is purpose built for ELF binaries.
-
Updated
Feb 20, 2018 - Go
Study group for algorithms in Ruby, hosted at App Academy
algorithm
compression
a-frame
strings
bloom-filter
bit-manipulation
computation
hash-map
edit-distance
lempel-ziv
huffman-coding
-
Updated
Jan 19, 2016 - Ruby
Improve this page
Add a description, image, and links to the strings topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the strings topic, visit your repo's landing page and select "manage topics."
Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.