Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
I
interview-2021
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
public
interview-2021
Commits
e71d672f
Commit
e71d672f
authored
Jun 22, 2021
by
sachin.shukla
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update Readme.md
parent
e434ec59
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
3 deletions
+3
-3
Readme.md
Readme.md
+3
-3
No files found.
Readme.md
View file @
e71d672f
...
...
@@ -6,7 +6,7 @@ to convert the negative number into binary.
Sample Input: if a given number is
<b>
35
</b>
, the method should return
<b>
100011
</b>
write your code under
<b>
src/main/java/exam/ConvertToBinary#toBinary()
- (3) Marks.
</b>
method
write your code under
<b>
src/main/java/exam/ConvertToBinary#toBinary()
method - (3) Marks.
</b>
----------------
...
...
@@ -18,7 +18,7 @@ e.g. if the array input is <b>1,2,3,4,5</b>
then the implementation of shift method should shift the element and also the last element (5) should come to the first place
and hence the final output should be
<b>
5,1,2,3,4
</b>
write your code under
<b>
src/main/java/exam/ShiftElementsInArray#shift()
- (3) Marks.
</b>
method
write your code under
<b>
src/main/java/exam/ShiftElementsInArray#shift()
method - (3) Marks.
</b>
----------------
...
...
@@ -43,7 +43,7 @@ all the weights range from 1 to w.
`2,3`
write your code under
<b>
src/main/java/exam/CountCombinations#getNumberOfWays()
- (4) Marks.
</b>
method
write your code under
<b>
src/main/java/exam/CountCombinations#getNumberOfWays()
method - (4) Marks.
</b>
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment