Hi, I was asked some graph related problem. I solved the problem on my own using DFS (after explaining to interviewer).
After writing the code, interviewer asked me a follow up, which I did.
Then, interviewer asked me the reason for DFS, he mentioned DFS or BFS is better? I then said, yes BFS is better. Then, immediately solved the problem with BFS (clean & quick).
I believe I am interviewing for L5.
Is my coding peformance Hire/Lean Hire/ No Hire for L5 ?
Is this Hire/Lean Hire/ NO hire for L4 ? #tech #google
Want to see the real deal?
More inside scoop? View in App
More inside scoop? View in App
blind
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
FOLLOWING
Industries
Job Groups
- Software Engineering
- Product Management
- Information Technology
- Data Science & Analytics
- Management Consulting
- Hardware Engineering
- Design
- Sales
- Security
- Investment Banking & Sell Side
- Marketing
- Private Equity & Buy Side
- Corporate Finance
- Supply Chain
- Business Development
- Human Resources
- Operations
- Legal
- Admin
- Customer Service
- Communications
Return to Office
Work From Home
COVID-19
Layoffs
Investments & Money
Work Visa
Housing
Referrals
Job Openings
Startups
Office Life
Mental Health
HR Issues
Blockchain & Crypto
Fitness & Nutrition
Travel
Health Care & Insurance
Tax
Hobbies & Entertainment
Working Parents
Food & Dining
IPO
Side Jobs
Show more
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
comments
DFS = find whether a path can reach a destination
BFS = find shortest path to a destination