m = n & (d - 1); where d= (1 << k)
Posts
9 months ago
Feb 23, 2008
Subscribe to:
Post Comments (Atom)
skip to main |
skip to sidebar
Feel free to contribute, however it will be moderated to curb spams.
Contributors
Labels
- Arrays (12)
- Backtracking (3)
- Bit Twiddling (5)
- Coin Puzzles (2)
- Common Puzzles (2)
- Data Structure (4)
- Dynamic Programming (3)
- Graph Algorithms (6)
- Hashing (1)
- Interview Questions (1)
- J2EE (1)
- Java (5)
- Linked Lists (6)
- LVL:AVG (1)
- Numeric Puzzles (4)
- Programming (1)
- Sorting (2)
- Trees (5)
- Tries (1)
- UNSOLVED (3)
Followers
Blog Archive
-
▼
2008
(52)
-
▼
February
(12)
- Difference b/w Collection and Collections
- Implementation of an efficient MRU Cache in Java
- Difference between Comparable and Comparator
- Find modulo (1 << k) division without using division
- Find if the given integer is even or odd
- Bit Twiddling
- Sorting for large data sizes
- Digits in a factorial
- 1-0 array problem
- Finding repeated numbers in two arrays
- Blogs, Tagging and Summary Problem
- Adobe Written interview questions
-
▼
February
(12)
No comments:
Post a Comment