Sunday common C++ interview problem: Shortest path to all keys. Given a map represented as std::vector<std::vector<char>>, where: - # are impassable walls - @ is the entrance to the puzzle - the first k lowercase letters are keys - the corresponding uppercase letters are locked doors Assuming k <= 6, determine the length of the shortest path that collects all keys, -1 if none exists. Solve it yourself: https://lnkd.in/eY6YGU7K Solution: https://lnkd.in/eFhSBGHC #cpp #cplusplus #coding #programming #dailybiteofcpp
Šimon Tóth’s Post
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development