silva
/
ctci
mirror of https://github.com/viniciusfdasilva/ctci.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix: reordering and fix of small errors

This commit is contained in:
anebz 2019-09-19 09:30:43 +02:00
parent b7cba109ed
commit 6280172289
5 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
02. Linked lists/2.2. return_kth_to_last.md
View File

@ -10,7 +10,7 @@ class Node {
int data; int data;
public Node(int d){ public Node(int d){
data = d; this.data = d;
} }
void appendToTail(int d){ void appendToTail(int d){

0
02. Linked lists/delete_node.java → 02. Linked lists/hackerrank/delete_node.java
View File

0
02. Linked lists/get_kth_node_value.java → 02. Linked lists/hackerrank/get_kth_node_value.java
View File

2
08. Recursion/8.3. magic_index.md
View File

@ -1,6 +1,6 @@
# 8.3. Magic index # 8.3. Magic index
## Given an array of **distinct** integers, find a magix index, ifo ne exists. A magic index in an array A is an index such that A[i] = 1 ## Given an array of **distinct** integers, find a magix index, if one exists. A magic index in an array A is an index such that A[i] = 1
## First idea ## First idea

6
16. Moderate problems/16.17. max_subarray.md
View File

@ -1,8 +1,8 @@
# 16.8. Contiguous sequence or Maximum subarray problem # 16.8. Contiguous sequence or Maximum subarray problem
## Given an array of integers, both negative and positive, find the contiguous sequence with the largest sum. Return the sum > Given an array of integers, both negative and positive, find the contiguous sequence with the largest sum. Return the sum
> example: Example:
```bash ```bash
nums = [2, -8, 3, -2, 4, -10] nums = [2, -8, 3, -2, 4, -10]
@ -101,4 +101,4 @@ We only want negative numbers inculded in the sequence when they are in the midd
My code is exactly the same as the solution! (except for some unecessary variables I had). My code is exactly the same as the solution! (except for some unecessary variables I had).
If all numbers in the array are negative, can we consider a subsequence of length = 0 and thus maxval = 0? or does it need to have 1+ values? this is a good thing to consider with the interviewer. If all numbers in the array are negative, can we consider a subsequence of length = 0 and thus maxval = 0? or does it need to have 1+ values? this is a good thing to consider with the interviewer.