attempted leetcode's weekly contest 505 solved 2/4 problems q1 ️ - Sum Of Compatible Numbers In Range 1 traverse from i=1 to n+k and if abs(n-i)<=k && (n&i)==0 then add i to ans, at last return ans ...
Week 1 Foundation: Basics of Programming Day 1-2: Learn variables, data types, loops (for, while). Day 3-4: Conditionals, functions. Day 5-6: Arrays & Strings basics. Day 7: Solve 10 simple ...
This repository contains my learning notes, coding exercises, and practice solutions from the Coursera course Foundations of Data Structures & Algorithms. The purpose of this repository is to build a ...
DFS (Depth-First Search) and BFS (Breadth-First Search) are two of the most important graph and tree traversal algorithms used in coding interviews, competitive programming, and real-world software ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results