Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

lot of typos detected in the repository #1

Open
Arsenic-ATG opened this issue Mar 2, 2023 · 0 comments · May be fixed by #2
Open

lot of typos detected in the repository #1

Arsenic-ATG opened this issue Mar 2, 2023 · 0 comments · May be fixed by #2

Comments

@Arsenic-ATG
Copy link

This is the list of typos that were found in your repository by codespell

./link.txt:13: awsome ==> awesome
./Database/Structure Query Language/0011_Logical.sql:12: oposite ==> opposite
./Database/Structure Query Language/0013_Constraints.sql:50: excedeed ==> exceeded
./Database/Structure Query Language/0013_Constraints.sql:55: constrints ==> constraints
./Database/Structure Query Language/0014_Upadate.sql:1: carefull ==> careful, carefully
./Database/Structure Query Language/Basic.txt:3: Datbase ==> Database
./Database/Structure Query Language/0023_VIEW.sql:1: carefull ==> careful, carefully
./Database/Structure Query Language/0007_Order_By.sql:1: nessary ==> necessary
./Database/Structure Query Language/0017_Alter.sql:7: constrints ==> constraints
./Documentation/Closure/001_example.js:23: acecess ==> access
./Documentation/Closure/001_example.js:29: funciton ==> function
./Documentation/Anonymous Function/README.md:1: lanuage ==> language
./C++/c_string+=.cpp:1: varibale ==> variable
./C++/Basics/Union.cpp:11: actullay ==> actually
./C++/Basics/static_variable.cpp:2: initilized ==> initialized
./C++/Basics/static_variable.cpp:19: visiable ==> visible
./C++/Basics/static_variable.cpp:27: visiable ==> visible
./C++/Basics/ternary_operator.cpp:4: actully ==> actually
./C++/Basics/ternary_operator.cpp:5: beacuse ==> because
./C++/Basics/mutable.cpp:2: somwhow ==> somehow
./C++/Basics/mutable.cpp:22: heigh ==> height, high
./C++/Basics/Templete(Generics).cpp:1: templete ==> template
./C++/Basics/Templete(Generics).cpp:2: implment ==> implement
./C++/Basics/Templete(Generics).cpp:2: templete ==> template
./C++/Basics/Templete(Generics).cpp:15: templete ==> template
./C++/Basics/Templete(Generics).cpp:16: templete ==> template
./C++/Basics/Templete(Generics).cpp:37: templete ==> template
./C++/Basics/Templete(Generics).cpp:38: templete ==> template
./C++/Basics/new.cpp:2: memmory ==> memory
./C++/Basics/new.cpp:18: interger ==> integer
./C++/Basics/new.cpp:18: interger ==> integer
./C++/Basics/smart_pointer.cpp:26: cann't ==> can't
./C++/Basics/ranged_based_foorLoop.cpp:15: direcly ==> directly
./C++/Basics/ranged_based_foorLoop.cpp:21: normall ==> normal, normally
./C++/Basics/enum.cpp:8: defaule ==> default
./C++/Basics/Lamda.cpp:17: lamda ==> lambda
./C++/Basics/Lamda.cpp:18: lamda ==> lambda
./C++/Basics/Lamda.cpp:22: lamda ==> lambda
./C++/Basics/const.cpp:8: intialize ==> initialize
./C++/Basics/Casting/103_DynamicCasting.cpp:2: actullay ==> actually
./C++/Basics/Casting/103_DynamicCasting.cpp:9: happend ==> happened, happens, happen
./C++/Basics/Casting/103_DynamicCasting.cpp:25: becase ==> because
./C++/Basics/Casting/103_DynamicCasting.cpp:57: successfull ==> successful
./C++/Object Oriented Programming/1116B. Inheritance(type).cpp:20: inhertance ==> inheritance
./C++/Object Oriented Programming/1118. Interface(pure_virual_function).cpp:17: mathod ==> method
./C++/Object Oriented Programming/1125. Copy_constructor.cpp:4: construtor ==> constructor
./C++/Object Oriented Programming/1125. Copy_constructor.cpp:5: defaul ==> default
./C++/Object Oriented Programming/1125. Copy_constructor.cpp:7: defualt ==> default
./C++/Object Oriented Programming/1124. this.cpp:6: avaiable ==> available
./C++/Object Oriented Programming/1112. Constructor.cpp:28: defintion ==> definition
./C++/Object Oriented Programming/1117. Vitual_Function.cpp:37: overriden ==> overridden
./C++/Object Oriented Programming/1117. Vitual_Function.cpp:39: overriden ==> overridden
./C++/Object Oriented Programming/1117. Vitual_Function.cpp:44: overriden ==> overridden
./C++/Object Oriented Programming/1117. Vitual_Function.cpp:45: overriden ==> overridden
./C++/Object Oriented Programming/1122. Explicit_constructor.cpp:26: actullay ==> actually
./C++/Object Oriented Programming/1122. Explicit_constructor.cpp:28: remeber ==> remember
./C++/Object Oriented Programming/1123. Operator_Overloading.cpp:19: opeartor ==> operator
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:8: avaiable ==> available
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:15: avaiable ==> available
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:24: avaiable ==> available
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:35: accessable ==> accessible
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:39: accessable ==> accessible
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:47: accessable ==> accessible
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:58: accessable ==> accessible
./C++/Object Oriented Programming/1116. Inheritance(access_mode).cpp:67: accessable ==> accessible
./C++/Object Oriented Programming/1122A_Method_Overloading.cpp:17: paramter ==> parameter
./C++/Object Oriented Programming/1114. Static.cpp:29: intialization ==> initialization
./C++/Object Oriented Programming/1114. Static.cpp:32: explaination ==> explanation
./C++/Object Oriented Programming/1120. Member Initializer.cpp:1: initilize ==> initialize
./C++/Object Oriented Programming/1120. Member Initializer.cpp:2: assignement ==> assignment
./C++/Object Oriented Programming/1120. Member Initializer.cpp:14: variabel ==> variable
./C++/Object Oriented Programming/1126. Virtual_destructor.cpp:14: desctructor ==> destructor
./C++/Object Oriented Programming/code_example/inheritance_multipleArguments_&_parentConstructor.cpp:1: realted ==> related
./C++/Problems/operator overload & implitcit conversion.cpp:18: Overloded ==> Overloaded
./C++/Problems/operator overload & implitcit conversion.cpp:19: explaination ==> explanation
./C++/Problems/Object_instantiation_type.cpp:1: intialize ==> initialize
./C++/Problems/Object_instantiation_type.cpp:3: explaination ==> explanation
./C++/Problems/Object_instantiation_type.cpp:19: construtor ==> constructor
./C++/Style/use_1DArray_instead_of_2DArray.cpp:1: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:1: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:2: beacuse ==> because
./C++/Style/use_1DArray_instead_of_2DArray.cpp:2: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:14: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:32: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:33: dimentional ==> dimensional
./C++/Style/use_1DArray_instead_of_2DArray.cpp:36: contigous ==> contiguous
./C++/Style/stack_based_heap_allocation.cpp:4: memmory ==> memory
./C++/Style/return_multiple_values.cpp:14: addreess ==> address
./C++/Style/return_multiple_values.cpp:35: strcuture ==> structure
./C++/Style/vector_construct_vs_push_back.cpp:1: explaination ==> explanation
./C++/STL/1112_Vector.cpp:6: actullay ==> actually
./C++/STL/1112_Vector.cpp:8: beacuse ==> because
./C++/Container/0002_Vector/0002_reserve.cpp:7: performace ==> performance
./C++/Pointer/smart_pointer.cpp:26: cann't ==> can't
./C++/Pointer/string_pointer_traverse.cpp:9: arithmatic ==> arithmetic
./C++/Pointer/string_pointer_traverse.cpp:9: tha ==> than, that, the
./Python/Basic/0006_for_loop.py:2: paramter ==> parameter
./Python/Basic/0006_for_loop.py:3: paramter ==> parameter
./Python/Basic/0006_for_loop.py:3: paramter ==> parameter
./Python/Basic/0006_for_loop.py:5: funciton ==> function
./Python/Basic/type_conversion.py:7: convertion ==> conversion
./Python/Basic/type_conversion.py:8: interger ==> integer
./Python/Basic/function.py:4: funciton ==> function
./Python/Basic/function.py:6: indendation ==> indentation
./Python/Basic/function.py:14: mutiple ==> multiple
./Python/Basic/00011_print.py:7: contens ==> contents, contains
./Security/Cryptography/Hash/README.md:3: teminal ==> terminal
./Security/Cryptography/Hash/README.md:14: consistant ==> consistent
./Data Structure/need_to_implement.txt:1: chache ==> cache
./Data Structure/Tree/Generic Tree/README.md:1: similary ==> similarly
./Data Structure/Tree/Generic Tree/README.md:11: contruct ==> construct
./Data Structure/Tree/Generic Tree/Level order(breath first) traversal/breadth_first_search (vector).cpp:1: vedio ==> video
./Data Structure/Tree/Generic Tree/Height/height(bfs).cpp:1: vedio ==> video
./Data Structure/Tree/Generic Tree/Height/height(recursion).cpp:5: beacuse ==> because
./Data Structure/Tree/Generic Tree/Height/height(recursion).cpp:9: hieght ==> height
./Data Structure/Tree/Generic Tree/Height/height(recursion).cpp:49: lastest ==> latest, last
./Data Structure/Tree/Binary tree/Binary_tree.cpp:17: fron ==> from, front
./Data Structure/Tree/Binary tree/Adjacent Next/Adjacent_Next(soi).cpp:48: thats ==> that's
./Data Structure/Tree/Binary tree/Adjacent Next/Adjacent_Next(soi).cpp:151: currrent ==> current
./Data Structure/Tree/Binary tree/Adjacent Next/Adjacent_Next(soi).cpp:158: currrent ==> current
./Data Structure/Tree/Binary tree/RangeSearch/RangeSearch.cpp:92: currrent ==> current
./Data Structure/Tree/Binary tree/RangeSearch/RangeSearch.cpp:100: currrent ==> current
./Data Structure/Tree/Binary tree/RangeSearch/Range Search(vector).cpp:90: currrent ==> current
./Data Structure/Tree/Binary tree/RangeSearch/Range Search(vector).cpp:97: currrent ==> current
./Data Structure/Tree/Binary search tree/_treeSize.cpp:8: recursivly ==> recursively
./Data Structure/Tree/Binary search tree/Detele/Delete.cpp:14: neccessary ==> necessary
./Data Structure/Tree/Binary search tree/Detele/Delete.cpp:36: postion ==> position
./Data Structure/Tree/Binary search tree/Adjacent Next/Adjacent_Next or Inorder_Successor(soi).cpp:42: thats ==> that's
./Data Structure/Tree/Binary search tree/Adjacent Next/Adjacent_Next or Inorder_Successor(soi).cpp:143: currrent ==> current
./Data Structure/Tree/Binary search tree/Adjacent Next/Adjacent_Next or Inorder_Successor(soi).cpp:150: currrent ==> current
./Data Structure/Tree/Binary search tree/Merge/merge_two_tree(geek_for_geek_methods).cpp:2: poistion ==> position
./Data Structure/Tree/Binary search tree/Merge/merge_two_tree(geek_for_geek_methods).cpp:25: postion ==> position
./Data Structure/Tree/Binary search tree/Merge/merge_two_tree(geek_for_geek_methods).cpp:47: recursivly ==> recursively
./Data Structure/Tree/Binary search tree/Height/height.cpp:3: wher ==> where, were
./Data Structure/Tree/Binary search tree/Height/height.cpp:6: defintion ==> definition
./Data Structure/Tree/Binary search tree/Height/height.cpp:11: bacause ==> because
./Data Structure/Tree/Binary search tree/Delete Full Tree/README.md:3: memmory ==> memory
./Data Structure/Tree/Binary search tree/RangeSearch/RangeSearch.cpp:92: currrent ==> current
./Data Structure/Tree/Binary search tree/RangeSearch/RangeSearch.cpp:100: currrent ==> current
./Data Structure/Tree/Binary search tree/RangeSearch/Range Search(vector).cpp:90: currrent ==> current
./Data Structure/Tree/Binary search tree/RangeSearch/Range Search(vector).cpp:97: currrent ==> current
./Data Structure/Tree/Binary search tree/Order statistic/rank_of_tree.cpp:19: intialize ==> initialize
./Data Structure/Tree/Binary search tree/Order statistic/rank_of_tree.cpp:35: itselt ==> itself
./Data Structure/Tree/Binary search tree/Order statistic/README.md:4: explaination ==> explanation
./Data Structure/Tree/Binary search tree/Order statistic/find_Kth_smallest_element.cpp:21: actullay ==> actually
./Data Structure/Tree/Binary search tree/Traverse/README.md:39: infinte ==> infinite
./Data Structure/Tree/Binary search tree/Traverse/Vertical Order Traverse/vertical_order_traverse(recursion).cpp:1: explaination ==> explanation
./Data Structure/Tree/Binary search tree/Traverse/Breadth first search/README.md:1: serch ==> search
./Data Structure/Tree/Binary search tree/Traverse/Breadth first search/README.md:8: auxillary ==> auxiliary
./Data Structure/Tree/Binary search tree/is Binary search tree/isBST(inroder_traversal).cpp:2: serach ==> search
./Data Structure/Tree/AVL tree/README.md:2: exaplaination ==> explanation
./Data Structure/Binary Heap/README.md:2: strucutre ==> structure
./Data Structure/Graph/README.md:2: infinte ==> infinite
./Data Structure/Graph/Traversal/DFS/depth_first_search.cpp:3: carefull ==> careful, carefully
./Data Structure/Graph/Traversal/BFS/BFS(array).cpp:3: variabel ==> variable
./Data Structure/Graph/Traversal/Dijkstra/dijkstra.cpp:83: desciption ==> description
./Data Structure/Hashing/README.md:1: teminal ==> terminal
./Data Structure/Hashing/README.md:5: consistant ==> consistent
./Data Structure/priority_queue, heap/priority_queue_array_implementation.c:2: coresponding ==> corresponding
./Data Structure/Linked List/linked_list.cpp:17: fron ==> from, front
./Data Structure/Linked List/Linked_list_Sorting/README.md:3: achive ==> achieve, archive
./Data Structure/Linked List/insertion/linked_list_insertion(passing as a local variable).cpp:1: funtion ==> function
./Data Structure/Linked List/Cycle_Detection/cycle_detection_using_without_modifying_data_structure.cpp:57: actully ==> actually
./Data Structure/Linked List/Cycle_Detection/cycle_detection_using vector.cpp:58: persistance ==> persistence
./Data Structure/Linked List/Cycle_Detection/cycle_detection_using_flag.cpp:81: carefull ==> careful, carefully
./Data Structure/Linked List/Cycle_Detection/README.md:3: algorthm ==> algorithm
./Data Structure/Linked List/Cycle_Detection/README.md:7: reapeated ==> repeated
./Data Structure/Linked List/Cycle_Detection/cycle_detection(floyed algorithm)(Two pointer approch).cpp:103: carefull ==> careful, carefully
./Bug hunting/Floating point exception:3: complier ==> compiler
./Bug hunting/range_0.cpp:15: varibale ==> variable
./Bug hunting/range_0.cpp:15: arithmatic ==> arithmetic
./Bug hunting/range_0.cpp:20: happend ==> happened, happens, happen
./Bug hunting/range_0.cpp:21: happend ==> happened, happens, happen
./Bug hunting/range_0.cpp:21: multipy ==> multiply
./Dart/Object_Orieneted_Programming/0004_super.dart:28: keywork ==> keyword
./Dart/Object_Orieneted_Programming/0002_ClassMethod_Vs_InstanceMethod.dart:11: acess ==> access
./Dart/Object_Orieneted_Programming/0002_ClassMethod_Vs_InstanceMethod.dart:11: avaiable ==> available
./Dart/Object_Orieneted_Programming/0002_ClassMethod_Vs_InstanceMethod.dart:41: acess ==> access
./Dart/Functionality/Immediately_Invoked_Function_Expression.dart:1: avaible ==> available
./Dart/Advance/Arithmatic_operation_on_Generics.dart:1: arithmatic ==> arithmetic
./Dart/Advance/OperatorOverloading_using_Generics.dart:1: arithmatic ==> arithmetic
./Dart/Problems.dart/arithmatic_operator_Generic.dart:1: arithmatic ==> arithmetic
./Server/ejs/0005_layout/views/footer.ejs:2: receieved ==> received
./Technique/scanf.cpp:6: does't ==> doesn't
./Technique/scanf_with_format.c:9: seperated ==> separated
./Algorithm/README.md:3: algorthm ==> algorithm
./Algorithm/README.md:7: reapeated ==> repeated
./Algorithm/Recursion/CGD(Greatest Common Divisior)/README.md:2: explaination ==> explanation
./Algorithm/Bit manipulation/ip_hash.cpp:1: arithmatic ==> arithmetic
./Algorithm/Bit manipulation/Binary_facts.txt:9: ans ==> and
./Algorithm/miscellaneous/IntegerOverflow/integerOverflowDetection.cpp:8: singed ==> signed, singled, sang, sung
./Algorithm/miscellaneous/Factorial/README.md:2: approch ==> approach
./Algorithm/miscellaneous/Fibonacci/README.md:3: approch ==> approach
./Algorithm/miscellaneous/Fibonacci/README.md:4: Approch ==> Approach
./Algorithm/Dynamic Programming/Test/recursion.cpp:18: ans ==> and
./Algorithm/Dynamic Programming/Test/recursion.cpp:19: ans ==> and
./Algorithm/Dynamic Programming/Test/dynamic.cpp:21: ans ==> and
./Algorithm/Dynamic Programming/Test/dynamic.cpp:23: ans ==> and
./Algorithm/Dynamic Programming/Factorial/README.md:1: approch ==> approach
./Algorithm/Dynamic Programming/Factorial/README.md:2: approch ==> approach
./Algorithm/Dynamic Programming/Fibonacci/README.md:1: approch ==> approach
./Algorithm/Sorting/Heap_sort.cpp:7: Swaping ==> Swapping
./Algorithm/Sorting/README.md:23: progamming ==> programming
./Algorithm/Sorting/README.md:23: implementated ==> implemented
./Algorithm/Sorting/README.md:23: thay ==> they, that
./Algorithm/Sorting/Merge_Sort/Merge_Sort.cpp:1: implementaion ==> implementation
./Algorithm/Sorting/Couting sort/README.md:2: explaination ==> explanation
./Algorithm/Sorting/Couting sort/README.md:4: Couting ==> Counting
./Algorithm/Sorting/Couting sort/README.md:6: Couting ==> Counting
./Algorithm/Sorting/Couting sort/README.md:14: Couting ==> Counting
./Algorithm/Sorting/Couting sort/README.md:18: actullay ==> actually
./Algorithm/Sorting/Couting sort/README.md:21: Couting ==> Counting
./Algorithm/Sorting/Couting sort/README.md:27: Couting ==> Counting
./Algorithm/Pattern Maching/KMP/KMP(soi).cpp:30: postion ==> position
./Algorithm/Pattern Maching/KMP/KMP(soi).cpp:34: postion ==> position
./Linux/kernal_revert.txt:5: kernal ==> kernel
./Linux/kernal_revert.txt:15: kernal ==> kernel
./Linux/Bash/002_RegEx(search_config_pipes).txt:3: followd ==> followed, follows, follow
./Linux/Bash/002_RegEx(search_config_pipes).txt:15: multple ==> multiple
./Linux/Bash/002_RegEx(search_config_pipes).txt:18: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:18: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:19: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:19: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:20: occurance ==> occurrence
./Linux/Bash/002_RegEx(search_config_pipes).txt:20: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:21: serach ==> search
./Linux/Bash/002_RegEx(search_config_pipes).txt:21: occurance ==> occurrence
./Linux/Bash/002_RegEx(search_config_pipes).txt:22: serach ==> search
./Linux/Bash/002_RegEx(search_config_pipes).txt:22: occurance ==> occurrence
./Linux/Bash/002_RegEx(search_config_pipes).txt:22: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:22: charaters ==> characters
./Linux/Bash/002_RegEx(search_config_pipes).txt:23: serach ==> search
./Linux/Bash/002_RegEx(search_config_pipes).txt:23: preceeding ==> preceding, proceeding
./Linux/Bash/002_RegEx(search_config_pipes).txt:36: characeter ==> character
./Linux/Bash/002_RegEx(search_config_pipes).txt:47: begining ==> beginning
./Linux/Bash/002_RegEx(search_config_pipes).txt:51: serach ==> search
./Linux/Bash/002_RegEx(search_config_pipes).txt:53: serach ==> search
./Linux/Bash/Miscellaneous_2.txt:11: dependeny ==> dependency
./Linux/Bash/Miscellaneous_1.txt:37: dirver ==> driver
./Programming paradigm/0003_Callback_function.js:10: funciton ==> function
./Programming paradigm/0003_Callback_function.js:15: funciton ==> function
./Programming paradigm/Imperative_vs_Declearative.js:54: parital ==> partial, parietal
./Programming paradigm/Imperative_vs_Declearative.js:54: beacuse ==> because
./Programming paradigm/Partially_Applied_function.js:14: exmple ==> example
./Programming paradigm/Partially_Applied_function.js:14: beccause ==> because
./Programming paradigm/Partially_Applied_function.js:14: actullay ==> actually
./Programming paradigm/0004_modulePatter/0001_exampleJavaScipt.js:4: funciton ==> function
./Programming paradigm/0004_modulePatter/0001_exampleJavaScipt.js:18: funciton ==> function
./Programming paradigm/Functional_Programming/0001_First_Class_function.js:3: diffrence ==> difference
./Programming paradigm/Functional_Programming/0001_First_Class_function.js:3: funciton ==> function
./Programming paradigm/Functional_Programming/0002_Higher_Order_Function.js:2: diffrence ==> difference
./Programming paradigm/Functional_Programming/0002_Higher_Order_Function.js:2: funciton ==> function
./Javascript/README.md:6: falsy ==> falsely, false
./Javascript/Javascript_execution_contest.js:5: Gloabl ==> Global
./Javascript/Methods/Function.length.js:12: paramter ==> parameter
./Javascript/Methods/Function.length.js:13: paramter ==> parameter
./Javascript/Silly/005_greaterThan_automatic_covert_datatype.js:1: carefull ==> careful, carefully
./Javascript/Data Structure/Built In/some().js:5: statisfy ==> satisfy
./Javascript/Data Structure/Built In/splice().js:9: seperated ==> separated
./Javascript/Data Structure/Built In/find().js:4: statisfy ==> satisfy
./Javascript/Data Structure/Built In/reduce().js:25: couting ==> counting
./Javascript/Data Structure/Built In/reduce().js:38: elemenets ==> elements
./Javascript/Data Structure/Built In/reduce().js:52: acess ==> access
./Javascript/Data Structure/Built In/slice().js:5: ommited ==> omitted
./Javascript/Data Structure/Built In/rest_operator.js:4: paramters ==> parameters
./Javascript/Data Structure/Built In/rest_operator.js:5: paramters ==> parameters
./Javascript/Data Structure/Built In/rest_operator.js:6: paramters ==> parameters
./Javascript/Data Structure/Built In/concat().js:15: actullay ==> actually
./Javascript/Data Structure/Built In/every().js:6: statisfy ==> satisfy
./Javascript/Data Structure/Built In/every().js:7: statisfy ==> satisfy
./Javascript/Data Structure/Built In/README.md:1: Javasript ==> Javascript
./Javascript/Data Structure/Built In/split().js:6: seperation ==> separation
./Javascript/Data Structure/Built In/split().js:12: seperate ==> separate
./Javascript/Data Structure/Built In/split().js:15: seperate ==> separate
./Javascript/Data Structure/Built In/split().js:21: mutiple ==> multiple
./Javascript/Data Structure/Built In/split().js:21: seperation ==> separation
./Javascript/Data Structure/Built In/Spread_operator(...arr).js:20: paramters ==> parameters
./Javascript/Data Structure/Built In/Spread_operator(...arr).js:21: paramters ==> parameters
./Javascript/Data Structure/Built In/Spread_operator(...arr).js:22: paramters ==> parameters
./Javascript/Data Structure/Built In/sort().js:6: carefull ==> careful, carefully
./Javascript/Data Structure/Built In/join().js:9: seperater ==> separator
./Javascript/Data Structure/Built In/trim().js:11: begining ==> beginning
./Javascript/Data Structure/Built In/reverse().js:8: carefull ==> careful, carefully
./Javascript/Data Structure/Built In/Array/0001_example1.js:1: arrray ==> array
./Javascript/Good_Practice/1113_modulePattern.js:4: funciton ==> function
./Javascript/Good_Practice/1113_modulePattern.js:18: funciton ==> function
./Javascript/Good_Practice/1111_strictMode+iife.js:7: erro ==> error
./Javascript/Good_Practice/1111_strictMode+iife.js:9: immediatly ==> immediately
./Javascript/Async/0001_execution_order.js:1: funciton ==> function
./Javascript/Async/0001_execution_order.js:1: accroding ==> according
./Javascript/Async/0005_Async_Await/00031_block_execution_with_async.mjs:7: funciton ==> function
./Javascript/Async/0002_Callback/0002_Callback_function.js:8: recieve ==> receive
./Javascript/Async/0002_Callback/0002_Callback_function.js:11: receieve ==> receive
./Javascript/OOP/Prototype Based/0006_Private_property(Encapsulation).js:7: avaiable ==> available
./Javascript/OOP/Prototype Based/README.md:2: Objec ==> Object
./Javascript/OOP/Prototype Based/0002_OwnProperty_&_Prototype.js:10: javascipt ==> javascript
./Javascript/OOP/Prototype Based/0002_OwnProperty_&_Prototype.js:16: seprate ==> separate
./Javascript/OOP/Prototype Based/0003_Prototype.js:10: inhertance ==> inheritance
./Javascript/OOP/Prototype Based/0003_Prototype.js:10: avaiable ==> available
./Javascript/OOP/Prototype Based/00021_Object_creation_behind_the_scene.js:38: als ==> also
./Javascript/OOP/Class Based/0001_Class.js:6: decleration ==> declaration
./Javascript/OOP/Class Based/0001_Class.js:25: constuctor ==> constructor
./Javascript/OOP/Class Based/0005_ClassMethod_VS_StaticMethod.js:24: memeber ==> member
./Javascript/OOP/Class Based/0004_Static.js:5: consistancy ==> consistency
./Javascript/OOP/Class Based/0007_Method_overloading(Polymorphism).js:4: doen't ==> doesn't
./Javascript/OOP/Class Based/0007_Method_overloading(Polymorphism).js:4: suppor ==> support
./Javascript/OOP/Class Based/0007_Method_overloading(Polymorphism).js:8: chceking ==> checking
./Javascript/OOP/Class Based/00021_Privare_Properties.js:4: avaiable ==> available
./Javascript/Objects/0007_Prototype.js:11: inhertance ==> inheritance
./Javascript/Objects/0007_Prototype.js:11: avaiable ==> available
./Javascript/Objects/README.md:9: Parantheses ==> Parentheses
./Javascript/Objects/0010_freeze.js:3: completly ==> completely
./Javascript/Objects/0010_freeze.js:5: completly ==> completely
./Javascript/Objects/0002_OwnProperty_&_Prototype.js:10: javascipt ==> javascript
./Javascript/Objects/0002_OwnProperty_&_Prototype.js:19: seprate ==> separate
./Javascript/Objects/0013_Object_count_optimization.js:21: sperate ==> separate
./Javascript/Objects/0013_Object_count_optimization.js:22: everytime ==> every time
./Javascript/Objects/0013_Object_count_optimization.js:22: funciton ==> function
./Javascript/Objects/0003_Method_&_this.js:13: refering ==> referring
./Javascript/Objects/0003_Method_&_this.js:25: funciton ==> function
./Javascript/Objects/0003_Method_&_this.js:25: defintion ==> definition
./Javascript/Objects/0001_Object.js:14: actullay ==> actually
./Javascript/RegEx/0007_character_classes.js:6: chatacter ==> character
./Javascript/RegEx/0013_match_at_begining.js:1: carefull ==> careful, carefully
./Javascript/RegEx/0013_match_at_begining.js:9: Univesity ==> University
./Javascript/RegEx/0003_ignore_flag.js:4: sensivity ==> sensitivity, sensitively
./Javascript/RegEx/0004_match().js:5: exacly ==> exactly
./Javascript/RegEx/0017_Quantity_Specifier.js:6: statisfy ==> satisfy
./Javascript/RegEx/0009_negated character sets.js:1: remeber ==> remember
./Javascript/RegEx/0009_negated character sets.js:2: begining ==> beginning
./Javascript/RegEx/0009_negated character sets.js:22: Univesity ==> University
./Javascript/RegEx/0015_shortcuts.js:14: exludes ==> excludes, exudes
./Javascript/Advance/Debounce/Debounce.js:15: hanlder ==> handler
./Javascript/Advance/Iterator/0002_Custom_iterator.js:2: custome ==> custom, customs, costume, customer
./Javascript/Project/Vacation Destination Project/README.md:3: avaiable ==> available
./Javascript/Project/Vacation Destination Project/README.md:3: avaiable ==> available
./Javascript/Project/Vacation Destination Project/script.js:14: retrive ==> retrieve
./Javascript/Project/JavaScript_Basic_Challenges/Challenge_1_to_9.js:50: progammer ==> programmer
./Javascript/Project/JavaScript_Basic_Challenges/Challenge_1_to_9.js:76: Apon ==> Upon, apron
./Javascript/Project/Basic Distance Project/index.html:50: convertion ==> conversion
./Javascript/Project/Basic Distance Project/script.js:15: convertion ==> conversion
./Javascript/JSON/0002_Parse.js:16: covert ==> convert
./Javascript/DOM/1113_Navigation/1114_Navigation.js:16: elemenet ==> element
./Javascript/DOM/1112_Mthods/1114_querySelector.js:2: mulitple ==> multiple
./Javascript/DOM/1115_Events/1000_information.txt:11: happend ==> happened, happens, happen
./Javascript/Raw/0016_and(&&)_or(||)_operator.js:9: awsome ==> awesome
./Javascript/Raw/0010_conversion.js:33: covert ==> convert
./Javascript/Raw/0011_error.js:6: excuted ==> executed
./Javascript/Raw/0007_switch.js:1: comparision ==> comparison
./Javascript/Raw/0007_switch.js:8: defaule ==> default
./Javascript/Raw/0007_switch.js:9: comparision ==> comparison
./Javascript/Raw/00041_comparision.js:25: comparision ==> comparison
./Javascript/Raw/0012_this.js:13: wil ==> will, well
./Javascript/Raw/0015_Destructuring_assignment.js:1: multple ==> multiple
./Javascript/Raw/0015_Destructuring_assignment.js:22: requres ==> requires
./Javascript/Raw/0015_Destructuring_assignment.js:112: exclusivly ==> exclusively
./Javascript/Raw/0007_Function/116_declearation_Vs_expression.js:9: Javascipt ==> Javascript
./Javascript/Raw/0007_Function/120_Closure.js:26: acecess ==> access
./Javascript/Raw/0007_Function/120_Closure.js:36: funciton ==> function
./Javascript/Raw/0007_Function/119_this_with_call()&apply()&bind().js:57: brower ==> browser
./Javascript/Raw/0007_Function/1121_parameter.js:6: paramter ==> parameter
./Javascript/Raw/0007_Function/121_currying/122_curry_converter.js:3: custome ==> custom, customs, costume, customer
./Javascript/Raw/0007_Function/121_currying/122_curry_converter.js:11: requirment ==> requirement
./Javascript/Raw/0007_Function/121_currying/122_curry_converter.js:12: normall ==> normal, normally
./Javascript/Raw/0007_Function/121_currying/121_currying.js:3: paramters ==> parameters
./Javascript/Raw/0007_Function/121_currying/121_currying.js:7: normall ==> normal, normally
./Javascript/Raw/0007_Function/121_currying/121_currying.js:49: parital ==> partial, parietal
./Javascript/Raw/0007_Function/121_currying/121_currying.js:49: beacuse ==> because
./Javascript/Raw/3333_Scope/1113_strict_mode.js:6: immediatly ==> immediately
./Javascript/Raw/3333_Scope/1115_const.js:5: immediatly ==> immediately
./Javascript/Raw/3333_Scope/1117A_var_let_const.js:2: avaiable ==> available
./Javascript/Raw/3333_Scope/1117A_var_let_const.js:41: doens't ==> doesn't
./Javascript/Raw/3333_Scope/1117A_var_let_const.js:54: immediatly ==> immediately
./Javascript/Raw/3333_Scope/1111_local_vs_global_scope.js:3: everwhere ==> everywhere
./Javascript/Raw/3333_Scope/1111_local_vs_global_scope.js:12: Carefull ==> Careful, carefully
./Javascript/Raw/3333_Scope/1111_local_vs_global_scope.js:12: variabe ==> variable
./Javascript/Raw/3333_Scope/1111_local_vs_global_scope.js:12: varibale ==> variable
./Javascript/Raw/3333_Scope/1117_hoisting.js:27: decleration ==> declaration
./Javascript/Raw/3333_Scope/1117_hoisting.js:70: varibale ==> variable
./Javascript/Raw/3333_Scope/1117_hoisting.js:83: actullay ==> actually
./Javascript/Raw/0008_Module/0001C_export(default).js:5: defaule ==> default
./Javascript/Raw/0008_Module/0005_alias_import.js:3: carefull ==> careful, carefully
./Javascript/Raw/3334_Primitive_vs_Reference/001_primitive_vs_reference.js:31: actullay ==> actually
./Javascript/Raw/3334_Primitive_vs_Reference/001_primitive_vs_reference.js:32: thats ==> that's
./Javascript/Raw/3334_Primitive_vs_Reference/001_primitive_vs_reference.js:53: differnce ==> difference
./Javascript/Raw/3334_Primitive_vs_Reference/005_object_deep_copy.js:49: indentity ==> identity
./Javascript/Raw/3334_Primitive_vs_Reference/005_object_deep_copy.js:50: catagory ==> category
./Javascript/Raw/3334_Primitive_vs_Reference/005_object_deep_copy.js:52: indentity ==> identity
./Javascript/Raw/3334_Primitive_vs_Reference/005_object_deep_copy.js:52: catagory ==> category
./Javascript/Raw/3334_Primitive_vs_Reference/004_array_deep_copy.js:25: seprate ==> separate
./C/Tik Tok Toe.c:42: proccess ==> process
./C/Tik Tok Toe.c:177: postion ==> position
./C/README.md:5: Objec ==> Object
./C/minprintf.c:1: implementaion ==> implementation
./C/minprintf.c:1: funciton ==> function
./C/minprintf.c:3: vedio ==> video
./C/C problems/array_address_doesn't_change.cpp:9: funciton ==> function
./C/C problems/array_address_doesn't_change.cpp:15: happend ==> happened, happens, happen
./C/C problems/array_address_doesn't_change.cpp:16: funciton ==> function
Arsenic-ATG added a commit to Arsenic-ATG/Samin_Reading_Room that referenced this issue Mar 2, 2023
@Arsenic-ATG Arsenic-ATG linked a pull request Mar 2, 2023 that will close this issue
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant