From 4bfa6bd5ea741c68544b133528bb6b0fed6e34f8 Mon Sep 17 00:00:00 2001 From: Eva Zamudio Date: Mon, 4 Nov 2013 13:44:29 -0800 Subject: [PATCH] style home page --- Gemfile | 1 + Gemfile.lock | 4 + public/.DS_Store | Bin 6148 -> 6148 bytes public/index.html | 343 +++++----------------------------- public/style.css | 415 +++++++++++++++++++++++++++++++++++++++++ public/whiteboard.html | 239 ++++++++++++++++++++++++ 6 files changed, 703 insertions(+), 299 deletions(-) create mode 100644 public/style.css create mode 100644 public/whiteboard.html diff --git a/Gemfile b/Gemfile index 98059ee..9d6fe23 100644 --- a/Gemfile +++ b/Gemfile @@ -1,3 +1,4 @@ source "https://rubygems.org" gem 'rack' +gem 'bootstrap-sass', '2.3.2' \ No newline at end of file diff --git a/Gemfile.lock b/Gemfile.lock index d12c7aa..ffbcafb 100644 --- a/Gemfile.lock +++ b/Gemfile.lock @@ -1,10 +1,14 @@ GEM remote: https://rubygems.org/ specs: + bootstrap-sass (2.3.2.0) + sass (~> 3.2) rack (1.5.2) + sass (3.2.12) PLATFORMS ruby DEPENDENCIES + bootstrap-sass (= 2.3.2) rack diff --git a/public/.DS_Store b/public/.DS_Store index c31e0eec205752a398fffaa187815adc1b423036..f1abf76edc9156df8ab3e07a1a9257dfb5b310d3 100644 GIT binary patch delta 92 zcmZoMXfc=|#>CJzu~2NHo}wrt0|NsP3otNLFz7L4FqAOlGUQAwRA*$IY{X=~IgNQC r%jN>+#Y~&oIruq%+BPRLe`lV|FQUr{(s=-g87ABCNNB)qu~2NHo}w@-0|Nsi1A_oVesWSyeiD!;u<_tZMs<)lGea^%F+;Iu z4nhtn>ITFb|G|KPVPcPYJrhF~x+2CKAVomT`2RnUWMBZRNh&WcfLgLXsURn_xWvHV z8Y2@k3o9Et2PY>7PfU1bUP^wsQ+{b)N^x{>Mt*s4W=d*OVo@xZU6NQ*TI`fq1eOU% zEXe@ML40ut5L#>S>P3Py$owK@vb=H>=E3MQr|wY8ia z9Gn6xIYgE8Y&=2|YijH28^Eq)U<3vQ81O=A7}W%1fc;PwT$GoSpO+5gL)C6PzJO&j lI|n}pFi - Algorithm & Interview Prep Resources - - - - - - - - - - -
- - - -
-

Tips

-
-
    -
  • Remember to talk out loud! - Interviewers want to understand how you think and approach problems, so talk out loud while you’re solving problems. Let the interviewer see how you’re tackling the problem, and they just might guide you as well.
    • -
  • Ask Questions- If you're unsure of the parameters of the question or how to proceed, do be afraid to ask questions or for clarification.
    • -
- -
- - -
- - - -
-

Roman Numerals

-
- Write a method that converts an integer to its Roman numeral equivalent, i.e., 476 => 'CDLXXVI'. - For reference, these are the building blocks for how we encode numbers with Roman numerals: - I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1000 - Choose Between - Old-school Roman numerals (no subtraction of 4s and 9s) - 4 = IIII, 9 = VIIII etc. - Modern Roman numerals (subtraction) - 4 = IV, 9 = IX, 14 = XIV, 40 = XL, 44 = XLIV, 90 = XC, 944 = CMXLIV -
- -

Pig Latin

-
- Write a method the takes in a string and returns the pig latin equivalent. Pig Latin takes the first consonant, moves it to the end of the word and places “ay” at the end. If the string starts with a consonant do nothing. - “pig” = “igpay”, “banana” = “ananabay” -
- -

