ssajnani
Double Bachelors in Computer Science and Biochemistry from the University of Western Ontario.
Toronto, Ontario
Pinned Repositories
-Challenge-What-s-my-number-
Between 1 and 1000, there is only 1 number that meets the following criteria. While it could be manually figured out with pen and paper, it would be much more efficient to write a program that would do this for you. With that being said, your goal is to find out which number meets these criteria. The number has two or more digits. The number is prime. The number does NOT contain a 1 or 7 in it. The sum of all of the digits is less than or equal to 10. The first two digits add up to be odd. The second to last digit is even. The last digit is equal to how many digits are in the number. If you figure it out, post your code!
3D_Snake_Hologram
3D pyramid-based snake game derived from the Pepper's ghost illusion((Project))
alexandria
Toolbox for my daily work
alpine-opencv-docker
Pre-built OpenCV for armhf Alpine Linux 3.6
AUX
Spotify playlist designed to gather suggestions from a group of people ((Project))
Capacity
Discover the density of people at different locations ((Project))
casbin-ex
An authorization library that supports access control models like ACL, RBAC, ABAC in Elixir
CompareImages
Mapsical
Map-based social feed ((Project))
ssajnani.github.io
Samar's Webpage
ssajnani's Repositories
ssajnani/gitTutorial
CS2212 GitHub Tutorial
ssajnani/-Challenge-What-s-my-number-
Between 1 and 1000, there is only 1 number that meets the following criteria. While it could be manually figured out with pen and paper, it would be much more efficient to write a program that would do this for you. With that being said, your goal is to find out which number meets these criteria. The number has two or more digits. The number is prime. The number does NOT contain a 1 or 7 in it. The sum of all of the digits is less than or equal to 10. The first two digits add up to be odd. The second to last digit is even. The last digit is equal to how many digits are in the number. If you figure it out, post your code!