├── challenges └── firstUniqueChar.js ├── data_structures └── LinkedList.py └── README.md /challenges/firstUniqueChar.js: -------------------------------------------------------------------------------- 1 | /** Find the first unique character in a string. Return `null` if no unique character is found. 2 | 3 | Test cases: 4 | - input: "aabcdcd" , output: "b" 5 | - input: "bb", output: null 6 | - input: "ababccd", output: "d" 7 | - input: "abcdea", output: "b" 8 | 9 | Time complexity: 10 | Space complexity: 11 | **/ 12 | -------------------------------------------------------------------------------- /data_structures/LinkedList.py: -------------------------------------------------------------------------------- 1 | # comment ou 2 | class ListNode: 3 | def __init__(self, val=None): 4 | self.data = val 5 | self.next = None 6 | class LinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def setHead(self, head): 11 | self.head = head 12 | 13 | my_list = LinkedList() 14 | node = ListNode(10) 15 | my_list.setHead(node) 16 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # algorithms-group 2 | Resources and notes for the algorithms study group with Learn Teach Code (Created by @ThuyNT13, @mtroiani, @LearningNerd, @loorin, and @nurarenke) 3 | 4 | ![Our first downtown LA algorithms meetup](https://secure.meetupstatic.com/photos/event/2/8/1/8/highres_467050264.jpeg) 5 | 6 | ## Next ideas 7 | 8 | - Include resources in this repo like primers on algorithm topics, and maybe lists of suggested links and other stuff? See below. 9 | 10 | - Maybe try publishing meeting notes to keep an archive of what happens at each meetup, similar to https://github.com/fullstackla/pairing-meetup/issues/159 11 | 12 | - collect challenges that are good practice materials for meetups 13 | 14 | 15 | ## Being developed 16 | 17 | - Creating a wiki of resources: https://github.com/LearnTeachCode/algorithms-group/wiki 18 | - **Gist Study Guides** shared at presentations/workshops given at meetups, and that people can download 19 | - [Big O Notation](https://gist.github.com/ThuyNT13/16bc1cf4242e5e2ba84d20c47be793b0) 20 | - [LinkedList](https://gist.github.com/ThuyNT13/85815881d64061ef3e21671a233f8e43) 21 | - [HashMaps](https://gist.github.com/mtroiani/e03e48aa23b7e46b151d52ac042a8fa3) 22 | - [Recursion and DP](https://gist.github.com/mtroiani/b30108f4cae4ccd1d511ee6dd53f2949) 23 | - [Arrays](https://gist.github.com/mtroiani/899541a99c9e900dd017b0f1b48c7314) 24 | - [Trees](https://gist.github.com/mtroiani/b5d24d89dbbf1cf5cd922693c3c4a1cf) 25 | 26 | --- 27 | 28 | ## Join Us! 29 | 30 | For the latest news, join our **#algorithms** and **#mock-interviews** channel on Slack. We are currently exploring weekly virtual/remote Meetups. This will allow for more consistent, regular practice. 31 | 32 | **http://learnteachcode.herokuapp.com** 33 | 34 | ## Support 35 | 36 | Please open or respond to [an issue](https://github.com/LearnTeachCode/algorithms-group/issues) for support. 37 | 38 | ## Contributing 39 | 40 | Please contribute using [Github Flow](https://guides.github.com/introduction/flow/). Create a branch, add commits, and open a [pull request](https://github.com/LearnTeachCode/algorithms-group/pulls). Please don't push to master. 41 | --------------------------------------------------------------------------------