Shuffle

-
- Without using a shuffle or sort write your own shuffle method for an array. The method will take an array and returns a new array with all of the elements in a random order. One important property of a good shuffle method is that every permutation is equally likely. -
- -

Anagrams

-
- - An anagram is a word formed by rearranging the letters of another word, e.g., iceman is an anagram of cinema. - - We're going to write a method called anagrams_for that takes as its input a word and an array of words, representing a dictionary, and returns an array consisting of all the anagrams of the input word. - - anagrams_for should return an empty array ([]) if no anagrams are found in the dictionary. You don't have to worry about the order of the returned Array. -
- -

Factorial

- -
- - Write a recursive and iterative solution for a finding the factorial of a number. If you don't remember, the factorial of a non-negative integer n, denoted n! is the product of all positive integers less than . For example, 5! = 5 * 4 * 3 * 2 * 1 -
- -

Binary vs. Linear Searching

-
- - Write an example demonstrating Binary Search. - Write an example demonstrating Linear Search. - - Hint: A linear search looks down a list, one item at a time, without jumping. In complexity terms this is an O(n) search - the time taken to search the list gets bigger at the same rate as the list does. - - A binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for, which determines whether the value is in the first or second half of the list. -
- - -

Fibonacci

-
- Implement an iterative version of the Fibonacci sequence which take an integer n as input and returns the nth Fibonacci number. - - Implement a recursive version of the Fibonacci sequence which take an integer n as input and returns the nth Fibonacci number. - - In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence:[1][2] - 0,1,1,2,3,5,8,13,21,34,55,89,144 - By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. - In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation - F_n = F_{n-1} + F_{n-2} -
+ -

Apple Stock

-
- I have an array stockPricesYesterday where the keys are the number of minutes into the day (starting with midnight) and the values are the price of Apple stock at that time. For example, the stock cost $500 at 1am, so stockPricesYesterday[60] = 500. -
- Write an efficient algorithm for computing the best profit I could have made from 1 purchase and 1 sale of an Apple stock yesterday. -
- - -
- -
-
-
Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? -
- -
-
Write code to reverse a C-Style String. (C-String means that “abcd” is represented as five characters, including the null character.)
-
-
Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An extra copy of the array is not. Write the test cases for this method.
- -
Write a method to decide if two strings are anagrams or not.
- -
- -
-
-
Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. - - EXAMPLE - - Input: the node ‘c’ from the linked list a->b->c->d->e - Result: nothing is returned, but the new linked list looks like a->b->d->e - -
-
-
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1’s digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list. - - EXAMPLE - Input: (3 -> 1 -> 5) + (5 -> 9 -> 2) - Output: 8 -> 0 -> 8 -
- -
-
- Given a circular linked list, implement an algorithm which returns node at the beginning of the loop. - Circular linked list: A (corrupt) linked list in which a node’s next pointer points to an earlier node, so as to make a loop in the linked list. - - EXAMPLE - input: A -> B -> C -> D -> E -> C [the same C as earlier] - output: C -
- -
-
- Given two different lists of objects, come up with an efficient solution to find the intersection of the two lists. -
- -
+ Algorithm & Interview Prep Resources -
-
-
- Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that no two leaf nodes differ in distance from the root by more than one. -
-
-
Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
-
-
Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.
-
-
Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, you’ll have D linked lists).
+ + + - -
+ + + + -
-
-
In the classic problem of the Towers of Hanoi, you have 3 rods and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (e.g., each disk sits on top of an even larger one). You have the following constraints: + - (A) Only one disk can be moved at a time. - (B) A disk is slid off the top of one rod onto the next rod. - (C) A disk can only be placed on top of a larger disk. -
+ + Fork me on GitHub -
-
+
-
+
+ - Write a program to move the disks from the first rod to the last using Stacks. -
+
Your Tagline Goes Here
-
-
- Write a program to sort a stack in ascending order. You should not make any assumptions about how the stack is implemented. The following are the only functions that should be used to write this program: push | pop | peek | isEmpty. -
+
Algorithm & Interview Prep Resources
- -
+
- -
+ +
- -
- -
+ + -
+
-

ABOUT

-

Algorithms and Interview Prep was created to provided women with a space to building up their algorithm and technical interview skills while meeting new friends in the industry and gaining confidence to go out change the ratio.

+
+

About Us

+ +

Algorithms and Interview Prep was created to provided women with a space to building up their algorithm and technical interview skills while meeting new friends in the industry and gaining confidence to go out change the ratio.

The group meets weekly on Mondays at different tech companies througout San Francisco. Participants have a choice of four activities:

    @@ -241,97 +65,18 @@

    ABOUT

  • Mock Interviews: Typically asked technical questions, from behavioral questions to logic and technical knowledge
Upcoming Events - -
- -
-

Mock Interview

-

Behavioral questions

-
    -
  1. Tell me about yourself.
    2. -
  2. What are your strengths / weaknesses?
    3. -
  3. Why should we hire you?
    4. -
  4. Tell me about a challenging interaction with a teammate.
    5. -
  5. How do you handle pressure?
    6. -
  6. What is your favorite website?
    7. -
  7. What do you like the most and least about working in this industry?
    8. -
  8. What questions do you have for me?
    9. -
- -

Base Knowledge questions (technical)

-
    -
  1. What is clean code?
    2. -
  2. What development tools have you used?
    3. -
  3. What source control tools have you used?
    4. -
  4. Tell me about the project you are most proud of, and what your contribution was.
    5. -
  5. What is MVC?
    6. -
  6. What is OO? - give an example
    7. -
  7. What is an object?
    8. -
  8. What is a class?
    9. -
  9. What is the relationship between an object and a class?
    10. -
  10. What is the difference between arrays and collection?
    11. -
  11. What is the difference between a symbol and a string?
    12. -
- -

Technical/Logic questions

-
    -
  1. Problem: you have two jars, 50 red marbles, 50 blue marbles. you need to place all the marbles into the jars such that when you blindly pick one marble out of one jar, you maximize the chances that it will be red. (when picking, you’ll first randomly pick a jar, and then randomly pick a marble out of that jar) you can arrange the marbles however you like, but each marble must be in a jar.
    2. -
  2. You have three jars that are all mislabeled. one contains peanut butter jelly beans, another grape jelly jelly beans, and the third has a mix of both (not necessarily a 50/50 mix, could be a 1/99 mix or a 399/22 mix). how many jelly beans would you have to pull out, and out of which jars, to find out how to fix the labels on the jars?
    3. -
  3. What is the most efficient way, memory-wise, to store 1 million phone numbers?
    4. -
  4. How do you find the minimum number in a stack of unordered integers?
    5. -
  5. You have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door. Question: what state are the doors in after the last pass? which are open which are closed?
    6. -
  6. What is the difference between binary search and linear search? Is one always faster than the other? What are the advantages to one over the other?
    7. -
- -
- -
-

Additional Resources

-

Websites

- Code Eval - Solve programming challenges online. -
- Karl Mats- Great resource for technical and soft skill questions. -
- Interview Tips -

Books

- Cracking the Code Interview by Gayle McDowel - -
- -
-

Contact Us

- - Zoe Madden-Wood -
maddenwood@gmail.com -
@hazmatzo - - -
- Laura Montemayor -
laumontemayor@gmail.com -
@laumontemayor -
Two Girls Code Blog - - -
- Eva Gabriela Zamudio -
gabriela.osu@gmail.com -
@hazmatzo - - -
- Chantal Emmanuel -
cemmanuel1@gmail.com -
@chantalemmanuel -
Two Girls Code Blog - - - -
- + +

