Algorithms: Cracking the Coding Interview
System Design: https://www.hiredintech.com/system-design/
Class Design: http://www.hiringlibrary.com/object-oriented-design-interview-for-parking-lot-or-elevator/
OOP: http://www.codeproject.com/Articles/22769/Introduction-to-Object-Oriented-Programming-Concep
System Design: https://www.hiredintech.com/system-design/
Class Design: http://www.hiringlibrary.com/object-oriented-design-interview-for-parking-lot-or-elevator/
OOP: http://www.codeproject.com/Articles/22769/Introduction-to-Object-Oriented-Programming-Concep
- Array of length n, its elements are x-powers of the range (1 to n+1). There is one repeated element, find it.- The interviewer helps you till you reach the final solution, but he keeps asking about time and space complexity of each move you do. He may ask you to implement system functions like pow, sqrt and so on..
- Can static functions work on non-static members?
- Design a logger class?
- What's n-tier applications?
- find first common ancestor in a tree
- optimized sum of array elements divisible by x
- Design chess engine system (no much coding in this one just drawing and design decisions of the system)
- Given an unsorted array of integers in O(n) time complexity. find the first unrepeated element in that array. For example: A = [1 2 3 3 2 1 4 5 6] the answer is 4.
- Given an unsorted array of strings. Count the number of repetitions of each string in that array.
- Given an array of integers. find the element which the sum of elements on its left equals to the sum of elements on its right
- delete an element from a linked list
- how to sort 2 different arrays ,and save the result in the second array, if the first contains n elements, and the second contains m elements, and the second is alocated a length of m+n.
- if you have a linked list ordered like : n1-n2-n3-n4-n5-n6-n7-NULL. how to sort it to be at the order : n2-n1-n4-n3-n6-n5-n7-NULL
C++ semaphore https://gist.github.com/lettergram/431198ac7bd9453b98ec
