| // This week's question: | |
| // Given a positive number N, generate binary numbers between 1 to N | |
| // using a queue-type structure in linear time. | |
| // Example: | |
| // > binaryQueue(10) | |
| // > 1 10 11 100 101 110 111 1000 1001 1010 | |
| function binaryQueue(n) { | |
| const queue = []; |
I see you have chosen to level up your technical writing skills. Drop a comment here with your Hashnode username or create an account here if you haven't already.
We will add you as contributors on the "The Next Big Writer" publication and you will be able to see it in dropdown while submitting your draft.
See you on the other side 👋🏼
This gist is associated with the https://thenextbigwriter.tech/ mentorship program.
| (function ( ) { | |
| // keyof: This created a literal type where new type will be equal to keyof type | |
| interface Resume { | |
| name: string, | |
| education: string, | |
| skills: Array<string> | |
| } |