+
This is a box you can use for various things. To edit the layout of this box, open the style.css and look for the .box1 style. You can edit the width, background color, font size and more.
+ + +
+ +
+
diff --git a/public/style.css b/public/style.css new file mode 100644 index 0000000..43db378 --- /dev/null +++ b/public/style.css @@ -0,0 +1,415 @@ +/* This is the most important file of your site. Please read the notes next to the attributes to learn how the CSS controls various parts of your template. If you want to make notes as I have done just put the comment-out tags around the text as you see here. When I refer to "comment-out" tags here, I'm referring to the slash/asterisk combo surrounding this paragraph. This is is how you comment out text and CSS styles you don't want the browser to read. */ + + +body { +margin: 0; +background-image:url(images/backgrounds/MockUp2.png); /* This adds a background image to the template. If you only want to use a solid color, remove the comment-out tags from around the attribute below and adjust the color to whatever you like. Then place comment-out tags around this one so the background doesn't show. Feel free to browse the backgrounds folder located inside the images folder to test more image backgrounds. For example, replace purpleDesign.jpg with blueCheckers.jpg and see what you get! */ +background-repeat: repeat; + /* background-color: #000; */ /* This background attribute has been commented out because there is already a background image. If you want to use a solid color for the background instead, change the hex color code to #672d67 or whatever you like and remove the comment-out tags from around the attribute. Go to http://www.2createawebsite.com/build/hex-colors.html to generate your own hex colors. */ + +} + + +#container { +width: 1000px; /* If you change the width of the site container, it could break the template. Be careful and be ready to adjust other attributes. */ +margin-right: auto; +margin-left: auto; +background-color: #fff; /* If you change this color, you will also need to change the color of the #leftnav and #sidebar background colors to make everything match. */ +} + + +#header { +width: 1000px; +height: 210px; +position: relative; +/* background-color: #B9C7D4; */ /* If you'd rather have a solid background color instead of an image, remove the comment-out tags from this attribute and change the #B9C7D4 hex color to whatever color you'd like. Then remove or comment-out the next two lines that start with background-image and background-repeat. Check the headers folder inside the images folder for more header images you can use. Feel free to create your own with Paint.net or Photoshop. Try to make them 210 pixels high and 1000 pixels wide so they fit best. */ +background-image: url(images/headers/goldMoney.jpg); +background-repeat: repeat-x; +} + + +#header #tagline { /* This is the text below the logo. Edit the index.html page to edit text. Use attributes below to re-position. */ + + font-family: Arial, Verdana, Geneva, sans-serif; + font-size: 22px; + color: #ccc; + position: absolute; top: 175px; left: 67px; + +} + + +#header #logo { /* This is what positions the logo. Feel free to adjust numbers below to move logo around. There is a logo.psd file in the images folder in case you have a graphics editing program. You can edit the logo there. If not, you can replace this one with your own in the index.html file. */ + + position: absolute; top: 45px; left: 20px; + +} + +#header #title { /* Use this to style your title text if you don't have a logo. Don't forget to un-comment out the code in the index.html file to make this visible in your header. */ + + font-family: Arial, Verdana, Geneva, sans-serif; + font-size: 35px; + color: #000; + font-weight: bold; + position: absolute; top: 55px; left: 67px; + +} + + +#header #socialIcons { /* This controls the positioning of the social media icons in the header. Feel free to adjust positioning. */ + float: left; + position: absolute; top: 174px; left: 390px; +} + +#header #socialIcons ul { + margin: 0; + padding: 0; + +} + +#header #socialIcons ul li { + float: left; + list-style: none; + padding: 4px 2px; /* This controls the spacing between the social media icons. Feel free to adjust positioning. */ +} + + +#headerBanner { /* This code positions the banner in your header. Right now the banner is commented out so you'll need to go to the index.html file to remove the comment out tags. Edit the index.html to add AdSense code or any image that you'd like. */ + + position: absolute; top: 80px; left: 250px; + +} + +#topMenu { /* This is the menu at the very top of the page. */ + + background: #000; /* Controls background color of entire menu */ + float: left; + width: 100%; +} + +#topMenu ul { + margin: 0; + padding: 0; + +} + +#topMenu ul li { + float: left; + font-size: 12px; + list-style: none; + font-family: "Verdana", "Arial", Helvetica, sans-serif; + border-right: 0px solid #000; /* Change 0px to a higher number to add a border between links. */ + border-bottom: 1px solid #000; /* Controls bottom border color of menu links */ + margin-left: 100px; /* If you don't have enough links to fill up the menu, you can center them horizontally by adjusting the margin-left attribute. */ + padding: 0; +} +#topMenu a { /* Controls the style of the menu links */ + background: #000; /* Controls background color of menu links */ + font-size: 12px; + color: #fff; /* Controls text color of menu links */ + display: block; + float: left; + margin: 0; + padding: 8px 44px; /* Controls spacing between top menu links */ + text-decoration: none; +} + +#topMenu a:hover { + background: #672d67; /* Controls hover color of menu links when you mouseover. Feel free to use the background-image attribute instead! */ + color: #fff; + + +} + + +#topMenu2 { /* Controls the menu below the header */ + + background: #000; /* Controls background color of entire menu */ + float: left; + width: 100%; + position: relative; + /*height: 60px; */ /* If you want to adjust the height of the menu, remove the comment-out tags and adjust the number. You'll also have to adjust the padding in #topMenu2 a if you want the borders between the links to go all the way down. */ +} + +#topMenu2 ul { + margin: 0; + padding: 0; + +} + +#topMenu2 ul li { + float: left; /*you can use display:inline instead which will put space between each link*/ + font-size: 12px; + list-style: none; + font-family: "Verdana", "Arial", Helvetica, sans-serif; + border-bottom: 1px solid #000; /* Controls bottom border color of menu links */ + margin-left: 0px; /* If you don't have enough links to fill up the menu, you can center them horizontally by adjusting the margin-left attribute. */ + padding: 0; +} +#topMenu2 a { + background: #000; /* Controls background color of menu links */ + font-size: 12px; + color: #fff; /* Controls text color of menu links */ + display: block; + border-right: 1px solid #fff; /* Adds a border to separate the links. You may choose to remove this altogether. */ + float: left; + margin: 0; + padding: 8px 44px; /* Controls spacing between top menu links */ + text-decoration: none; +} + +#topMenu2 a:hover { + background: #672d67; /* Controls hover color of menu links when you mouseover */ + color: #fff; + + +} + + +#contentWrapper { /* Do not adjust unless you know what you're doing. This is what helps the content appear ahead of the nav in the source code, which can be helpful for SEO. */ +float: left; +width: 100%; +} + +#content { +margin: 0 200px 0 170px; /* These are the left and right margins for the content area. The 200px represents the right margin, the 120 represents the left. This is what helps space out the area around the main content area. Be careful adjusting these values. */ +background-color: #fff; /* Changes the color of the main content area background */ +border-left: 0px solid #E0E0E0; /* Add a border alongside the content colums by changing the 0 to a number. */ +border-right: 0px solid #E0E0E0; /* Add a border alongside the content colums by changing the 0 to a number. */ +padding-left: 10px; /* Controls spacing around content area */ +padding-top: 20px; /* Controls spacing around content area */ +padding-right: 10px; /* Controls spacing around content area */ +font-family: "Verdana", "Arial", Helvetica, sans-serif; +font-size: 12px; + +} + +#leftnav { /* Controls the look of the left nav and links */ +float: left; +width: 160px; +background-color: #fff; /* /* The background color will only travel down to the end of the content. If you change the color and want it to go all the way down to the footer, you'll need to also change the background of the #container to match. See notes under #container style. */ +padding: 5px; +margin-left: -1000px; /* Do not edit unless you know what you are doing. */ +} + +#leftnav ul +{ + margin-left: 0; + padding-left: 0; + list-style-type: none; + font-family: "Arial", "Helvetica", sans-serif; + font-size: 12px; +} + +#leftnav .navlist a /* Styles the nav links */ +{ + display: block; + width: 160px; + padding-top: 10px; /* Controls spacing of the left nav links */ + padding-right: 3px; /* Controls spacing of the left nav links */ + padding-bottom: 10px; /* Controls spacing of the left nav links */ + padding-left: 0px; /* Controls spacing of the left nav links */ + background-color: #fff; + border-bottom-width: 1px; + border-bottom-style: solid; + border-bottom-color: #7A787A; +} + + +#leftnav .navlist a:link, .navlist a:visited /* Styles the active and visited nav link colors */ +{ +color: #000; +text-decoration: none; +font-weight: bold; +} + +#leftnav .navlist a:hover /* Styles the background color when you hover over the nav links */ +{ + color: #000; + background-color: #D6D6D6; +} + + +#leftnav .title { /* This attribute controls the look of the sub titles in the left navigation. */ + + display: block; + /* background-color: #000; */ /* Remove the comment-out tags and comment out the next line if you'd rather have a background color instead of a background image for your navigation titles */ + background-image: url(images/backgrounds/purpleDesign.gif); /* Check the backgrounds folder inside the images folder for more image options. */ + border: 1px solid #ccc; /* Background color of left nav sub titles. Will not show if there is a background above. Comment out above line to show. */ + margin-top: 20px; + padding: 5px 5px; + color: #fff; + font-size: 16px; + font-family: "Verdana", "Arial", Helvetica, sans-serif; + font-weight: bold; + font-size: 18px; + +} + + +.MoreContent p { /* This styles the text below the left nav. */ + font-family: Verdana, Geneva, sans-serif; + color: #000; + font-size: 14px; + line-height: 20px; + +} + +.MoreContent a, .MoreContent a:link, .MoreContent a:visited { /* This styles the links, active links and visited links */ + font-family: "Arial", "Verdana", Helvetica, sans-serif; + color: #000; + text-decoration: underline; + +} + + +.MoreContent a:hover { + color: #C00; + text-decoration: none; + +} + + +#sidebar { /* This is the right column */ +float: left; +width: 195px; /* Highly suggested that you leave alone unless you are sure what you are doing. */ +padding-top: 10px; +margin-left: -195px; /* width and left margin have to be the same or the template may break. */ +background-color: #fff; /* The background color will only travel down to the end of the content. If you change the color and want it to go all the way down to the footer, you'll need to also change the background of the #container to match. See notes under #container style. */ +} + + +#footer { + background-color: #faf7d8; + padding-top: 10px; + clear: both; /* This forces the footer to the bottom of the page. Do not remove this line! */ + +} + + +#footer a { /* Color of footer links. */ + color: #000; + +} + +#footer a.disclaimer { /* Color of footer disclaimer. */ + color: #000; + font-size: 9px; + +} + +#footer a:hover { /* Color of footer links when you mouseover them. */ + color: #672d67; +} + +#footer p { /* Controls footer paragraph text */ + font-family: Verdana, Arial, Helvetica, sans-serif; + font-size: 12px; + line-height: 20px; /* Controls spacing between lines */ + font-weight: bold; +} + + +h1 { /* This styles the H1 tag. */ + font-family: Verdana, Arial, Helvetica, sans-serif; + font-size: 22px; + font-weight: bold; + color: #672d67; + line-height: 24px; + margin-top: 4px; + margin-left: 0px; +} +h2 { + font-family: Verdana, Arial, Helvetica, sans-serif; + font-size: 17px; + font-weight: bold; + color: #5C5B5B; + line-height: 20px; +} +h3 { + font-family: Verdana, Arial, Helvetica, sans-serif; + font-size: 14px; + font-weight: bold; + color: #000000; + line-height: 20px; +} + +p { + font-family: Verdana, Arial, Helvetica, sans-serif; /* This is what controls the paragraph tag text in the body. */ + font-size: 14px; + line-height: 18px; + margin-top: 3px; + margin-right: 0; + margin-bottom: 3px; + margin-left: 0; + padding-bottom: 9px; +} + + +.smalltext { /* This is what controls the small text in the right column. */ + font-family: Verdana, Arial, Helvetica, sans-serif; + font-size: 10px; + padding: 5px; + margin: 3px 0; + line-height: 14px; +} + +a { + color: #672d67; /* This is what controls the link color and style in the body. */ + font-weight: bold; + text-decoration: underline; +} +a:visited { + color: #000000; /* This is what controls the the "visited" links in the body. */ + text-decoration: underline; + font-weight : bold; +} +a:hover { + color: #7A787A; /* This is what controls the the links in the body when you hover with your mouse */ + text-decoration: none; +} + +img { /* Automatically adds padding/spacing around every image. Feel free to add other atributes like border: 1px solid #000; */ + padding: 8px; + +} + +.box1 { /* This controls the look of the box */ + background:#faf7d8; + color: #000; + border:1px solid #672d67; + width: 250px; + height: 120px; + padding-top: 5px; + padding-right: 6px; + font-family: Verdana, Geneva, sans-serif; + font-size: 15px; + padding-bottom: 0; + padding-left: 6px; + line-height: 16px; +} + +.box2 { /* Another box you can use if you wish. */ + background:#faf7d8; + color: #000; + border:1px solid #672d67; + width: 400px; + height: 210px; + padding-right: 6px; + padding-bottom: 0; + padding-left: 6px; + line-height: 16px; + padding-top: 6px; +} + + +#fblike { /* Positions the FB like button for your site over left nav */ + margin: 10px 0 0 42px; /* This spaces the FB like button */ + padding: 0; + display: block; +} + + +.shadow { /* Use this style to add shadows to your elements (header, container, etc.) So in the index.html file just add "class="shadow" inside your
tag. So it will look like this
This will add a shadow around your site container. Adjust colors below. Only works in Chrome, Safari and Firefox, not IE.*/ +-moz-box-shadow: 0 0 3px 5px #999; /* Change the color of the shadow to match your template */ +-webkit-box-shadow: 0 0 30px 5px #999; /* Change the color of the shadow to match your template */ +} diff --git a/public/whiteboard.html b/public/whiteboard.html new file mode 100644 index 0000000..47e45fb --- /dev/null +++ b/public/whiteboard.html @@ -0,0 +1,239 @@ + + + + + + + + Algorithm & Interview Prep Resources + + + + + + + + + + + + + + +
+ +
+ + +
Your Tagline Goes Here
+ +
Algorithm & Interview Prep Resources
+ + + + + + + + +
+ +
+ + +
+

