Enter legal issue and location
Updated: 03/31/2021
Your Profile? Update Now
Overview
Zachary L. (“Zac”) Lessard is an associate currently working out of the firm’s Kewanee office. Zac graduated from Western Illinois University in Macomb, Illinois where he graduated cum laude with a bachelor of science in Computer Science and Information Systems in 2008. Zac also graduated with his Master's degree in Computer Science in 2010 and his Master's degree in Business Administration in 2013. Zac attended law school at Southern Illinois University in Carbondale...
More Zachary L. (“Zac”) Lessard is an associate currently working out of the firm’s Kewanee office. Zac graduated from Western Illinois University in Macomb, Illinois where he graduated cum laude with a bachelor of science in Computer Science and Information Systems in 2008. Zac also graduated with his Master's degree in Computer Science in 2010 and his Master's degree in Business Administration in 2013. Zac attended law school at Southern Illinois University in Carbondale... Zachary L. (“Zac”) Lessard is an associate currently working out of the firm’s Kewanee office. Zac graduated from Western Illinois University in Macomb, Illinois where he graduated cum laude with a bachelor of science in Computer Science and Information Systems in 2008. Zac also graduated with his Master's degree in Computer Science in 2010 and his Master's degree in Business Administration in 2013. Zac attended law school at Southern Illinois University in Carbondale. While at Barash & Everett, Zac will focus his practice on family law, estate planning and corporate and business law. - Law Firm Info
- Reviews
- Go through email verification, and reviewers must verify their email addresses.
- Can be confirmed and flagged as a verified client by law firms.
- Can be reported and subjected to removal if they violate FindLaw.com's Terms of Service.
FindLaw.com is doing its part in combating fake reviews. All reviews:
Click here to view our Terms of Service.
Write Your Review
Fields marked with an * are required