You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-3Lines changed: 5 additions & 3 deletions
Original file line number
Diff line number
Diff line change
@@ -135,7 +135,8 @@ Include contains single header implementation of data structures and some algori
135
135
| Test cases for self created string library |[pstring_test.cpp](string_problems/pstring_test.cpp)|
136
136
137
137
### Common Data Structure and logic problems
138
-
| Problem | Solution || :------------ | :----------: |
138
+
| Problem | Solution |
139
+
| :------------ | :----------: |
139
140
| Print the contents of matrix in a spiral order | [matrix_spiral_print.cpp](common_ds_algo_problems/matrix_spiral_print.cpp)
140
141
| Given a M x N matrix, rotate it by R rotations anticlockwise, and show the resulting matrix. |[rotate_matrix.cpp](common_ds_algo_problems/rotate_matrix.cpp)|
141
142
| Rotate an array by r elements ( left or right ) | [array_rotation.cpp](common_ds_algo_problems/array_rotation.cpp)
@@ -144,9 +145,10 @@ Include contains single header implementation of data structures and some algori
144
145
| You are given an integer N. Find the digits in this number that exactly divide N (division that leaves 0 as remainder) and display their count. For N=24, there are 2 digits (2 & 4). Both of these digits exactly divide 24. So our answer is 2. See more details in header comment of the solution file. |[findDigits.cpp](common_ds_algo_problems/findDigits.cpp)|
145
146
| Encrypt and then decrypts a text using Caeser Cipher. |[caeser_cipher.cpp](common_ds_algo_problems/caeser_cipher.cpp)|
146
147
| Encrypt and then decrypts a text using Vigenère cipher. |[vigenere_cipher.cpp](common_ds_algo_problems/vigenere_cipher.cpp)|
147
-
| Generate binary numbers between 1 to N efficiently. |[n_binary.cpp](common_ds_algo_problems/n_binary.cpp)|
148
+
| Generate binary numbers between 1 to N efficiently. |[n_binary.cpp](common_ds_algo_problems/n_binary.cpp)|
148
149
149
-
### Math Problems| Problem | Solution |
150
+
### Math Problems
151
+
| Problem | Solution |
150
152
| :------------ | :----------: |
151
153
| 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)|
152
154
| Euclidean algorithm to find greatest common divisor of two numbers. (Iterative and recursive)|[gcd.cpp](math_problems/gcd.cpp)|
0 commit comments