Tips

+
+
    +
  • Remember to talk out loud! - Interviewers want to understand how you think and approach problems, so talk out loud while you’re solving problems. Let the interviewer see how you’re tackling the problem, and they just might guide you as well.
    • +
  • Ask Questions- If you're unsure of the parameters of the question or how to proceed, do be afraid to ask questions or for clarification.
    • +
+ + + + + + + + +

Roman Numerals

+
+ Write a method that converts an integer to its Roman numeral equivalent, i.e., 476 => 'CDLXXVI'. + For reference, these are the building blocks for how we encode numbers with Roman numerals: + I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1000 + Choose Between + Old-school Roman numerals (no subtraction of 4s and 9s) + 4 = IIII, 9 = VIIII etc. + Modern Roman numerals (subtraction) + 4 = IV, 9 = IX, 14 = XIV, 40 = XL, 44 = XLIV, 90 = XC, 944 = CMXLIV +
+ +

Pig Latin

+
+ Write a method the takes in a string and returns the pig latin equivalent. Pig Latin takes the first consonant, moves it to the end of the word and places “ay” at the end. If the string starts with a consonant do nothing. + “pig” = “igpay”, “banana” = “ananabay” +
+ +

Shuffle

+
+ Without using a shuffle or sort write your own shuffle method for an array. The method will take an array and returns a new array with all of the elements in a random order. One important property of a good shuffle method is that every permutation is equally likely. +
+ +

