Categories
- All categories
- Job Opportunities 2,002
- TechNews 5
- Work Life Balance 22
- Interview-Experiences 637
- CTC (compensation details) 154
- Tutorials-Roadmap 42
- Contest 5
- Online Assessments 1,471
- Coding Resources 29
- DataScience|ML-AI 13
- Algorithms and Problems 49
- Company-wise-questions 15
- Beginners 14
- FAANG 33
- Advice/Suggestion/Opinion 66
- Competitive-Programming 38
- System Design 3
- Gate 3
- Service-based-companies 151
- Web-Development 15
- Fun and Memes 7
Get best answers to any doubt/query/question related to programming , jobs, gate, internships and tech-companies. Feel free to ask a question and you will receive the best advice/suggestion related to anything you ask about software-engineering , development and programming problems .
Related questions
- Chocolates - Problem Description Bittu is a chocolate-loving kid playing a game where he can choose bags of chocolates. Each bag has a different number of chocolates Bittu starts with k chocolates and 1 point. He has two choices for each bag: 1. Accept the Bag: • If the chocolates in the bag are fewer than or equal to the chocolates Bittu has, he won't accept the bag Instead, he'll deduct the bag's chocolates from his stash and gain one point. • If the chocolates in the bag are more than what Bittu has, he can accept the bag His chocolate stash increases by the bag's chocolates, and he loses one point. 2. Ignore the Bag: • Bittu can choose to ignore any number of bags without any consequences. The goal is to maximize Bittu's points. Given
- From where I can access the DSA Ramp up tutorial I am clicking on the page but it is redirecting me to same page or 512
- If solve all the Problems from Striver sheet is enough to get into amazon ? please can any one share their preparation strategy which got them landing in amazon ?
- How to get good at trees in OA or Competitive Programming in 2022 || [List of problems to solve] ?
- Atlassian | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-29