Skip to contentSkip to footer
  • Community
  • Jobs
  • Companies
  • Salaries
  • For employers
      Notifications

      Loading...

      Elevate your career

      Discover your earning potential, land dream jobs, and share work-life insights anonymously.

      employer cover photo
      employer logo
      employer logo

      LessThan3

      Is this your company?

      About
      Reviews
      Pay and benefits
      Jobs
      Interviews
      Interviews
      Related searches: LessThan3 reviews | LessThan3 jobs | LessThan3 salaries | LessThan3 benefits
      LessThan3 interviewsLessThan3 Junior Full Stack Developer interviewsLessThan3 interview


      Glassdoor

      • About / Press
      • Awards
      • Blog
      • Research
      • Contact Us
      • Guides

      Employers

      • Free Employer Account
      • Employer Centre
      • Employers Blog

      Information

      • Help
      • Guidelines
      • Terms of Use
      • Privacy and Ad Choices
      • Do Not Sell Or Share My Information
      • Cookie Consent Tool
      • Security

      Work With Us

      • Advertisers
      • Careers
      Download the App

      • Browse by:
      • Companies
      • Jobs
      • Locations
      • Communities
      • Recent posts

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" and logo are proprietary trademarks of Glassdoor LLC.

      Followed companies

      Stay ahead in opportunities and insider tips by following your dream companies.

      Job searches

      Get personalised job recommendations and updates by starting your searches.

      Top companies for "Compensation and Benefits" near you

      avatar
      Amazon
      3.7★Compensation and benefits
      avatar
      Deloitte
      3.5★Compensation and benefits
      avatar
      IBM
      3.6★Compensation and benefits
      avatar
      Starbucks
      3.6★Compensation and benefits

      Bowls

      Get actionable career advice tailored to you by joining more bowls.

      Company Bowl sample

      Want the inside scoop on your own company?

      Check out your Company Bowl for anonymous work chats.

      Junior Full Stack Developer Interview

      Aug 30, 2023
      Anonymous interview candidate
      Calgary, AB
      No offer
      Negative experience
      Average interview

      Application

      I applied online. The process took 3 weeks. I interviewed at LessThan3 (Calgary, AB) in Jul 2023

      Interview

      First interview: Behavioural questions: Tell us about yourself Why do you want to work here? What is your 5 year plan? How did you handle conflict with a co-worker? General technical knowledge: An example of a design pattern and its use operators used in different languages Database (de)normalization primary/foreign keys Word relationships: Given three words, find the word or concept that is related to all of them - Ex: Given "Barn, Back, Court", the answer is "Yard" - Ex: Given "Dime, Pluto, Rhode Island", the answer is "Smallest of their respective set" Problem-Solving Question: You are given two magical eggs and need to determine at what floor they'll break at when dropped from one of the floors of a 100-storey building. When the egg lands it will either break and you can no longer use it, or it will not break and you can continue to use it. Start with the most inefficient, then describe the most efficient strategies to determine the worst-case number of drops required to determine what floor the eggs will break at. - Most inefficient case: Start from the bottom and work your work to the top. Answer: 100 drops. - Better: Binary search - drop one egg from floor 50, then work your way up or down (depending on the result). Answer: 50 drops - 1 at floor 50 and 49 to test with second egg. - Best: Drop first egg every 10 floors. In the worst case, it will break on floor 100, so you need to test second egg between floor 91 and 99. Answer: 19 drops. - Optimal: 14 drops, though I'm not sure how to get this answer. Second interview: 25-minute paper-based IQ test - Given 3 shapes in a pattern, what's the next shape in the pattern? - Given two shapes, what shapes are most analogous but with a different meaning? 25-minute whiteboard interview - Design an algorithm to shift items in an array k spaces to the right 5-minute review of your resume - Why do you want to work at LessThan3? 5-minute chance to ask them questions After the second interview, they said they'd pick their candidate and respond to all interviewees with the results. They never got back to me.

      Interview questions [4]

      Question 1

      General technical questions: An example of a design pattern and its use operators used in different languages Database (de)normalization primary/foreign keys
      Answer question

      Question 2

      Word relationships: Given three words, find the word or concept that is related to all of them - Ex: Given "Barn, Back, Court", the answer is "Yard" - Ex: Given "Dime, Pluto, Rhode Island", the answer is "Smallest of their respective set"
      Answer question

      Question 3

      Problem-Solving Question: You are given two magical eggs and need to determine at what floor they'll break at when dropped from one of the floors of a 100-storey building. When the egg lands it will either break and you can no longer use it, or it will not break and you can continue to use it. Start with the most inefficient, then describe the most efficient strategies to determine the worst-case number of drops required to determine what floor the eggs will break at. - Most inefficient case: Start from the bottom and work your work to the top. Answer: 100 drops. - Better: Binary search - drop one egg from floor 50, then work your way up or down (depending on the result). Answer: 50 drops - 1 at floor 50 and 49 to test with second egg. - Best: Drop first egg every 10 floors. In the worst case, it will break on floor 100, so you need to test second egg between floor 91 and 99. Answer: 19 drops. - Optimal: 14 drops, though I'm not sure how to get this answer.
      Answer question

      Question 4

      Design an algorithm to shift items in an array k spaces to the right
      Answer question