Anagrams

+
+ + An anagram is a word formed by rearranging the letters of another word, e.g., iceman is an anagram of cinema. + + We're going to write a method called anagrams_for that takes as its input a word and an array of words, representing a dictionary, and returns an array consisting of all the anagrams of the input word. + + anagrams_for should return an empty array ([]) if no anagrams are found in the dictionary. You don't have to worry about the order of the returned Array. +
+ +

Factorial

+ +
+ + Write a recursive and iterative solution for a finding the factorial of a number. If you don't remember, the factorial of a non-negative integer n, denoted n! is the product of all positive integers less than . For example, 5! = 5 * 4 * 3 * 2 * 1 +
+ +

Binary vs. Linear Searching

+
+ + Write an example demonstrating Binary Search. + Write an example demonstrating Linear Search. + + Hint: A linear search looks down a list, one item at a time, without jumping. In complexity terms this is an O(n) search - the time taken to search the list gets bigger at the same rate as the list does. + + A binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for, which determines whether the value is in the first or second half of the list. +
+ + +

Fibonacci

+
+ Implement an iterative version of the Fibonacci sequence which take an integer n as input and returns the nth Fibonacci number. + + Implement a recursive version of the Fibonacci sequence which take an integer n as input and returns the nth Fibonacci number. + + In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence:[1][2] + 0,1,1,2,3,5,8,13,21,34,55,89,144 + By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. + In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation + F_n = F_{n-1} + F_{n-2} +
+ +

