Math
Categories:
Code Problem / Data Structures and Algorithms / Recursion (32)
Code Problem / Data Structures and Algorithms / Binary Search (30)
Code Problem / Data Structures and Algorithms / Linked Lists (26)
Code Problem / Data Structures and Algorithms / Backtracking (26)
Code Problem / Data Structures and Algorithms / Stacks and Queues (25)
Code Problem / Data Structures and Algorithms / Hashing (24)
Databases / SQL / Backup and Recovery (19)
Code Problem / Data Structures and Algorithms / Arrays and Strings (19)
Databases / SQL / Database Normalization (18)
Code Problem / Data Structures and Algorithms / Time Complexity (17)
Databases / SQL / Locking (16)
Databases / SQL / Replication (15)
Databases / SQL / SQL Queries (13)
Code Problem / Data Structures and Algorithms / Graphs (13)
Databases / SQL / Database Security (13)
More...
Recent solutions:
Check these solutions from our community:
None
About this solution: The candidate's solution is complete and solves the problem. The candidate's approach is to first find the adjacency matrix A, then the matrix giving the number of 3 step walks, then the generating function for walks from point i → j, and finally the generating function for walks from points 1 → 3.
None
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The approach is straightforward and easy to follow.
None
About this solution: The candidate's solution is correct. They have provided the adjacency matrix and have correctly found the number of 3 step walks and the generating function for walks from points 1-3.