About Us
A place for all those who wanna code.
Codengers is a place where programmers/developers join us and solve programming problems in a wide range of computer science domain such as Algorithm, Machine learning,etc.
Get involved in opensource projects with us, build/learn something new anytime anywhere,Discuss your problem with us and much more things to do!!!
We are also the part of the world's largest coding community i.e. the Coderdojo which comes under RasberryPi Foundation and also we are a part of Mozilla Campus Club Network.
- Anyone can join us on Slack.
- Get Daily Practice Problem.
- Prepare yourself for upcoming interviews.
- Courses on demand.
Daily Problem
This problem was asked by Amazon.
PROBLEM [Medium]
Given a string s and an integer k, break up the string into multiple lines such that each line has a length of k or less. You must break it up so that words don't break across lines. Each line has to have the maximum possible amount of words. If there's no way to break the text up, then return null.
You can assume that there are no spaces at the ends of the string and that there is exactly one space between each word.
For example Given the string "the quick brown fox jumps over the lazy dog" and k = 10, you should return: ["the quick", "brown fox", "jumps over", "the lazy", "dog"]. No string in the list has a length of more than 10.
Team
UGI CODING COMMUNITY 2019-2020 TEAM MEMBERS
Abhishek Kumar Shukla
Founder
Kuwar Prateek Singh
Tejasvi Srivastav
Surabhi Srivastav
Suvarna Bose
Siddhant Bajola
Mohd Shoaib Naseem
