Zig-Zag World of Algorithm and Data Structures

Home

Home
Basic Data Structures
Advance Data Structures
Algorithms
Exercises
Interview Questions
Puzzles
Design Questions
Conferences and Papers
About The Blog

Advance Data Structures

Random Access List

Tries

Binary Indexed Tree

Suffix Array

Email This BlogThis!Share to Twitter Share to Facebook Share to Pinterest

Subscribe to: Posts (Atom)

Search This Blog

About Me

Nishant Saxena: I am not a Dark Knight of the Batman Series, so obviously I'm not your hero (just yet) and I don't have a sophisticated butler waiting on me 24 hours, I'm however the darkest Knight the unsung hero of the nice man series (from the nice guys finish last metaphor). I'm so dark that I am never seen and no movie shall ever be made on my solidarity life. But in the end I say to you all that stand by batman Joker's motto. " why so serious?...! "

View my complete profile

Followers

Popular Posts

Print permutations of a string

Problem: Print all permutations of a given string Implementation: void stringPerm(std::string s, int len, int i = 0) { if(i == len)...
Amazon Question: Design LRU Cache

It was told that cache will have a key, value pair(int, int). Solution is to take hash with key as cache key and value is Node where Node ...
Microsoft Question: Find diameter of a binary tree

Problem: The diameter or width of a tree is the number of nodes on the longest path between two leaves in the tree. Example: Input: root ...
ThoughtWorks Question: Game of Life

Problem: Given a board with m by n cells, each cell has an initial state live (1) or dead (0). Each cell interacts with its eight neighbors...
Amazon Question: Set inorder successor of each node of Binary Tree

Solution: 1. Do reverse inorder traversal. 2. Set inorder successor to the previous node. Source Code: // Given node structure - stru...
Find Depth of a binary tree

Problem: Given the root of a binary tree, return its depth. A binary tree's depth is the number of nodes along the longest path from th...
Minimum Initial Points to Reach Destination

Given a grid with each cell consisting of positive, negative or no points i.e, zero points. We can move across a cell only if we have pos...
Infibeam Question: Implement T9 Dictionary

Solution is to take hash with key is the number and the value is the list of words which can be made by pressing the digits in the number. F...
Search an element in a row wise and column wise sorted Matrix

Problem: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in e...
Flipkart Question: Clone a linked list with next and random pointer

Problem: Given a Linked List with one pointer of each node pointing to the next node and the second pointer can point to any node/ random ...

Blog Archive

▼ 2024 (41)
- ▼ April (3)
- ► March (22)
- ► February (16)

► 2023 (17)
- ► September (1)
- ► May (1)
- ► February (1)
- ► January (14)

► 2022 (50)
- ► December (23)
- ► November (7)
- ► October (2)
- ► September (4)
- ► July (4)
- ► June (5)
- ► May (4)
- ► March (1)

► 2021 (258)
- ► October (14)
- ► September (18)
- ► August (16)
- ► July (8)
- ► April (15)
- ► March (37)
- ► February (76)
- ► January (74)

► 2020 (184)
- ► December (26)
- ► November (11)
- ► October (44)
- ► September (103)

► 2015 (78)
- ► September (2)
- ► August (3)
- ► July (8)
- ► June (11)
- ► May (23)
- ► April (8)
- ► March (7)
- ► February (14)
- ► January (2)

► 2014 (13)
- ► December (1)
- ► November (4)
- ► September (1)
- ► May (3)
- ► February (3)
- ► January (1)

► 2013 (4)
- ► May (4)

► 2012 (8)
- ► March (6)
- ► January (2)

► 2011 (27)
- ► December (2)
- ► November (3)
- ► October (10)
- ► September (9)
- ► August (2)
- ► May (1)

► 2010 (15)
- ► November (6)
- ► September (1)
- ► August (8)

Powered by Blogger.