Jamie Kelly j-quelly
j-quelly
/ scrollTo.js
Last active
February 5, 2016 01:44
— forked from james2doyle/scrollTo.js
a native scrollTo function in javascript that uses requestAnimationFrame and easing for animation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // get element Y position | |
| function elmYPosition(eID) { | |
| var elm = document.getElementById(eID), | |
| y = elm.offsetTop - 65, | |
| node = elm; | |
| while (node.offsetParent && node.offsetParent != document.body) { | |
| node = node.offsetParent; | |
| y += node.offsetTop; | |
| } | |
| return y; |
j-quelly
/ fullstack-react-chapter-3-exercises.js
Created
September 1, 2016 16:52
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const TimersDashboard = React.createClass({ | |
| getInitialState: function() { | |
| return { | |
| timers: [], | |
| serverError: false, | |
| timerError: false, | |
| }; | |
| }, |
j-quelly
/ fullstack-react-chapter-3-exercises-client.js
Created
September 1, 2016 16:53
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* eslint-disable no-console */ | |
| /* eslint-disable no-undef */ | |
| window.client = (function() { | |
| function getTimers(success, onError) { | |
| return fetch('/api/timers', { | |
| // tell the server we'll only accept a JSON response | |
| headers: { | |
| Accept: 'application/json', | |
| }, | |
| }).then(checkStatus) |
j-quelly
/ sublime text 3 key map for windows
Created
February 12, 2017 19:25
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [ | |
| { "keys": ["ctrl+shift+n"], "command": "new_window" }, | |
| { "keys": ["ctrl+shift+w"], "command": "close_window" }, | |
| { "keys": ["ctrl+o"], "command": "prompt_open_file" }, | |
| { "keys": ["ctrl+shift+t"], "command": "reopen_last_file" }, | |
| { "keys": ["alt+o"], "command": "switch_file", "args": {"extensions": ["cpp", "cxx", "cc", "c", "hpp", "hxx", "hh", "h", "ipp", "inl", "m", "mm"]} }, | |
| { "keys": ["ctrl+n"], "command": "new_file" }, | |
| { "keys": ["ctrl+s"], "command": "save" }, | |
| { "keys": ["ctrl+shift+s"], "command": "prompt_save_as" }, | |
| { "keys": ["ctrl+f4"], "command": "close_file" }, |
j-quelly
/ dungeonBlaster.js
Last active
January 1, 2019 01:16
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // passing 100% of tests | |
| function getStartPosition(m) { | |
| let position = ''; | |
| m.forEach((row, x) => { | |
| const cells = row.split(''); | |
| const y = cells.indexOf('*'); | |
| if (y !== -1) { | |
| position += x + ','; | |
| position += y; | |
| } |
j-quelly
/ addTwoHugeNumbers.js
Last active
January 2, 2019 05:34
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Definition for singly-linked list: | |
| // function ListNode(x) { | |
| // this.value = x; | |
| // this.next = null; | |
| // } | |
| // | |
| function getNumber(list) { | |
| let current = list; | |
| let num = []; |
j-quelly
/ mergeTwoLinkedLists.js
Created
January 3, 2019 05:24
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Definition for singly-linked list: | |
| // function ListNode(x) { | |
| // this.value = x; | |
| // this.next = null; | |
| // } | |
| // | |
| function mergeTwoLinkedLists(l1, l2) { | |
| const list = []; | |
| let left = l1; | |
| let right = l2; |
j-quelly
/ reverseNodesInKGroups.js
Created
January 3, 2019 18:02
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Definition for singly-linked list: | |
| // function ListNode(x) { | |
| // this.value = x; | |
| // this.next = null; | |
| // } | |
| // | |
| function reverseNodesInKGroups(l, k) { | |
| let temp = k; | |
| let current = l; | |
| const results = []; |
j-quelly
/ rearrangeLastN.js
Last active
January 6, 2019 00:53
Note: Try to solve this task in O(list size) time using O(1) additional space, since this is what you'll be asked during an interview. Given a singly linked list of integers l and a non-negative integer n, move the last n list nodes to the beginning of the linked list.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Definition for singly-linked list: | |
| // function ListNode(x) { | |
| // this.value = x; | |
| // this.next = null; | |
| // } | |
| // | |
| function getArryFromList(l) { | |
| let current = l; | |
| const results = []; | |
| while(current) { |
j-quelly
/ groupingDishes.js
Created
January 6, 2019 01:28
You have a list of dishes. Each dish is associated with a list of ingredients used to prepare it. You want to group the dishes by ingredients, so that for each ingredient you'll be able to find all the dishes that contain it (if there are at least 2 such dishes). Return an array where each element is a list with the first element equal to the na…
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function groupingDishes(dishes) { | |
| const ingredientMap = dishes.reduce((map, dish) => { | |
| dish.slice(1).forEach((ingredient) => { | |
| if (!map[ingredient]) { | |
| map[ingredient] = [dish[0]]; | |
| } else { | |
| // if happens more than once it should be an ingredient | |
| map[ingredient].push(dish[0]); | |
| } | |
| }); |
OlderNewer