0 Answers
Categories
- All categories
- Job Opportunities 2,013
- TechNews 6
- Work Life Balance 22
- Interview-Experiences 648
- CTC (compensation details) 154
- Tutorials-Roadmap 42
- Contest 5
- Online Assessments 1,524
- 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
- Google | Find a subset of size "K" in an array with maximum sum such that any 2 selected numbers in the subset are not at adjacent positions in the original array
- How to find the count of subarrays in an array whose sum is odd in O(N) time complexity ?
- How to find the maximum value of (a[i] + a[j] + i - j ) over all the pairs (i,j) in an array in O(N) time ?
- How to find the maximum value of (a[i] + a[j] + i + j ) over all the pairs (i,j) in an array in O(N) time ?
- Find the subarray with least sum in the given array in O(N) time