1 of 25

ACM GIM

2 of 25

https://linktr.ee/bingacm

Everything is there!

I LOVE QR CODES!!!

3 of 25

OUR EBOARD

PUTTING THEM ALL ON BLAST!!!

woooooooooo

4 of 25

President

5 of 25

Vice President

6 of 25

Treasurer

7 of 25

Secretary

8 of 25

Webmaster

9 of 25

Social Media Manager

10 of 25

Project Manager

11 of 25

Project Manager

12 of 25

Project Manager

13 of 25

Senior Advisor

14 of 25

Senior Advisor

15 of 25

What is ACM?

  • Association for Computing Machinery
  • World’s largest educational and scientific computing society
  • 70-year-old organization
  • Founded in New York
  • ACM provides the computing field’s premier Digital Library of leading-edge publications, conferences, and career resources

16 of 25

BINGHAMTON ACM

  • Meets every Wednesday at 7:30 pm - 8:30 pm
  • Locations will change so keep an eye out
  • Weekly presentations on various computer science topics
    • Important topics outside data structures
  • Semesterly Competition
    • October 30th
  • Discord
    • :)�

17 of 25

Competitions

  • Two hours to solve programming problems
    • All skill levels welcome
  • Top placing competitors win prizes
    • Normally around $200 in prizes
  • Free to use any Hackerrank supported programming language
  • Hosted on hackerrank.com
    • This is what most companies use for OA!
  • Free food!

​

18 of 25

Workshops

  • Fall
    • DSA
  • Spring
    • More variety

​

19 of 25

Projects Division

  • Start and finish a project during the Fall 2024 semester
  • Meet weekly with your team
  • Interest form available

​

20 of 25

21 of 25

Executive Board

  • Applications open soon!
    • We heavily prefer more active members
  • Responsibilities
    • Presentations
    • Coding Competition Questions
    • Specialized E-Board Position
  • ACM Name + Leadership on your resume!

22 of 25

Brute Force

23 of 25

Sample Problem

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

​

24 of 25

25 of 25

My Solution

class Solution:

def maxArea(self, height: List[int]) -> int:

​

maxArea = 0

left, right = 0, len(height) - 1

​

while left < right:

area = (right - left) * min(height[left], height[right])

if area > maxArea:

maxArea = area

if height[left] > height[right]:

right -= 1

else: left += 1

return maxArea

​