Apple Stock

+
+ I have an array stockPricesYesterday where the keys are the number of minutes into the day (starting with midnight) and the values are the price of Apple stock at that time. For example, the stock cost $500 at 1am, so stockPricesYesterday[60] = 500. +
+ Write an efficient algorithm for computing the best profit I could have made from 1 purchase and 1 sale of an Apple stock yesterday. +
+ +

Arrays

+
Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? +
+ +
+
Write code to reverse a C-Style String. (C-String means that “abcd” is represented as five characters, including the null character.)
+
+
Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An extra copy of the array is not. Write the test cases for this method.
+ +
Write a method to decide if two strings are anagrams or not.
+ +
+ + +

Lists

+
Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. + + EXAMPLE + + Input: the node ‘c’ from the linked list a->b->c->d->e + Result: nothing is returned, but the new linked list looks like a->b->d->e + +
+
+
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1’s digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list. + + EXAMPLE + Input: (3 -> 1 -> 5) + (5 -> 9 -> 2) + Output: 8 -> 0 -> 8 +
+ +
+
+ Given a circular linked list, implement an algorithm which returns node at the beginning of the loop. + Circular linked list: A (corrupt) linked list in which a node’s next pointer points to an earlier node, so as to make a loop in the linked list. + + EXAMPLE + input: A -> B -> C -> D -> E -> C [the same C as earlier] + output: C +
+ +
+
+ Given two different lists of objects, come up with an efficient solution to find the intersection of the two lists. +
+ +

Trees

+
+ Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that no two leaf nodes differ in distance from the root by more than one. +
+
+
Given a directed graph, design an algorithm to find out whether there is a route between two nodes.
+
+
Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.
+
+
Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, you’ll have D linked lists).
+ + +

Stacks

+
In the classic problem of the Towers of Hanoi, you have 3 rods and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (e.g., each disk sits on top of an even larger one). You have the following constraints: + + (A) Only one disk can be moved at a time. + (B) A disk is slid off the top of one rod onto the next rod. + (C) A disk can only be placed on top of a larger disk. +
+ + +
+
+ +
+ + Write a program to move the disks from the first rod to the last using Stacks. +
+ +
+
+ Write a program to sort a stack in ascending order. You should not make any assumptions about how the stack is implemented. The following are the only functions that should be used to write this program: push | pop | peek | isEmpty. +
+ + + + + +
+ + + +
+
+ +