countingvalleys

code wars solution to Counting Valleys on codeWars.com for JavaScript

coursegradesproject

Create a project that simulates a grade book for a class. Use a 2D array of integers, one row for each student, one column for each test score for that student. Set up the program for any number of students and any number of tests, and ask the user for those numbers. Test the program with 3 students that each have 3 test scores. The CourseGrades application should use a GradeBook class that has instance variables for the number of students and the number of grades, and the 2D array to contain those values. The constructor will use parameters for the number of students and the number of tests to instantiate the 2D array of the proper size.

crash-srv

The code behind the LibreOffice crash reporter. http://crashreport.libreoffice.org/stats/

dataobjectmanager

DataObjectManager module for Silverstripe CMS

datareverse

A stream of data is received and needs to be reversed. Each segment is 8 bits long, meaning the order of these segments needs to be reversed, for example: 11111111 00000000 00001111 10101010 (byte1) (byte2) (byte3) (byte4) should become: 10101010 00001111 00000000 11111111 (byte4) (byte3) (byte2) (byte1) The total number of bits will always be a multiple of 8. The data is given in an array as such: [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,1,0,1,0,1,0] Note: In the C and NASM languages you are given the third parameter which is the number of segment blocks.

dateprocess

stores date values and prints the date in numeric and alphabetic form. The user will enter a date in MM/DD form; the project will perform validation on the input, and if there are no errors, will print the date in alphabetic form

dav1d

A read-only mirror of dav1d source code repository. The origin is at https://code.videolan.org/videolan/dav1d/

davistech

Will contain most of the projects I completed while a student at Davis Technical College

davistechcanvasapiapp

This application is designed to work as a help-mate to the Instructure Canvas Web Applicaton.

delete-occurrences-of-an-element-if-it-occurs-more-than-n-times

Enough is enough! Alice and Bob were on a holiday. Both of them took many pictures of the places they've been, and now they want to show Charlie their entire collection. However, Charlie doesn't like these sessions, since the motif usually repeats. He isn't fond of seeing the Eiffel tower 40 times. He tells them that he will only sit for the session if they show the same motif at most N times. Luckily, Alice and Bob are able to encode the motif as a number. Can you help them to remove numbers such that their list contains each number only up to N times, without changing the order? Task Given a list and a number, create a new list that contains each number of list at most N times, without reordering. For example if the input number is 2, and the input list is [1,2,3,1,2,1,2,3], you take [1,2,3,1,2], drop the next [1,2] since this would lead to 1 and 2 being in the result 3 times, and then take 3, which leads to [1,2,3,1,2,3]. With list [20,37,20,21] and number 1, the result would be [20,37,21].

deletegoalsfromflatlist

delete Goals From FlatList

denvercoder1

Jonah Lawrence's Profile README

dict_nds

Low German dictionary for LibreOfffice

docker-nitter

Docker image for nitter, an alternative Twitter front-end.

document-standards

Comparison of Document Standard Formats

donotusedoubleequalstocomparestringsinjava

DoNotUseDoubleEqualsToCompareStringsInJava

donotusedoubleequaltocomparestringsinjava

DoNotUseDoubleEqualToCompareStringsInJava

duckhunt-js

DuckHunt ported to JS and HTML5

dvblast

Please send patches as pull requests.

education.libreoffice.org

equal-sides-of-an-array

Equal Sides Of An Array. 6 kyu

error

error

eventcalendar

Event Calendar module for SilverStripe CMS

expensetrackerapp

Expense Tracker App using React Native JavaScript

extensions.libreoffice.org

factorialcalc

factorial calculator using recursion

familywebsite

First website. Family website

favoriteplacesapp

Use native phone features like camera, GPS, & device memory to record and digitally remember your favorite places! React Native JavaScript

fdroidclient

Android client application.

fibonacci-tribonacci-and-friends

If you have completed the Tribonacci sequence kata, you would know by now that mister Fibonacci has at least a bigger brother. If not, give it a quick look to get how things work. Well, time to expand the family a little more: think of a Quadribonacci starting with a signature of 4 elements and each following element is the sum of the 4 previous, a Pentabonacci (well Cinquebonacci would probably sound a bit more italian, but it would also sound really awful) with a signature of 5 elements and each following element is the sum of the 5 previous, and so on. Well, guess what? You have to build a Xbonacci function that takes a signature of X elements - and remember each next element is the sum of the last X elements - and returns the first n elements of the so seeded sequence.