223 lines
6.7 KiB
JSON
223 lines
6.7 KiB
JSON
|
{
|
||
|
"announcements": [
|
||
|
["Some of Code School's courses are no longer free. We're switching to NodeSchool.io for our Node.js and Express.js challenges.", "http://freecodecamp.com/nodeschool-challenges"],
|
||
|
["Screen Hero is now free on Windows and Mac! Follow these special instructions to install it.", "http://freecodecamp.com/install-screenhero"]
|
||
|
],
|
||
|
"questions": [{
|
||
|
"question": "Time Complexity of Accessing Array Index (int a = ARR[5];)",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Inserting a node in Linked List",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Pushing and Popping on Stack",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Insertion and Removal from Queue",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Finding out the parent or left/right child of a node in a tree stored in Array",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Jumping to Next/Previous element in Doubly Linked List",
|
||
|
"answer": "O(1)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Traversing an array",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Traversing a linked list",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Linear Search",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Deletion of a specific element in a Linked List (Not sorted)",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Comparing two strings",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Checking for Palindrome",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Counting/Bucket Sort",
|
||
|
"answer": "O(n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Binary Search",
|
||
|
"answer": "O(log n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Finding largest/smallest number in a binary search tree",
|
||
|
"answer": "O(log n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Certain Divide and Conquer Algorithms based on Linear functionality",
|
||
|
"answer": "O(log n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Calculating Fibonacci Numbers - Best Method",
|
||
|
"answer": "O(log n)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Merge Sort",
|
||
|
"answer": "O(nlogn)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Heap Sort",
|
||
|
"answer": "O(nlogn)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Quick Sort",
|
||
|
"answer": "O(nlogn)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Certain Divide and Conquer Algorithms based on optimizing O(n^2) algorithms",
|
||
|
"answer": "O(nlogn)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Bubble Sort",
|
||
|
"answer": "O(n^2)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Insertion Sort",
|
||
|
"answer": "O(n^2)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Selection Sort",
|
||
|
"answer": "O(n^2)"
|
||
|
}, {
|
||
|
"question": "Time Complexity of Traversing a simple 2D array",
|
||
|
"answer": "O(n^2)"
|
||
|
}, {
|
||
|
"question": "Latency of L1 cache reference",
|
||
|
"answer": "0.5 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Branch mispredict",
|
||
|
"answer": "5 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of L2 cache reference",
|
||
|
"answer": "7 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Mutex lock/unlock",
|
||
|
"answer": "25 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Main memory reference",
|
||
|
"answer": "100 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Compressing 1K bytes with Zippy",
|
||
|
"answer": "3,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Sending 1K bytes over a 1 Gbps network",
|
||
|
"answer": "10,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Reading 4K randomly from SSD",
|
||
|
"answer": "150,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Reading 1 MB sequentially from memory",
|
||
|
"answer": "250,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of a Round trip within the same datacenter",
|
||
|
"answer": "500,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Reading 1 MB sequentially from SSD",
|
||
|
"answer": "1,000,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Disk seek",
|
||
|
"answer": "10,000,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Reading 1 MB sequentially from disk",
|
||
|
"answer": "20,000,000 nanoseconds"
|
||
|
}, {
|
||
|
"question": "Latency of Sending a packet from California to the Netherlands and back",
|
||
|
"answer": "150,000,000 nanoseconds"
|
||
|
}],
|
||
|
"verbs": [
|
||
|
"aced",
|
||
|
"nailed",
|
||
|
"rocked",
|
||
|
"destroyed",
|
||
|
"owned",
|
||
|
"crushed",
|
||
|
"conquered",
|
||
|
"shredded",
|
||
|
"demolished",
|
||
|
"devoured",
|
||
|
"banished",
|
||
|
"wrangled"
|
||
|
],
|
||
|
"compliments": [
|
||
|
"Over the top!",
|
||
|
"Down the rabbit hole we go!",
|
||
|
"Bring that rain!",
|
||
|
"Target acquired!",
|
||
|
"Feel that need for speed!",
|
||
|
"You've got guts!",
|
||
|
"We have liftoff!",
|
||
|
"To infinity and beyond!",
|
||
|
"Encore!",
|
||
|
"Onward, ho!",
|
||
|
"Challenge destroyed!",
|
||
|
"Power level 9000!",
|
||
|
"Most efficient!",
|
||
|
"Party on, Wayne!",
|
||
|
"You've got the touch!",
|
||
|
"You're on fire!",
|
||
|
"Don't hurt 'em, Hammer!",
|
||
|
"The town is now red!",
|
||
|
"To the nines!",
|
||
|
"Nothing but net!",
|
||
|
"The world rejoices!",
|
||
|
"That's the way it's done!",
|
||
|
"You rock!",
|
||
|
"Woo-hoo!",
|
||
|
"We knew you could do it!",
|
||
|
"Hyper Combo Finish!",
|
||
|
"Nothing but net!",
|
||
|
"Boom-shakalaka!",
|
||
|
"You're a shooting star!",
|
||
|
"You're unstoppable!",
|
||
|
"Way cool!",
|
||
|
"You're king of the world!",
|
||
|
"Walk on that sunshine!",
|
||
|
"Keep on trucking!",
|
||
|
"Off the charts!",
|
||
|
"There is no spoon!",
|
||
|
"Cranked it up to 11!",
|
||
|
"Escape velocity reached!",
|
||
|
"You make this look easy!",
|
||
|
"Passed with flying colors!",
|
||
|
"You've got this!",
|
||
|
"Happy, happy, joy, joy!",
|
||
|
"Tomorrow, the world!",
|
||
|
"Your powers combined!",
|
||
|
"A winner is you!",
|
||
|
"It's alive. It's alive!",
|
||
|
"Sonic Boom!",
|
||
|
"Here's looking at you, Code!",
|
||
|
"Ride like the wind!",
|
||
|
"Legen - wait for it - dary!",
|
||
|
"Ludicrous Speed! Go!",
|
||
|
"Yes you can!",
|
||
|
"Most triumphant!",
|
||
|
"One loop to rule them all!",
|
||
|
"By the power of Grayskull!",
|
||
|
"You did it!",
|
||
|
"Storm that castle!",
|
||
|
"Face-melting guitar Solo!",
|
||
|
"Checkmate!",
|
||
|
"Bodacious!",
|
||
|
"Tubular!",
|
||
|
"You're outta sight!",
|
||
|
"Keep calm and code on!",
|
||
|
"Even sad panda smiles!",
|
||
|
"Even grumpy cat approves!",
|
||
|
"Kool Aid Man says oh yeah!",
|
||
|
"Bullseye!",
|
||
|
"Far out!",
|
||
|
"You're heating up!",
|
||
|
"Hasta la vista, challenge!"
|
||
|
],
|
||
|
"phrases": [
|
||
|
"Shout it from on top of a mountain",
|
||
|
"Tell everyone and their dogs",
|
||
|
"Show them. Show them all!",
|
||
|
"Inspire your friends",
|
||
|
"Tell the world of your greatness",
|
||
|
"Look accomplished on social media",
|
||
|
"Share news of your grand endeavor",
|
||
|
"Establish your alibi for the past two hours",
|
||
|
"Prove to mom that computers aren't just for games",
|
||
|
"With coding power comes sharing responsibility",
|
||
|
"Have you told your friends of your coding powers?"
|
||
|
]
|
||
|
}
|