Skip to content

Commit cc29611

Browse files
mandliyamandliya
committed
Day 57 CTCI 2 problems
1 parent 298502e commit cc29611

File tree

6 files changed

+428
-3
lines changed

6 files changed

+428
-3
lines changed

‎README.md

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44

55
| Current Status| Stats |
66
| :------------: | :----------: |
7-
| Total Problems | 78 |
8-
| Current Streak | 56 |
9-
| Longest Streak | 56 ( August 17, 2015 - October 11, 2015 ) |
7+
| Total Problems | 80 |
8+
| Current Streak | 57 |
9+
| Longest Streak | 57 ( August 17, 2015 - October 12, 2015 ) |
1010

1111
</center>
1212

@@ -78,6 +78,8 @@ Include contains single header implementation of data structures and some algori
7878
| Problem 5 : Edition 6: There are three possible edits that can be performed on a string - Insert a char, Delete a char, Replace a char. Given two strings, determine if they are one or 0 edit away.|[1-5-one-edit-away.cpp ](cracking_the_coding_interview_problems/1-5-one-edit-away.cpp)|
7979
| Problem 6: Implement a method to perform basic string compression. Example string **aabcccccaaa** should be compressed to **a2b1c5a3**, however if compressed string is bigger than original string, return original string| [1-6-string-compression.cpp](cracking_the_coding_interview_problems/1-6-string-compression.cpp)|
8080
| Problem 7: Rotate the matrix clockwise( & anticlockwise) by 90 degrees| [1-7-matrix-rotation.cpp](cracking_the_coding_interview_problems/1-7-matrix-rotation.cpp)|
81+
| Problem 8: Write an algorithm such that if an element of MxN matrix is 0, its entire row and column is set to 0. | [1-8-zero-matrix.cpp](cracking_the_coding_interview_problems/1-8-zero-matrix.cpp)|
82+
| Problem 9: Given two strings s1 and s2, determine s2 is rotation of s1 using only one call to a function which checks whether one string is rotation of another.|[1-9-string-rotation.cpp](cracking_the_coding_interview_problems/1-9-string-rotation.cpp)|
8183

8284
###Dynamic Programming Problems
8385
| Problem | Solution |

‎README.md~

Lines changed: 147 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,147 @@
1+
## Data Structure and Algorithms Problems
2+
3+
<center>
4+
5+
| Current Status| Stats |
6+
| :------------: | :----------: |
7+
| Total Problems | 78 |
8+
| Current Streak | 56 |
9+
| Longest Streak | 56 ( August 17, 2015 - October 11, 2015 ) |
10+
11+
</center>
12+
13+
### LinkedList Problems
14+
| Problem | Solution |
15+
| :------------ | :----------: |
16+
| Find the nth node of linked list from last. | [nthToLastNode.cpp] (linked_list_problems/nthToLastNode.cpp) |
17+
| Add numbers where each digit of the number is represented by node of a linkedlist. Give output as a linked list. | [add_two_numbers_lists.cpp] (linked_list_problems/add_two_numbers_lists.cpp) |
18+
| Swap nodes of a linkedlist without swapping data. | [swapNodesWithoutSwappingData.cpp] (linked_list_problems/swapNodesWithoutSwappingData.cpp) |
19+
| Given a linked list, reverse alternate nodes and append at the end. | [reverseAlternateNodes.cpp](linked_list_problems/reverseAlternateNodes.cpp) |
20+
| Only given a node pointer, delete the node from the linked list. | [deleteNode.cpp](linked_list_problems/deleteNode.cpp) |
21+
| Delete the entire linkedlist. | [deleteLinkedlist.cpp](linked_list/deleteLinkedlist.cpp) |
22+
| Print middle node of linkedlist without iterating twice. | [printMiddleNode.cpp](linked_list_problems/printMiddleNode.cpp) | | Detecting and removing a cycle in linkedlist.| [floyedCycleDetection.cpp](linked_list_problems/floyedCycleDetection.cpp)|
23+
| Determine if a linked list is a pallindrome. | [listPallindrome.cpp](linked_list_problems/listPallindrome.cpp) |
24+
| Insert data in a sorted linked list.|[insertInASortedLinkedList.cpp](linked_list_problems/insertInASortedLinkedList.cpp) |
25+
| Determine the intersection(merging) point of two given linked list.| [findIntersectionPointOfLists.cpp](linked_list_problems/findIntersectionPointOfLists.cpp)|
26+
| Clone a linkedlist which has next and an random pointer, Space Complexity - O(1). | [cloneListWithRandomPtr.cpp](linked_list_problems/cloneListWithRandomPtr.cpp)|
27+
| Given a sorted linked list with duplicates, remove duplicates in one iteration. | [removeDuplicatesFromSortedList.cpp](linked_list_problems/removeDuplicatesFromSortedList.cpp)|
28+
| Find the nth node of linked list from last. | [nthToLastNode.cpp] (linked_list_problems/nthToLastNode.cpp) |
29+
| Sort a linked list using merge sort | [merge_sort.cpp] (linked_list_problems/merge_sort.cpp) |
30+
| Given a singly linked list L<sub>0</sub> -> L<sub>1</sub> -> … -> L<sub>n-1</sub> -> L<sub>n</sub>. Rearrange the nodes in the list (in place) so that the new formed list is : L<sub>0</sub> -> L<sub>n</sub> -> L<sub>1</sub> -> L<sub>n-1</sub> -> L<sub>2</sub> -> L<sub>n-2<sub> ....| [rearrange_list.cpp](linked_list_problems/rearrange_list.cpp)|
31+
32+
### Include
33+
Include contains single header implementation of data structures and some algorithms.
34+
35+
| DS/ALG | Implementation |
36+
| :------------: | :----------: |
37+
| Generic Macros and Algorithms like swap, random number generation | [generic.h](include/generic.h) |
38+
| Generic Stack Implementation | [stack.h](include/stack.h) |
39+
| Generic Queue Implementation | [queue.h](include/queue.h) |
40+
| Generic List Implementation | [list.h] (include/list.h) |
41+
| Binary Search Tree Implementation | [binarySearchTree.h] (include/binarySearchTree.h)
42+
| Quick Sort Implementation | [quickSort.h] (include/quickSort.h) |
43+
| Merge Sort Implementation | [mergeSort.h] (include/bubbleSort.h)|
44+
| Selection Sort Implementation | [selectionSort.h] (include/selectionSort.h) |
45+
| Bubble Sort Implementation | [bubbleSort.h] (include/bubbleSort.h) |
46+
| Linux Kernel Double LinkedList Implementation | [double_linked_list.h](include/double_linked_list.h) |
47+
| Generic Graph Implementation (Adjacency List) | [graph.h](include/graph.h) |
48+
| Heap Sort Implementation | [heap_sort.h](include/heap_sort.h)|
49+
50+
###Bit Manipulation Problems
51+
| Problem | Solution |
52+
| :------------ | :----------: |
53+
| Determine if a number is a power of 2. | [power_of_2.cpp](bit_manipulation/power_of_2.cpp) |
54+
| Add two binary number represented as string. | [addBin.cpp](bit_manipulation/addBin.cpp) |
55+
| Determine the next power of 2 for a given number. | [next_power_of_2.cpp](bit_manipulation/next_power_of_2.cpp) |
56+
| Using bit manipulation determine if a number is multiple of 3. | [multiple_of_3.cpp](bit_manipulation/multiple_of_3.cpp) |
57+
| Determine endianess of the machine, print a number in reverse Endianess. | [reverseEndianness.cpp](bit_manipulation/reverseEndianness.cpp) |
58+
| Find the parity of given number. | [find_parity.cpp](bit_manipulation/find_parity.cpp) |
59+
| Implement fast multiplication of a number to 7 using bit manipulation. | [multiply_by_7.cpp](bit_manipulation/multiply_by_7.cpp) |
60+
| Reverse bits of unsigned integer (two methods - Reversing bit by bit & divide and conquer). | [reverseBitsOfAnInteger.cpp](bit_manipulation/reverseBitsOfAnInteger.cpp) |
61+
| Small function to determine position of right most set bit in a given integer.| [right_most_set_bit.cpp](bit_manipulation/right_most_set_bit.cpp)|
62+
|Given a vector of numbers, only one number occurs odd number of times, find the number.| [find_odd_one_out.cpp](bit_manipulation/find_odd_one_out.cpp)|
63+
| Given two integers, determine if their sum would be interger overflow.| [integerOverflow.cpp](bit_manipulation/integerOverflow.cpp)|
64+
| How many bit flip operation would require to convert number A to B. | [countNumberOfBitFlips.cpp](bit_manipulation/countNumberOfBitFlips.cpp)|
65+
| Given a number x and two positions (from right side) in binary representation of x, write a function that swaps n right bits at given two positions and returns the result. It is also given that the two sets of bits do not overlap.|[swapSetOfBits.cpp](bit_manipulation/swapSetOfBits.cpp)|
66+
| Add two numbers without using any arithmetic operators | [addition_without_operators.cpp](bit_manipulation/addition_without_operators.cpp)
67+
| Louise and Richard play a game. They have a counter set to N. Louise gets the first turn and the turns alternate thereafter. In the game, they perform the following operations: <ul><li>If N is not a power of 2, reduce the counter by the largest power of 2 less than N.</li></ul><ul><li>If N is a power of 2, reduce the counter by half of N.</li></ul> The resultant value is the new N which is again used for subsequent operations.The game ends when the counter reduces to 1, i.e., N == 1, and the last person to make a valid move wins. <ul><li> Given N, your task is to find the winner of the game. If they set counter to 1, Richard wins, because its Louise' turn and she cannot make a move.</li></ul><ul><li>Input Format : -The first line contains an integer T, the number of testcases. T lines follow. Each line contains N, the initial number set in the counter.|[counter_game.cpp](bit_manipulation/counter_game.cpp)|
68+
69+
### Cracking the coding interview problems
70+
| Problem | Solution |
71+
| :------------ | :----------: |
72+
| Problem 1 : Edition 6: Write an algorithm to determine whether a string has unique characters or not. Can we do it without using addtional data structures? | [1-1-hasUniqueChars.cpp](cracking_the_coding_interview_problems/1-1-hasUniqueChars.cpp)|
73+
| Problem 2 : Edition 5: Reverse a string when you are a pass a null terminated C string.|[1-2-edi5-reverseString.cpp ](cracking_the_coding_interview_problems/1-2-edi5-reverseString.cpp)|
74+
| Problem 2 : Edition 6: Given two strings, determine if one is permutation of other.|[1-2-perm-strings.cpp](cracking_the_coding_interview_problems/1-2-perm-strings.cpp)|
75+
| Problem 3 : Edition 5: Write an algorithm to remove duplicate chars from a string.|[1-3-edi5-removeDuplicates.cpp](cracking_the_coding_interview_problems/1-3-edi5-removeDuplicates.cpp)|
76+
| Problem 3 : Edition 6: URLify: Replace all the spaces in a string with '%20'. Preferebly Inplace |[1-3-URLify.cpp](cracking_the_coding_interview_problems/1-3-URLify.cpp)|
77+
| Problem 4 : Edition 6: Given a string, write a function to check if it is a permutation of a pallindrome.|[1-4-pallindrome-permutations.cpp ](cracking_the_coding_interview_problems/1-4-pallindrome-permutations.cpp)|
78+
| Problem 5 : Edition 6: There are three possible edits that can be performed on a string - Insert a char, Delete a char, Replace a char. Given two strings, determine if they are one or 0 edit away.|[1-5-one-edit-away.cpp ](cracking_the_coding_interview_problems/1-5-one-edit-away.cpp)|
79+
| Problem 6: Implement a method to perform basic string compression. Example string **aabcccccaaa** should be compressed to **a2b1c5a3**, however if compressed string is bigger than original string, return original string| [1-6-string-compression.cpp](cracking_the_coding_interview_problems/1-6-string-compression.cpp)|
80+
| Problem 7: Rotate the matrix clockwise( & anticlockwise) by 90 degrees| [1-7-matrix-rotation.cpp](cracking_the_coding_interview_problems/1-7-matrix-rotation.cpp)|
81+
82+
###Dynamic Programming Problems
83+
| Problem | Solution |
84+
| :------------ | :----------: |
85+
| N<sup>th</sup> Fibonacci term using different memoization techniques | [fibonacci.cpp](dynamic_programming_problems/fibonacci.cpp)|
86+
| Longest Common Subsequence Problem | [lcs.cpp](dynamic_programming_problems/lcs.cpp) |
87+
88+
### Tree Problems
89+
| Problem | Solution |
90+
| :------------ | :----------: |
91+
|Iterative Level order traversal of Tree using queue |[levelOrderTraversalIterative.cpp](tree_problems/levelOrderTraversalIterative.cpp)|
92+
|Recursive Level order traveral of Tree | [levelOrderTraversalRecursive.cpp](tree_problems/levelOrderTraversalRecursive.cpp)|
93+
|ZigZag Traversal of Tree | [zigZagTraversal.cpp](tree_problems/zigZagTraversal.cpp)|
94+
|Predecessor and Successor of a given node in Binary Search Tree | [predecessorSuccessor.cpp](tree_problems/predecessorSuccessor.cpp)|
95+
|Given values of two nodes in a Binary Search Tree, find the Lowest Common Ancestor (LCA). Assume that both the values exist in the tree.| [lowest-common-ancestor.cpp](tree_problems/lowest-common-ancestor.cpp)|
96+
|Given a binary tree, print out all of its root-to-leaf paths one per line.| [printAllRootToLeafPath.cpp](tree_problems/printAllRootToLeafPath.cpp)
97+
|Determine if a tree is sum tree. A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes present in its left subtree and right subtree. An empty tree is SumTree and sum of an empty tree can be considered as 0. A leaf node is also considered as SumTree.| [sumTree.cpp](tree_problems/sumTree.cpp)|
98+
|Convert a tree to sumTree, such that each node is sum of left and right subtree of the original tree.| [convert_to_sum_tree.cpp](tree_problems/convert_to_sum_tree.cpp)|
99+
100+
101+
### String Problems
102+
| Problem | Solution |
103+
| :------------ | :----------: |
104+
| Implementation of Robin-Karp algorithm for string search | [robinKarpStringMatching.cpp](string_problmes/robinKarpStringMatching.cpp) |
105+
| Find next permutation of a given string, ie. rearrange the given string sucht a way that is next lexicographically greater string than given string | [next_permutation.cpp](string_problems/next_permutation.cpp)|
106+
| Implementation of Z algorithm for pattern matching | [z.cpp](string_problems/z.cpp)|
107+
108+
### Common Data Structure and logic problems
109+
| Problem | Solution |
110+
| :------------ | :----------: |
111+
| Print the contents of matrix in a spiral order | [matrix_spiral_print.cpp](common_ds_problems/matrix_spiral_print.cpp)
112+
| Given a M x N matrix, rotate it by R rotations anticlockwise, and show the resulting matrix. | [rotate_matrix.cpp](common_ds_problems/rotate_matrix.cpp)|
113+
| Rotate an array by r elements ( left or right ) | [array_rotation.cpp](common_ds_problems/array_rotation.cpp)
114+
115+
### Math Problems
116+
| Problem | Solution |
117+
| :------------ | :----------: |
118+
| Print all the permutations of a string. Example: Permutations of ABC are ABC, ACB, BCA, BAC, CAB, CBA | [string_permutations.cpp] (math_problems/string_permutations.cpp) |
119+
| Euclidean algorithm to find greatest common divisor of two numbers. (Iterative and recursive)|[gcd.cpp](math_problems/gcd.cpp)|
120+
| Implement pow(x,y) using divide and conquer approach. Try implementing it in O(logn)| [pow.cpp](math_problems/pow.cpp)|
121+
| Calculate factorial of large number, say 100 (it will have 158 digits) |[factorial_of_large_num.cpp](math_problems/factorial_of_large_num.cpp)|
122+
| Generate all possible words from a number entered on a traditional mobile keypad | [phone_digits.cpp](math_problems/phone_digits.cpp)|
123+
124+
### Stack Problems
125+
| Problem | Solution |
126+
| :------------ | :----------: |
127+
| We have series of n daily price quotes for a stock. We need to calculate span of stock's price for all n days. Span for ith day is defined as maximum number of consecutive days, for which the price of the stock was less than or equal to ith day. For stock quotes {100, 60, 70, 65, 80, 85} span will be {1, 1, 2, 1, 4, 5}. Span for day 1 is always 1, now for day 2 stock is at 60, and there is no day befor it when stock was less than 60. So span remains 1. For day 3, the stock is priced at 70, so its span is 2, as previous day it was 60, and so on. | [stock_span_problem.cpp](stack_problems/stock_span_problem.cpp) |
128+
| Given an infix expression, convert it to postfix expression, Example (A+B)\*C --> AB+C\* | [infix_to_postfix.cpp](stack_problems/infix_to_postfix.cpp) |
129+
130+
### Sort and Search Problems
131+
| Problem | Solution |
132+
| :------------ | :----------: |
133+
| Given a sorted vector, return first index of the occurrence of a value in vector, if number does not exist, return -1 | [first_occurrence_binary_search.cpp](sort_search_problems/first_occurrence_binary_search.cpp) |
134+
| Given a list of unsorted integers, A={a<sub>1</sub>,a<sub>2</sub>,…,a<sub>N</sub>}, Find the pair of elements that have the smallest absolute difference between them? If there are multiple pairs, find them all.| [closest_numbers.cpp](sort_search_problems/closest_numbers.cpp)|
135+
136+
### Graph Problems
137+
| Problem | Solution |
138+
| :------------ | :----------: |
139+
| Depth First Traversal of a Graph | [dfsDemo.cpp](graph_problems/dfsDemo.cpp) |
140+
| Breadth First Traversal of a Graph | [bfsDemo.cpp](graph_problems/bfsDemo.cpp) |
141+
| calculate the shortest distance from the start position (Node S) to all of the other nodes in the graph using Dijkstra algorithm. | [dijkstra-shortest-reach.cpp](graph_problems/dijkstra-shortest-reach.cpp)|
142+
143+
###Greedy Problems
144+
| Problem | Solution |
145+
| :------------ | :----------: |
146+
| Given two integer arrays, A and B, each containing N integers. You are free to permute the order of the elements in the arrays. Is there an permutation A', B' possible of A and B, such that, A'<sub>i</sub>+B'<sub>i</sub> ≥ K for all i, where A'<sub>i</sub> denotes the i<sup>th</sup> element in the array A' and B'<sub>i</sub> denotes i<sup>th</sup> element in the array B'.| [two_arrays.cpp](greedy_problems/two_arrays.cpp)|
147+
|John is taking orders. The i<sup>th</sup> order is placed by the i<sup>th</sup> customer at t<sub>i</sub> time and it takes d<sub>i</sub> time to procees. What is the order in which the customers will get their orders? (see more details in solutions's comments)|[orders_order.cpp](greedy_problems/orders_order.cpp)|

‎cracking_the_coding_interview_problems/1-8-zero-matrix.cpp

Lines changed: 119 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,119 @@
1+
/**
2+
* Cracking the coding interview 1.8
3+
* Write a space efficient algorithm, such that if an element in MxN is 0, the entire row and column containing it are 0.
4+
*
5+
* Approach:
6+
* We can use a boolean matrix of MxN or a bit vector to mark row and columns to be nullified in first iteration, but it wont be space efficient.
7+
* More space efficient would be to first check first row and column and if any of them contains zero, mark them to be nullified using two boolearn vars
8+
* let's say firstRow and firstCol, and then iterate through rest of the matrix and store information in first row column elements, only when that row
9+
* and column is to be marked for nullified, this way we will only store values in elements of first row and column which are marked for zeroed any ways.
10+
*/
11+
12+
#include <iostream>
13+
14+
void nullifyRow( int ** matrix, int N, int row ) {
15+
for ( int j = 0; j < N; ++j ) {
16+
matrix[row][j] = 0;
17+
}
18+
}
19+
20+
void nullifyCol( int ** matrix, int M, int col ) {
21+
for ( int i = 0; i < M; ++i ) {
22+
matrix[i][col] = 0;
23+
}
24+
}
25+
26+
27+
void nullifyMatrix( int ** matrix, int M, int N ) {
28+
bool firstRow = false;
29+
bool firstCol = false;
30+
31+
//first row
32+
for( int i = 0; i < N; ++i ) {
33+
if ( matrix[0][i] == 0 ) {
34+
firstRow = true;
35+
break;
36+
}
37+
}
38+
39+
//first col
40+
for ( int i = 0; i < M; ++i ) {
41+
if ( matrix[i][0] == 0 ) {
42+
firstCol = true;
43+
break;
44+
}
45+
}
46+
47+
//rest of the matrix
48+
for( int i = 1; i < M; ++i ) {
49+
for ( int j = 1; j < N; ++j ) {
50+
if ( matrix[i][j] == 0 ) {
51+
matrix[i][0] = 0;
52+
matrix[0][j] = 0;
53+
}
54+
}
55+
}
56+
57+
//now we know which row and column to be nullify using information stored in previous step.
58+
//rows first
59+
for ( int i = 1; i < M; ++i ) {
60+
if ( matrix[i][0] == 0 ) {
61+
nullifyRow(matrix, N, i);
62+
}
63+
}
64+
65+
//cols now
66+
for ( int j = 1; j < N; ++j ) {
67+
if ( matrix[0][j] == 0 ) {
68+
nullifyCol(matrix, M, j);
69+
}
70+
}
71+
72+
//now first row
73+
if ( firstRow ) {
74+
nullifyRow(matrix, N, 0);
75+
}
76+
77+
//now first col
78+
if ( firstCol ) {
79+
nullifyCol(matrix, M, 0);
80+
}
81+
82+
}
83+
84+
void printMatrix( int ** matrix, int M, int N ) {
85+
for ( int i = 0; i < M; ++i ) {
86+
for ( int j = 0; j < N; ++j ) {
87+
std::cout << matrix[i][j] << " ";
88+
}
89+
std::cout << std::endl;
90+
}
91+
std::cout << std::endl;
92+
}
93+
94+
95+
int main()
96+
{
97+
int M, N;
98+
std::cout << "Enter number of rows:";
99+
std::cin >> M;
100+
std::cout << "Enter number of cols:";
101+
std::cin >> N;
102+
int ** matrix = new int*[M];
103+
for ( int i =0; i < M; ++i ) {
104+
matrix[i] = new int[N];
105+
}
106+
std::cout << "Provide M x N matrix \n";
107+
for ( int i = 0; i < M; ++i ) {
108+
for ( int j = 0; j < N; ++j ) {
109+
std::cin >> matrix[i][j];
110+
}
111+
}
112+
113+
std::cout << "Matrix Before:\n";
114+
printMatrix(matrix, M, N);
115+
nullifyMatrix(matrix, M, N);
116+
std::cout << "Matrix After:\n";
117+
printMatrix(matrix, M, N);
118+
return 0;
119+
}

0 commit comments

Comments
 (0)