Given a string S of distinct character of size N and their corresponding frequency f[ ] i.e. character S[i] has f[i] frequency. Your task is to build the Huffman tree print all the huffman codes in preorder traversal of the tree. Note: While merging if two nodes have the same value, then the node which occurs at first will be taken on the left of Binary Tree and the other one to the right, otherwise Node with less value will be taken on the left of the subtree and other one to the right.
Then they asked a very basic question based on my project, that was difference between authentication and authorisation.
Q: How does HTTP work Q: How is the view controller process works Q: How is memory handled Other questions as well. The coding question needed like a websocket handling on iOS, and you need to do that as production code with no errors without any autocompletion which is not normal at all these days.
* find the all possible words in a 5x5 char array. assume that there is a valid word list, word chars can be any directions. * design system question: design a system like pastebin * coding question: design a library to find/filter files in system using an object oriented programming language
1. Swap node in a linked list 2. Interval merging problem
Programming question - Given reverse polish notation, return the integer value of the expression aka "5,3,+,2,/" would be 5 + 3 = 8 and then 8 / 2 = 4.
DSA Code question on Arrays
How BGP timers work and what's the longest it would take for a route to update?
They asked me to do a bubble sort
Which kind of sort is used by Array in java. What is the complexity?
Viewing 2891 - 2900 interview questions